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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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 Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Apr 11 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 11 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 16:34 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 161K 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-17-CTLCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2023-12
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2023-13
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2023-14
FORMULA_NAME BusinessProcesses-PT-17-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716336910552

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 00:15:11] [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:15:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:15:12] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-22 00:15:12] [INFO ] Transformed 650 places.
[2024-05-22 00:15:12] [INFO ] Transformed 580 transitions.
[2024-05-22 00:15:12] [INFO ] Found NUPN structural information;
[2024-05-22 00:15:12] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 229 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 4 places in 13 ms
Reduce places removed 4 places and 4 transitions.
Support contains 131 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 644 transition count 576
Discarding 70 places :
Symmetric choice reduction at 1 with 70 rule applications. Total rules 72 place count 574 transition count 506
Iterating global reduction 1 with 70 rules applied. Total rules applied 142 place count 574 transition count 506
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 168 place count 548 transition count 480
Iterating global reduction 1 with 26 rules applied. Total rules applied 194 place count 548 transition count 480
Applied a total of 194 rules in 104 ms. Remains 548 /646 variables (removed 98) and now considering 480/576 (removed 96) transitions.
// Phase 1: matrix 480 rows 548 cols
[2024-05-22 00:15:12] [INFO ] Computed 106 invariants in 31 ms
[2024-05-22 00:15:12] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-22 00:15:12] [INFO ] Invariant cache hit.
[2024-05-22 00:15:13] [INFO ] Implicit Places using invariants and state equation in 550 ms returned []
Implicit Place search using SMT with State Equation took 968 ms to find 0 implicit places.
Running 479 sub problems to find dead transitions.
[2024-05-22 00:15:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/546 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/546 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 2/548 variables, 60/102 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/548 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 114 places in 123 ms of which 22 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 92 places in 99 ms of which 5 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 87 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 15 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:15:24] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:15:25] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:15:25] [INFO ] Deduced a trap composed of 120 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:15:25] [INFO ] Deduced a trap composed of 106 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:15:25] [INFO ] Deduced a trap composed of 133 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:15:25] [INFO ] Deduced a trap composed of 118 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:15:25] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:15:25] [INFO ] Deduced a trap composed of 133 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:15:25] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 135 places in 132 ms of which 6 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 135 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 139 places in 158 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-22 00:15:26] [INFO ] Deduced a trap composed of 102 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 107 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 112 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 86 places in 131 ms of which 7 ms to minimize.
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 101 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 119 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:15:28] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 117 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:15:29] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 120 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 104 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 120 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 116 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 115 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 127 places in 146 ms of which 6 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 117 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 120 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:15:31] [INFO ] Deduced a trap composed of 119 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 121 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 117 places in 117 ms of which 13 ms to minimize.
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 116 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 111 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 117 places in 111 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 126 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 115 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 115 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 122 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 117 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 120 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:15:37] [INFO ] Deduced a trap composed of 122 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 132 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 110 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 116 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 120 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 116 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:15:38] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 102 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 118 places in 146 ms of which 4 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 109 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:15:39] [INFO ] Deduced a trap composed of 115 places in 156 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 111 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 125 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 116 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 112 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 118 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:15:40] [INFO ] Deduced a trap composed of 118 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 111 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 86 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 96 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:15:41] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 107 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 102 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 105 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 85 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:15:43] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 479 unsolved
[2024-05-22 00:15:43] [INFO ] Deduced a trap composed of 119 places in 114 ms of which 2 ms to minimize.
SMT process timed out in 30220ms, After SMT, problems are : Problem set: 0 solved, 479 unsolved
Search for dead transitions found 0 dead transitions in 30236ms
Starting structural reductions in LTL mode, iteration 1 : 548/646 places, 480/576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31334 ms. Remains : 548/646 places, 480/576 transitions.
Support contains 131 out of 548 places after structural reductions.
[2024-05-22 00:15:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 00:15:43] [INFO ] Flatten gal took : 54 ms
[2024-05-22 00:15:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BusinessProcesses-PT-17-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:15:43] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:15:43] [INFO ] Input system was already deterministic with 480 transitions.
Support contains 108 out of 548 places (down from 131) after GAL structural reductions.
RANDOM walk for 40000 steps (261 resets) in 2512 ms. (15 steps per ms) remains 33/64 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
[2024-05-22 00:15:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 288/354 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 66/420 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 122/542 variables, 45/105 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/543 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 477/1020 variables, 543/649 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1020 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 8/1028 variables, 5/654 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1028 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 0/1028 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1028/1028 variables, and 654 constraints, problems are : Problem set: 0 solved, 33 unsolved in 2661 ms.
Refiners :[Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 548/548 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 288/354 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 8 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 78 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:15:48] [INFO ] Deduced a trap composed of 103 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 89 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 83 places in 88 ms of which 3 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 3 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/354 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 111 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 102 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 4 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 85 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/354 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 105 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 103 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 97 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 113 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 96 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 101 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 119 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 107 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 102 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 3 ms to minimize.
SMT process timed out in 7771ms, After SMT, problems are : Problem set: 0 solved, 33 unsolved
Fused 33 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 66 out of 548 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 548/548 places, 480/480 transitions.
Graph (trivial) has 207 edges and 548 vertex of which 4 / 548 are part of one of the 1 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1194 edges and 545 vertex of which 544 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 544 transition count 429
Reduce places removed 46 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 52 rules applied. Total rules applied 100 place count 498 transition count 423
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 106 place count 492 transition count 423
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 106 place count 492 transition count 340
Deduced a syphon composed of 83 places in 2 ms
Ensure Unique test removed 11 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 177 rules applied. Total rules applied 283 place count 398 transition count 340
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 297 place count 384 transition count 326
Iterating global reduction 3 with 14 rules applied. Total rules applied 311 place count 384 transition count 326
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 551 place count 263 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
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 553 place count 262 transition count 211
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 555 place count 262 transition count 209
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 557 place count 260 transition count 209
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 562 place count 260 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 563 place count 259 transition count 208
Applied a total of 563 rules in 141 ms. Remains 259 /548 variables (removed 289) and now considering 208/480 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 259/548 places, 208/480 transitions.
RANDOM walk for 40000 steps (8 resets) in 538 ms. (74 steps per ms) remains 8/33 properties
BEST_FIRST walk for 40002 steps (13 resets) in 242 ms. (164 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (10 resets) in 220 ms. (181 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (11 resets) in 151 ms. (263 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40000 steps (11 resets) in 290 ms. (137 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (11 resets) in 191 ms. (208 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 156 ms. (254 steps per ms) remains 5/5 properties
// Phase 1: matrix 208 rows 259 cols
[2024-05-22 00:15:53] [INFO ] Computed 93 invariants in 5 ms
[2024-05-22 00:15:53] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 78/91 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 84/175 variables, 45/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 65/240 variables, 32/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 2/242 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 203/445 variables, 242/329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 18/463 variables, 14/346 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/463 variables, 5/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 2/465 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/465 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 2/467 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/467 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 0/467 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 355 constraints, problems are : Problem set: 0 solved, 5 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 259/259 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 78/91 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 64 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 64 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 84/175 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 7 (OVERLAPS) 65/240 variables, 32/94 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 5 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 55 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 53 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 53 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 3 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 61 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:15:55] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 62 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 20/114 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 54 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 52 places in 87 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 7/121 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2/242 variables, 2/123 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 2/125 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 203/445 variables, 242/367 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/445 variables, 3/370 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/445 variables, 4/374 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:15:56] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 53 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 1 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 56 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 59 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/445 variables, 20/394 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 62 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 53 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 55 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 60 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 56 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 3 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 6 places in 108 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/445 variables, 20/414 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/445 variables, 3/417 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/445 variables, 0/417 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 18/463 variables, 14/431 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/463 variables, 5/436 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/463 variables, 0/436 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 2/465 variables, 1/437 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/465 variables, 0/437 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 26 (OVERLAPS) 2/467 variables, 3/440 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/467 variables, 0/440 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/467 variables, 0/440 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 440 constraints, problems are : Problem set: 3 solved, 2 unsolved in 6439 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 34/34 constraints, State Equation: 259/259 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 81/81 constraints]
After SMT, in 6823ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 297 ms.
Support contains 4 out of 259 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 259/259 places, 208/208 transitions.
Graph (trivial) has 63 edges and 259 vertex of which 4 / 259 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 818 edges and 256 vertex of which 255 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 255 transition count 191
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 242 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 241 transition count 190
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 30 place count 241 transition count 168
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 83 place count 210 transition count 168
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 91 place count 202 transition count 159
Iterating global reduction 3 with 8 rules applied. Total rules applied 99 place count 202 transition count 159
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 141 place count 179 transition count 140
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 143 place count 178 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 177 transition count 139
Applied a total of 144 rules in 82 ms. Remains 177 /259 variables (removed 82) and now considering 139/208 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 177/259 places, 139/208 transitions.
RANDOM walk for 40000 steps (1066 resets) in 301 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (502 resets) in 146 ms. (272 steps per ms) remains 1/2 properties
// Phase 1: matrix 139 rows 177 cols
[2024-05-22 00:16:01] [INFO ] Computed 79 invariants in 2 ms
[2024-05-22 00:16:01] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/65 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/69 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/112 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/118 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/123 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 135/258 variables, 123/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 57/315 variables, 53/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/315 variables, 26/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/315 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/315 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/316 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/316 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/316 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 261 constraints, problems are : Problem set: 0 solved, 1 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 177/177 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/65 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4/69 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 43/112 variables, 16/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 6/118 variables, 6/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/123 variables, 5/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/123 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 135/258 variables, 123/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/258 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 57/315 variables, 53/232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/315 variables, 26/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/315 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/315 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/315 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/316 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/316 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/316 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 262 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 177/177 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 283ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 48 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=48 )
Parikh walk visited 1 properties in 8 ms.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
[2024-05-22 00:16:01] [INFO ] Flatten gal took : 31 ms
[2024-05-22 00:16:01] [INFO ] Flatten gal took : 32 ms
[2024-05-22 00:16:01] [INFO ] Input system was already deterministic with 480 transitions.
Support contains 100 out of 548 places (down from 103) after GAL structural reductions.
Computed a total of 233 stabilizing places and 204 stable transitions
Graph (complete) has 1198 edges and 548 vertex of which 546 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 514 transition count 447
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 514 transition count 447
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 503 transition count 436
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 503 transition count 436
Applied a total of 89 rules in 73 ms. Remains 503 /548 variables (removed 45) and now considering 436/480 (removed 44) transitions.
// Phase 1: matrix 436 rows 503 cols
[2024-05-22 00:16:01] [INFO ] Computed 105 invariants in 10 ms
[2024-05-22 00:16:01] [INFO ] Implicit Places using invariants in 208 ms returned []
[2024-05-22 00:16:01] [INFO ] Invariant cache hit.
[2024-05-22 00:16:02] [INFO ] Implicit Places using invariants and state equation in 595 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2024-05-22 00:16:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 96 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 4 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 69 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 89 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 4 ms to minimize.
[2024-05-22 00:16:12] [INFO ] Deduced a trap composed of 81 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 4 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 79 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:16:13] [INFO ] Deduced a trap composed of 85 places in 144 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 72 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:16:14] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 103 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:16:15] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:16:16] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 4 ms to minimize.
[2024-05-22 00:16:16] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:16:16] [INFO ] Deduced a trap composed of 66 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:16:16] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:16:16] [INFO ] Deduced a trap composed of 110 places in 132 ms of which 3 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/145 constraints. Problems are: Problem set: 14 solved, 421 unsolved
[2024-05-22 00:16:17] [INFO ] Deduced a trap composed of 96 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:16:17] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:16:17] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:16:17] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:16:17] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:16:17] [INFO ] Deduced a trap composed of 96 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:16:17] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:16:18] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:16:18] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:16:18] [INFO ] Deduced a trap composed of 68 places in 161 ms of which 4 ms to minimize.
[2024-05-22 00:16:18] [INFO ] Deduced a trap composed of 94 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:16:18] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:16:18] [INFO ] Deduced a trap composed of 100 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:16:19] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:16:19] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:16:19] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:16:19] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:16:19] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:16:19] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:16:20] [INFO ] Deduced a trap composed of 118 places in 115 ms of which 3 ms to minimize.
Problem TDEAD360 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD410 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/165 constraints. Problems are: Problem set: 23 solved, 412 unsolved
[2024-05-22 00:16:23] [INFO ] Deduced a trap composed of 73 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:16:23] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:16:23] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:16:23] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 4 ms to minimize.
[2024-05-22 00:16:24] [INFO ] Deduced a trap composed of 115 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:16:24] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:16:24] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:16:24] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:16:24] [INFO ] Deduced a trap composed of 85 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:16:24] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:16:25] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:16:25] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:16:25] [INFO ] Deduced a trap composed of 97 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:16:25] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:16:25] [INFO ] Deduced a trap composed of 75 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:16:25] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:16:25] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:16:26] [INFO ] Deduced a trap composed of 114 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:16:26] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:16:26] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 3 ms to minimize.
Problem TDEAD385 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 20/185 constraints. Problems are: Problem set: 24 solved, 411 unsolved
[2024-05-22 00:16:26] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:16:26] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:16:27] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:16:27] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:16:27] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:16:27] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:16:27] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:16:27] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:16:27] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:16:28] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:16:28] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:16:28] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:16:28] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:16:28] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:16:29] [INFO ] Deduced a trap composed of 74 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:16:29] [INFO ] Deduced a trap composed of 91 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:16:29] [INFO ] Deduced a trap composed of 100 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:16:29] [INFO ] Deduced a trap composed of 68 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:16:29] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:16:29] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 3 ms to minimize.
Problem TDEAD389 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 20/205 constraints. Problems are: Problem set: 25 solved, 410 unsolved
[2024-05-22 00:16:30] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:16:30] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:16:30] [INFO ] Deduced a trap composed of 68 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:16:30] [INFO ] Deduced a trap composed of 68 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:16:30] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:16:31] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:16:31] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:16:31] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:16:31] [INFO ] Deduced a trap composed of 19 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:16:31] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:16:31] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:16:31] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 85 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:16:32] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 3 ms to minimize.
SMT process timed out in 30189ms, After SMT, problems are : Problem set: 25 solved, 410 unsolved
Search for dead transitions found 25 dead transitions in 30195ms
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 : 503/548 places, 411/480 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 502 transition count 411
Applied a total of 1 rules in 21 ms. Remains 502 /503 variables (removed 1) and now considering 411/411 (removed 0) transitions.
// Phase 1: matrix 411 rows 502 cols
[2024-05-22 00:16:32] [INFO ] Computed 106 invariants in 6 ms
[2024-05-22 00:16:32] [INFO ] Implicit Places using invariants in 230 ms returned []
[2024-05-22 00:16:32] [INFO ] Invariant cache hit.
[2024-05-22 00:16:33] [INFO ] Implicit Places using invariants and state equation in 655 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 894 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 500/548 places, 411/480 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 32005 ms. Remains : 500/548 places, 411/480 transitions.
[2024-05-22 00:16:33] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:16:33] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:16:33] [INFO ] Input system was already deterministic with 411 transitions.
[2024-05-22 00:16:33] [INFO ] Flatten gal took : 32 ms
[2024-05-22 00:16:33] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:16:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality741529667117063182.gal : 16 ms
[2024-05-22 00:16:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality2490454592539095349.ctl : 4 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/CTLCardinality741529667117063182.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2490454592539095349.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.
Detected timeout of ITS tools.
[2024-05-22 00:17:03] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:17:03] [INFO ] Applying decomposition
[2024-05-22 00:17:03] [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/graph17216837872876366309.txt' '-o' '/tmp/graph17216837872876366309.bin' '-w' '/tmp/graph17216837872876366309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17216837872876366309.bin' '-l' '-1' '-v' '-w' '/tmp/graph17216837872876366309.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:17:03] [INFO ] Decomposing Gal with order
[2024-05-22 00:17:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:17:04] [INFO ] Removed a total of 162 redundant transitions.
[2024-05-22 00:17:04] [INFO ] Flatten gal took : 78 ms
[2024-05-22 00:17:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 27 ms.
[2024-05-22 00:17:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality13629822468486453280.gal : 12 ms
[2024-05-22 00:17:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality15977641429980281833.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/CTLCardinality13629822468486453280.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15977641429980281833.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.95422e+26,1.58619,52944,5310,33,85642,548,1077,208191,48,1314,0


Converting to forward existential form...Done !
original formula: AG(A(AX(!(((i9.i0.u80.p240==0)||(i9.i0.u162.p598==1)))) U ((EX(((i6.u13.p29==0)||(i3.i1.u153.p567==1))) * AF((i13.u104.p311==0))) + ((i15...200
=> equivalent forward existential formula: (([(((FwdU(FwdU(Init,TRUE),!(((EX(((i6.u13.p29==0)||(i3.i1.u153.p567==1))) * !(EG(!((i13.u104.p311==0))))) + ((i...914
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t177, t181, t279, t292, t391, t392, t393, t395, t396, t404, i0.i0.u81.t180, i...1361
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 513 transition count 446
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 513 transition count 446
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 81 place count 501 transition count 434
Iterating global reduction 1 with 12 rules applied. Total rules applied 93 place count 501 transition count 434
Applied a total of 93 rules in 56 ms. Remains 501 /548 variables (removed 47) and now considering 434/480 (removed 46) transitions.
// Phase 1: matrix 434 rows 501 cols
[2024-05-22 00:17:34] [INFO ] Computed 105 invariants in 12 ms
[2024-05-22 00:17:34] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-22 00:17:34] [INFO ] Invariant cache hit.
[2024-05-22 00:17:35] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 941 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-05-22 00:17:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/103 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 4 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 70 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:17:43] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 110 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 79 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:17:44] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 68 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 68 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:17:45] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 11 solved, 422 unsolved
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 4 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 94 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:17:46] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:17:47] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:17:48] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 2 ms to minimize.
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD404 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 20 solved, 413 unsolved
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:17:49] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 68 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:17:50] [INFO ] Deduced a trap composed of 90 places in 172 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 70 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 89 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 85 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:17:52] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 20 solved, 413 unsolved
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 92 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 80 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 93 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 69 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:17:56] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 70 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 87 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:17:57] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 86 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:17:58] [INFO ] Deduced a trap composed of 95 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 3 ms to minimize.
Problem TDEAD357 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/185 constraints. Problems are: Problem set: 21 solved, 412 unsolved
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 68 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:17:59] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 68 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:18:00] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:18:01] [INFO ] Deduced a trap composed of 69 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:18:01] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:18:01] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:18:01] [INFO ] Deduced a trap composed of 82 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:18:01] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:18:01] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:18:02] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:18:02] [INFO ] Deduced a trap composed of 75 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:18:02] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:18:02] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:18:02] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 3 ms to minimize.
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD393 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/205 constraints. Problems are: Problem set: 29 solved, 404 unsolved
[2024-05-22 00:18:03] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:18:03] [INFO ] Deduced a trap composed of 22 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:18:03] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:18:03] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:18:04] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:18:04] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:18:04] [INFO ] Deduced a trap composed of 57 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:18:04] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:18:04] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:18:04] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:18:05] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:18:05] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:18:05] [INFO ] Deduced a trap composed of 84 places in 130 ms of which 3 ms to minimize.
SMT process timed out in 30154ms, After SMT, problems are : Problem set: 29 solved, 404 unsolved
Search for dead transitions found 29 dead transitions in 30166ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 501/548 places, 405/480 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 405
Applied a total of 1 rules in 13 ms. Remains 500 /501 variables (removed 1) and now considering 405/405 (removed 0) transitions.
// Phase 1: matrix 405 rows 500 cols
[2024-05-22 00:18:05] [INFO ] Computed 107 invariants in 9 ms
[2024-05-22 00:18:05] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-22 00:18:05] [INFO ] Invariant cache hit.
[2024-05-22 00:18:06] [INFO ] Implicit Places using invariants and state equation in 549 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 773 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 499/548 places, 405/480 transitions.
Applied a total of 0 rules in 8 ms. Remains 499 /499 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31960 ms. Remains : 499/548 places, 405/480 transitions.
[2024-05-22 00:18:06] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:18:06] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:18:06] [INFO ] Input system was already deterministic with 405 transitions.
[2024-05-22 00:18:06] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:18:06] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:18:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality9167688813872178585.gal : 3 ms
[2024-05-22 00:18:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality6009576878741465250.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/CTLCardinality9167688813872178585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6009576878741465250.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:18:36] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:18:36] [INFO ] Applying decomposition
[2024-05-22 00:18:36] [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/graph8170807377220165659.txt' '-o' '/tmp/graph8170807377220165659.bin' '-w' '/tmp/graph8170807377220165659.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8170807377220165659.bin' '-l' '-1' '-v' '-w' '/tmp/graph8170807377220165659.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:18:36] [INFO ] Decomposing Gal with order
[2024-05-22 00:18:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:18:36] [INFO ] Removed a total of 139 redundant transitions.
[2024-05-22 00:18:36] [INFO ] Flatten gal took : 34 ms
[2024-05-22 00:18:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 10 ms.
[2024-05-22 00:18:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality10406971827098288020.gal : 8 ms
[2024-05-22 00:18:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality8539619377240291123.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/CTLCardinality10406971827098288020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8539619377240291123.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.95422e+26,1.47687,48300,4308,42,85425,606,1028,152341,60,1455,0


Converting to forward existential form...Done !
original formula: EF(AX(FALSE))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t171, t179, t191, t269, t281, t385, t387, t389, t390, t398, i0.i0.t175, i0.i0.u82.t17...1323
(forward)formula 0,1,5.37709,168156,1,0,340237,606,5607,571944,250,1455,915926
FORMULA BusinessProcesses-PT-17-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 513 transition count 446
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 513 transition count 446
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 81 place count 501 transition count 434
Iterating global reduction 1 with 12 rules applied. Total rules applied 93 place count 501 transition count 434
Applied a total of 93 rules in 49 ms. Remains 501 /548 variables (removed 47) and now considering 434/480 (removed 46) transitions.
// Phase 1: matrix 434 rows 501 cols
[2024-05-22 00:18:42] [INFO ] Computed 105 invariants in 6 ms
[2024-05-22 00:18:42] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-05-22 00:18:42] [INFO ] Invariant cache hit.
[2024-05-22 00:18:42] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
Running 433 sub problems to find dead transitions.
[2024-05-22 00:18:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 61/103 constraints. Problems are: Problem set: 0 solved, 433 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 433 unsolved
[2024-05-22 00:18:50] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:18:51] [INFO ] Deduced a trap composed of 83 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:18:51] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:18:51] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:18:51] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:18:51] [INFO ] Deduced a trap composed of 110 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:18:51] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:18:51] [INFO ] Deduced a trap composed of 79 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 67 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 3 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 67 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:18:52] [INFO ] Deduced a trap composed of 64 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 11 solved, 422 unsolved
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:18:53] [INFO ] Deduced a trap composed of 94 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 95 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 94 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 89 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 69 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 89 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD404 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 20 solved, 413 unsolved
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 91 places in 170 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 68 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 4 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 72 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 85 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:18:59] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 20 solved, 413 unsolved
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 80 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 70 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 68 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 67 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 88 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 83 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 92 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 86 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 95 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
Problem TDEAD357 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/185 constraints. Problems are: Problem set: 21 solved, 412 unsolved
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 68 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 99 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 89 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:19:06] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 68 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:19:07] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 4 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 93 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:19:08] [INFO ] Deduced a trap composed of 75 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 68 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 92 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:19:09] [INFO ] Deduced a trap composed of 23 places in 149 ms of which 3 ms to minimize.
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD393 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/205 constraints. Problems are: Problem set: 29 solved, 404 unsolved
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 89 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 22 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 90 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 88 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 85 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 83 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:19:11] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:19:12] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:19:13] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
SMT process timed out in 30146ms, After SMT, problems are : Problem set: 29 solved, 404 unsolved
Search for dead transitions found 29 dead transitions in 30150ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 501/548 places, 405/480 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 405
Applied a total of 1 rules in 12 ms. Remains 500 /501 variables (removed 1) and now considering 405/405 (removed 0) transitions.
// Phase 1: matrix 405 rows 500 cols
[2024-05-22 00:19:13] [INFO ] Computed 107 invariants in 4 ms
[2024-05-22 00:19:13] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-22 00:19:13] [INFO ] Invariant cache hit.
[2024-05-22 00:19:13] [INFO ] Implicit Places using invariants and state equation in 529 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 709 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 499/548 places, 405/480 transitions.
Applied a total of 0 rules in 9 ms. Remains 499 /499 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31765 ms. Remains : 499/548 places, 405/480 transitions.
[2024-05-22 00:19:13] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:19:13] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:19:13] [INFO ] Input system was already deterministic with 405 transitions.
[2024-05-22 00:19:13] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:19:13] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:19:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality5000975004432536302.gal : 3 ms
[2024-05-22 00:19:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality18144645885434188675.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/CTLCardinality5000975004432536302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18144645885434188675.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:19:44] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:19:44] [INFO ] Applying decomposition
[2024-05-22 00:19:44] [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/graph17400719579914155011.txt' '-o' '/tmp/graph17400719579914155011.bin' '-w' '/tmp/graph17400719579914155011.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17400719579914155011.bin' '-l' '-1' '-v' '-w' '/tmp/graph17400719579914155011.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:19:44] [INFO ] Decomposing Gal with order
[2024-05-22 00:19:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:19:44] [INFO ] Removed a total of 142 redundant transitions.
[2024-05-22 00:19:44] [INFO ] Flatten gal took : 28 ms
[2024-05-22 00:19:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 9 ms.
[2024-05-22 00:19:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality15036341516628893832.gal : 6 ms
[2024-05-22 00:19:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality4781540431643794997.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/CTLCardinality15036341516628893832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4781540431643794997.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.95422e+26,1.02829,33264,3606,39,48174,616,1036,144132,56,1378,0


Converting to forward existential form...Done !
original formula: (AG((E(AX((i0.i1.u88.p260==1)) U (i1.u77.p224!=1)) * ((i4.i1.u9.p20==0)||(i16.i4.u37.p117==1)))) + EF(AG(((i1.u4.p10==0)||(i15.u177.p643=...162
=> equivalent forward existential formula: ([(FwdU((Init * !(E(TRUE U !(E(TRUE U !(((i1.u4.p10==0)||(i15.u177.p643==1)))))))),TRUE) * !(E(!(EX(!((i0.i1.u88...346
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t10, t171, t175, t183, t191, t269, t281, t386, t387, t389, t390, t398, i0.i0.u85.t174...1325
(forward)formula 0,1,7.8021,225984,1,0,384278,616,6856,906299,275,1378,928058
FORMULA BusinessProcesses-PT-17-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 519 transition count 452
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 519 transition count 452
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 66 place count 510 transition count 443
Iterating global reduction 1 with 9 rules applied. Total rules applied 75 place count 510 transition count 443
Applied a total of 75 rules in 27 ms. Remains 510 /548 variables (removed 38) and now considering 443/480 (removed 37) transitions.
// Phase 1: matrix 443 rows 510 cols
[2024-05-22 00:19:52] [INFO ] Computed 105 invariants in 7 ms
[2024-05-22 00:19:52] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-22 00:19:52] [INFO ] Invariant cache hit.
[2024-05-22 00:19:52] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
Running 442 sub problems to find dead transitions.
[2024-05-22 00:19:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/509 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/509 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 2 (OVERLAPS) 1/510 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 442 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 442 unsolved
[2024-05-22 00:20:02] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:20:02] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:20:02] [INFO ] Deduced a trap composed of 69 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:20:02] [INFO ] Deduced a trap composed of 74 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:20:02] [INFO ] Deduced a trap composed of 96 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:20:02] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 96 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 96 places in 175 ms of which 4 ms to minimize.
[2024-05-22 00:20:03] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 99 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:20:04] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:20:05] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:20:05] [INFO ] Deduced a trap composed of 98 places in 133 ms of which 3 ms to minimize.
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 20/125 constraints. Problems are: Problem set: 11 solved, 431 unsolved
[2024-05-22 00:20:05] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:20:05] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:20:05] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 99 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:20:06] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 94 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:20:07] [INFO ] Deduced a trap composed of 94 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD416 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/510 variables, 20/145 constraints. Problems are: Problem set: 15 solved, 427 unsolved
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:20:08] [INFO ] Deduced a trap composed of 96 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 95 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 98 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 4 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:20:09] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 95 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:20:10] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 88 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 20/165 constraints. Problems are: Problem set: 15 solved, 427 unsolved
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 98 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 97 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 97 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:20:16] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:20:17] [INFO ] Deduced a trap composed of 93 places in 159 ms of which 4 ms to minimize.
[2024-05-22 00:20:17] [INFO ] Deduced a trap composed of 93 places in 159 ms of which 5 ms to minimize.
Problem TDEAD367 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 20/185 constraints. Problems are: Problem set: 19 solved, 423 unsolved
[2024-05-22 00:20:17] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 98 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 97 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 94 places in 159 ms of which 4 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 88 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 113 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 3 ms to minimize.
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD402 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/510 variables, 20/205 constraints. Problems are: Problem set: 26 solved, 416 unsolved
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 98 places in 145 ms of which 4 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 101 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:20:23] [INFO ] Deduced a trap composed of 101 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:20:23] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 3 ms to minimize.
SMT process timed out in 30181ms, After SMT, problems are : Problem set: 26 solved, 416 unsolved
Search for dead transitions found 26 dead transitions in 30188ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 510/548 places, 417/480 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 509 transition count 417
Applied a total of 1 rules in 12 ms. Remains 509 /510 variables (removed 1) and now considering 417/417 (removed 0) transitions.
// Phase 1: matrix 417 rows 509 cols
[2024-05-22 00:20:23] [INFO ] Computed 106 invariants in 8 ms
[2024-05-22 00:20:23] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-22 00:20:23] [INFO ] Invariant cache hit.
[2024-05-22 00:20:23] [INFO ] Implicit Places using invariants and state equation in 577 ms returned [86]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 804 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 508/548 places, 417/480 transitions.
Applied a total of 0 rules in 11 ms. Remains 508 /508 variables (removed 0) and now considering 417/417 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31954 ms. Remains : 508/548 places, 417/480 transitions.
[2024-05-22 00:20:24] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:20:24] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:20:24] [INFO ] Input system was already deterministic with 417 transitions.
[2024-05-22 00:20:24] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:20:24] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:20:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality11763699589081259004.gal : 2 ms
[2024-05-22 00:20:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality16295128334405007842.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/CTLCardinality11763699589081259004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16295128334405007842.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:20:54] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:20:54] [INFO ] Applying decomposition
[2024-05-22 00:20:54] [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/graph2492302874662965559.txt' '-o' '/tmp/graph2492302874662965559.bin' '-w' '/tmp/graph2492302874662965559.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2492302874662965559.bin' '-l' '-1' '-v' '-w' '/tmp/graph2492302874662965559.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:20:54] [INFO ] Decomposing Gal with order
[2024-05-22 00:20:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:20:54] [INFO ] Removed a total of 151 redundant transitions.
[2024-05-22 00:20:54] [INFO ] Flatten gal took : 29 ms
[2024-05-22 00:20:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 10 ms.
[2024-05-22 00:20:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality11260081555630321372.gal : 7 ms
[2024-05-22 00:20:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality14168738911573114825.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/CTLCardinality11260081555630321372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14168738911573114825.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,2.02946e+26,1.86844,49144,4394,47,76346,559,1119,212040,58,1624,0


Converting to forward existential form...Done !
original formula: ((EF(AX(AG((((i3.i0.u156.p567==0)&&((i16.i1.u129.p424==0)||(i11.u116.p365==1)))&&(((i18.u174.p626==0)||(i7.i2.u112.p348==1))&&((i14.i1.u1...456
=> equivalent forward existential formula: (([(Init * !(E(TRUE U !(EX(!(!(E(TRUE U !((((i3.i0.u156.p567==0)&&((i16.i1.u129.p424==0)||(i11.u116.p365==1)))&&...647
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t10, t180, t192, t200, t278, t286, t290, t397, t399, t402, t410, i0.i0.u136.t77, ...1408
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 an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 514 transition count 447
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 514 transition count 447
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 503 transition count 436
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 503 transition count 436
Applied a total of 89 rules in 68 ms. Remains 503 /548 variables (removed 45) and now considering 436/480 (removed 44) transitions.
// Phase 1: matrix 436 rows 503 cols
[2024-05-22 00:21:24] [INFO ] Computed 105 invariants in 8 ms
[2024-05-22 00:21:24] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-22 00:21:24] [INFO ] Invariant cache hit.
[2024-05-22 00:21:25] [INFO ] Implicit Places using invariants and state equation in 642 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2024-05-22 00:21:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 78 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 79 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:21:34] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 97 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 94 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:21:35] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-05-22 00:21:36] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:21:37] [INFO ] Deduced a trap composed of 94 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:21:38] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/145 constraints. Problems are: Problem set: 15 solved, 420 unsolved
[2024-05-22 00:21:39] [INFO ] Deduced a trap composed of 113 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 94 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:21:40] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:21:41] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:21:42] [INFO ] Deduced a trap composed of 95 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:21:43] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 3 ms to minimize.
Problem TDEAD358 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/165 constraints. Problems are: Problem set: 27 solved, 408 unsolved
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:21:46] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 20 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:21:47] [INFO ] Deduced a trap composed of 75 places in 176 ms of which 4 ms to minimize.
[2024-05-22 00:21:48] [INFO ] Deduced a trap composed of 45 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:21:48] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:21:48] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:21:48] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:21:49] [INFO ] Deduced a trap composed of 94 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:21:49] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:21:49] [INFO ] Deduced a trap composed of 119 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:21:49] [INFO ] Deduced a trap composed of 55 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:21:49] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:21:49] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:21:50] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
Problem TDEAD360 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 20/185 constraints. Problems are: Problem set: 31 solved, 404 unsolved
[2024-05-22 00:21:50] [INFO ] Deduced a trap composed of 93 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:21:50] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:21:51] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 112 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:21:52] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 103 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:21:53] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:21:54] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 20/205 constraints. Problems are: Problem set: 31 solved, 404 unsolved
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 71 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 114 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:21:55] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 3 ms to minimize.
SMT process timed out in 30185ms, After SMT, problems are : Problem set: 31 solved, 404 unsolved
Search for dead transitions found 31 dead transitions in 30193ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in LTL mode, iteration 1 : 503/548 places, 405/480 transitions.
Applied a total of 0 rules in 10 ms. Remains 503 /503 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31186 ms. Remains : 503/548 places, 405/480 transitions.
[2024-05-22 00:21:55] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:21:55] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:21:55] [INFO ] Input system was already deterministic with 405 transitions.
[2024-05-22 00:21:55] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:21:55] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:21:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality13997573089099509120.gal : 2 ms
[2024-05-22 00:21:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality17855536886308605163.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/CTLCardinality13997573089099509120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17855536886308605163.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:22:25] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:22:25] [INFO ] Applying decomposition
[2024-05-22 00:22:25] [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/graph10461947152748518308.txt' '-o' '/tmp/graph10461947152748518308.bin' '-w' '/tmp/graph10461947152748518308.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10461947152748518308.bin' '-l' '-1' '-v' '-w' '/tmp/graph10461947152748518308.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:22:25] [INFO ] Decomposing Gal with order
[2024-05-22 00:22:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:22:25] [INFO ] Removed a total of 126 redundant transitions.
[2024-05-22 00:22:25] [INFO ] Flatten gal took : 31 ms
[2024-05-22 00:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2024-05-22 00:22:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality17312150161193401169.gal : 6 ms
[2024-05-22 00:22:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality13604910282624167858.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/CTLCardinality17312150161193401169.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13604910282624167858.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.95519e+26,1.47342,40608,4205,52,56305,616,1029,150928,59,1460,0


Converting to forward existential form...Done !
original formula: AF((EX(AF((i14.i0.u114.p348==1))) * (AX(AX(AF(((i17.u150.p544==0)||(i7.i1.u110.p328==1))))) + (EF((i10.i0.u63.p186==1)) * EF(!(A((i3.i1.u...194
=> equivalent forward existential formula: [FwdG(Init,!((EX(!(EG(!((i14.i0.u114.p348==1))))) * (!(EX(!(!(EX(!(!(EG(!(((i17.u150.p544==0)||(i7.i1.u110.p328=...340
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t173, t181, t193, t271, t279, t283, t385, t387, t389, t390, t398, i0.i0.u89.t168, i0...1342
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Graph (trivial) has 271 edges and 548 vertex of which 7 / 548 are part of one of the 1 SCC in 6 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1191 edges and 542 vertex of which 540 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 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 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 71 place count 539 transition count 402
Reduce places removed 69 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 470 transition count 401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 142 place count 469 transition count 401
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 142 place count 469 transition count 293
Deduced a syphon composed of 108 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 376 place count 343 transition count 293
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 407 place count 312 transition count 262
Iterating global reduction 3 with 31 rules applied. Total rules applied 438 place count 312 transition count 262
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 438 place count 312 transition count 261
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 440 place count 311 transition count 261
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 255 rules applied. Total rules applied 695 place count 181 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 696 place count 180 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 697 place count 179 transition count 135
Applied a total of 697 rules in 79 ms. Remains 179 /548 variables (removed 369) and now considering 135/480 (removed 345) transitions.
// Phase 1: matrix 135 rows 179 cols
[2024-05-22 00:22:56] [INFO ] Computed 81 invariants in 1 ms
[2024-05-22 00:22:56] [INFO ] Implicit Places using invariants in 141 ms returned [0, 1, 2, 3, 4, 8, 9, 34, 35, 36, 37, 44, 45, 46, 51, 52, 55, 56, 57, 58, 59, 135, 148]
Discarding 23 places :
Implicit Place search using SMT only with invariants took 144 ms to find 23 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 156/548 places, 135/480 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 230 ms. Remains : 156/548 places, 135/480 transitions.
[2024-05-22 00:22:56] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:22:56] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:22:56] [INFO ] Input system was already deterministic with 135 transitions.
[2024-05-22 00:22:56] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:22:56] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:22:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality1386020569497234552.gal : 1 ms
[2024-05-22 00:22:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality14794391693838698586.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/CTLCardinality1386020569497234552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14794391693838698586.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: !(E((p220!=1) U AF(EG((p91!=0)))))
=> equivalent forward existential formula: [(FwdU(Init,(p220!=1)) * !(EG(!(EG((p91!=0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t27, t28, t29, t30, t31, t66, t67, t68, t69, t70, t87, t88, t89, t105, t109, t110, t111,...262
(forward)formula 0,1,1.06554,36644,1,0,215,152457,261,116,5696,121144,310
FORMULA BusinessProcesses-PT-17-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 516 transition count 449
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 516 transition count 449
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 74 place count 505 transition count 438
Iterating global reduction 1 with 11 rules applied. Total rules applied 85 place count 505 transition count 438
Applied a total of 85 rules in 30 ms. Remains 505 /548 variables (removed 43) and now considering 438/480 (removed 42) transitions.
// Phase 1: matrix 438 rows 505 cols
[2024-05-22 00:22:57] [INFO ] Computed 105 invariants in 4 ms
[2024-05-22 00:22:57] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-05-22 00:22:57] [INFO ] Invariant cache hit.
[2024-05-22 00:22:58] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Running 437 sub problems to find dead transitions.
[2024-05-22 00:22:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 1/505 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 75 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 73 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:23:07] [INFO ] Deduced a trap composed of 97 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 100 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 98 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:23:08] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 96 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:23:09] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 103 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 95 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:23:10] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 4 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:23:11] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 107 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:23:12] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 90 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 97 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:23:13] [INFO ] Deduced a trap composed of 98 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 96 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 102 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:23:14] [INFO ] Deduced a trap composed of 86 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 101 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 102 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:23:15] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 2 ms to minimize.
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 20/165 constraints. Problems are: Problem set: 6 solved, 431 unsolved
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:23:18] [INFO ] Deduced a trap composed of 86 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 103 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:23:19] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 50 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 2 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 0 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:23:20] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 20/185 constraints. Problems are: Problem set: 6 solved, 431 unsolved
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 96 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:23:21] [INFO ] Deduced a trap composed of 100 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:23:22] [INFO ] Deduced a trap composed of 100 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 114 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 88 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 94 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:23:23] [INFO ] Deduced a trap composed of 89 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 3 ms to minimize.
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD388 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 20/205 constraints. Problems are: Problem set: 10 solved, 427 unsolved
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:23:24] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 99 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:23:25] [INFO ] Deduced a trap composed of 98 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:23:26] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 96 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:23:27] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 20/225 constraints. Problems are: Problem set: 29 solved, 408 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/943 variables, and 225 constraints, problems are : Problem set: 29 solved, 408 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/505 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 29 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 42/42 constraints. Problems are: Problem set: 29 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/42 constraints. Problems are: Problem set: 29 solved, 408 unsolved
At refinement iteration 2 (OVERLAPS) 1/505 variables, 59/101 constraints. Problems are: Problem set: 29 solved, 408 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 4/105 constraints. Problems are: Problem set: 29 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 120/225 constraints. Problems are: Problem set: 29 solved, 408 unsolved
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 88 places in 188 ms of which 3 ms to minimize.
[2024-05-22 00:23:31] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 91 places in 186 ms of which 5 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 91 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:23:32] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 95 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 4 ms to minimize.
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:23:33] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:23:34] [INFO ] Deduced a trap composed of 90 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:23:34] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:23:34] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:23:34] [INFO ] Deduced a trap composed of 83 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:23:34] [INFO ] Deduced a trap composed of 87 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:23:34] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 20/245 constraints. Problems are: Problem set: 29 solved, 408 unsolved
[2024-05-22 00:23:35] [INFO ] Deduced a trap composed of 20 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:23:35] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:23:35] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:23:35] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 4 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:23:36] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 94 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 87 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:23:37] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:23:38] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
Problem TDEAD371 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 20/265 constraints. Problems are: Problem set: 30 solved, 407 unsolved
[2024-05-22 00:23:39] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 2 ms to minimize.
[2024-05-22 00:23:39] [INFO ] Deduced a trap composed of 84 places in 140 ms of which 4 ms to minimize.
[2024-05-22 00:23:39] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:23:39] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:23:40] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:23:40] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:23:40] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:23:40] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:23:40] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:40] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:23:40] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:23:40] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:23:41] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:23:41] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:23:41] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:23:41] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:23:41] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:23:41] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:23:41] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:23:41] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 3 ms to minimize.
Problem TDEAD387 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 20/285 constraints. Problems are: Problem set: 31 solved, 406 unsolved
[2024-05-22 00:23:42] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:23:42] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:23:43] [INFO ] Deduced a trap composed of 97 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:23:43] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:23:43] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:23:43] [INFO ] Deduced a trap composed of 94 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:23:43] [INFO ] Deduced a trap composed of 87 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:23:43] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:23:43] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:23:44] [INFO ] Deduced a trap composed of 95 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:23:44] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:23:44] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:23:44] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:23:44] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:23:44] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:23:44] [INFO ] Deduced a trap composed of 96 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:23:45] [INFO ] Deduced a trap composed of 101 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:23:45] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:23:45] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:23:45] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD413 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 20/305 constraints. Problems are: Problem set: 36 solved, 401 unsolved
[2024-05-22 00:23:46] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:23:46] [INFO ] Deduced a trap composed of 95 places in 178 ms of which 2 ms to minimize.
[2024-05-22 00:23:46] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:23:46] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:23:47] [INFO ] Deduced a trap composed of 91 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:23:47] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:23:47] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:23:47] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:23:47] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:23:47] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:23:47] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:23:47] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:23:47] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:23:48] [INFO ] Deduced a trap composed of 97 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:23:48] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:23:48] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:23:48] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:23:48] [INFO ] Deduced a trap composed of 84 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:23:48] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:23:48] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 20/325 constraints. Problems are: Problem set: 36 solved, 401 unsolved
[2024-05-22 00:23:50] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:23:50] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:23:50] [INFO ] Deduced a trap composed of 93 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:23:51] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:23:51] [INFO ] Deduced a trap composed of 99 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:23:51] [INFO ] Deduced a trap composed of 104 places in 174 ms of which 3 ms to minimize.
[2024-05-22 00:23:51] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:23:52] [INFO ] Deduced a trap composed of 88 places in 160 ms of which 2 ms to minimize.
[2024-05-22 00:23:52] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:23:52] [INFO ] Deduced a trap composed of 93 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:23:52] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:23:52] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:23:52] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:23:52] [INFO ] Deduced a trap composed of 95 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:23:53] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:23:53] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:23:53] [INFO ] Deduced a trap composed of 90 places in 161 ms of which 2 ms to minimize.
[2024-05-22 00:23:53] [INFO ] Deduced a trap composed of 27 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:23:53] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:23:53] [INFO ] Deduced a trap composed of 104 places in 123 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 20/345 constraints. Problems are: Problem set: 36 solved, 401 unsolved
[2024-05-22 00:23:55] [INFO ] Deduced a trap composed of 89 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:23:55] [INFO ] Deduced a trap composed of 89 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:23:55] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:23:55] [INFO ] Deduced a trap composed of 97 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:23:55] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:23:56] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:23:56] [INFO ] Deduced a trap composed of 97 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:23:57] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:23:57] [INFO ] Deduced a trap composed of 120 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:23:57] [INFO ] Deduced a trap composed of 96 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:23:57] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:23:57] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:23:57] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:23:57] [INFO ] Deduced a trap composed of 70 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:23:58] [INFO ] Deduced a trap composed of 98 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:23:58] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 2 ms to minimize.
SMT process timed out in 60127ms, After SMT, problems are : Problem set: 36 solved, 401 unsolved
Search for dead transitions found 36 dead transitions in 60131ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in LTL mode, iteration 1 : 505/548 places, 402/480 transitions.
Ensure Unique test removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 502 transition count 402
Applied a total of 3 rules in 10 ms. Remains 502 /505 variables (removed 3) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 502 cols
[2024-05-22 00:23:58] [INFO ] Computed 111 invariants in 3 ms
[2024-05-22 00:23:58] [INFO ] Implicit Places using invariants in 226 ms returned []
[2024-05-22 00:23:58] [INFO ] Invariant cache hit.
[2024-05-22 00:23:58] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 738 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 502/548 places, 402/480 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61607 ms. Remains : 502/548 places, 402/480 transitions.
[2024-05-22 00:23:58] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:23:58] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:23:59] [INFO ] Input system was already deterministic with 402 transitions.
[2024-05-22 00:23:59] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:23:59] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:23:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality3721775208719612679.gal : 2 ms
[2024-05-22 00:23:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality1630667200695338288.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/CTLCardinality3721775208719612679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1630667200695338288.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:24:29] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:24:29] [INFO ] Applying decomposition
[2024-05-22 00:24:29] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5493710490126616592.txt' '-o' '/tmp/graph5493710490126616592.bin' '-w' '/tmp/graph5493710490126616592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5493710490126616592.bin' '-l' '-1' '-v' '-w' '/tmp/graph5493710490126616592.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:24:29] [INFO ] Decomposing Gal with order
[2024-05-22 00:24:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:24:29] [INFO ] Removed a total of 106 redundant transitions.
[2024-05-22 00:24:29] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:24:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-22 00:24:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality15089332500930086759.gal : 4 ms
[2024-05-22 00:24:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality11786550080706567766.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/CTLCardinality15089332500930086759.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11786550080706567766.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,2.0322e+26,1.56901,45664,5885,33,68542,489,982,154038,50,1350,0


Converting to forward existential form...Done !
original formula: AX((EF(AG(((i14.u150.p535==0)||(i12.u107.p321==1)))) * ((EG((i14.u137.p510==0)) + AX(((i1.i2.u133.p444==0)||(i2.u78.p233==1)))) + AF(((i7...199
=> equivalent forward existential formula: ([(EY(Init) * !(E(TRUE U !(E(TRUE U !(((i14.u150.p535==0)||(i12.u107.p321==1))))))))] = FALSE * [FwdG((EY(Init) ...297
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t175, t183, t273, t285, t382, t384, t386, t387, t395, i0.i0.u136.t71, i0.i1.u86.t173...1377
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 514 transition count 447
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 514 transition count 447
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 79 place count 502 transition count 435
Iterating global reduction 1 with 12 rules applied. Total rules applied 91 place count 502 transition count 435
Applied a total of 91 rules in 61 ms. Remains 502 /548 variables (removed 46) and now considering 435/480 (removed 45) transitions.
// Phase 1: matrix 435 rows 502 cols
[2024-05-22 00:24:59] [INFO ] Computed 105 invariants in 4 ms
[2024-05-22 00:24:59] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-22 00:24:59] [INFO ] Invariant cache hit.
[2024-05-22 00:25:00] [INFO ] Implicit Places using invariants and state equation in 604 ms returned []
Implicit Place search using SMT with State Equation took 859 ms to find 0 implicit places.
Running 434 sub problems to find dead transitions.
[2024-05-22 00:25:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 434 unsolved
[2024-05-22 00:25:08] [INFO ] Deduced a trap composed of 68 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:25:08] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:25:08] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:25:09] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:25:09] [INFO ] Deduced a trap composed of 71 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:25:09] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:25:09] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:25:09] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:25:09] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:25:09] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:25:09] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 64 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:25:10] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 95 places in 116 ms of which 2 ms to minimize.
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/125 constraints. Problems are: Problem set: 13 solved, 421 unsolved
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 109 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:25:11] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 105 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 91 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:25:12] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:25:13] [INFO ] Deduced a trap composed of 86 places in 118 ms of which 2 ms to minimize.
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/145 constraints. Problems are: Problem set: 19 solved, 415 unsolved
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 97 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:25:14] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 115 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 90 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:25:15] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:25:16] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 92 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:25:17] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/165 constraints. Problems are: Problem set: 19 solved, 415 unsolved
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 77 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 129 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:25:20] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 69 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:25:21] [INFO ] Deduced a trap composed of 69 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 71 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:25:22] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:25:23] [INFO ] Deduced a trap composed of 74 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:25:23] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 20/185 constraints. Problems are: Problem set: 19 solved, 415 unsolved
[2024-05-22 00:25:23] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 90 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:25:24] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:25:25] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:25:25] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:25:25] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:25:26] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:25:26] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:25:27] [INFO ] Deduced a trap composed of 94 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:25:27] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:25:27] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:25:27] [INFO ] Deduced a trap composed of 91 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:25:27] [INFO ] Deduced a trap composed of 85 places in 192 ms of which 4 ms to minimize.
[2024-05-22 00:25:28] [INFO ] Deduced a trap composed of 90 places in 163 ms of which 4 ms to minimize.
[2024-05-22 00:25:28] [INFO ] Deduced a trap composed of 96 places in 186 ms of which 3 ms to minimize.
[2024-05-22 00:25:28] [INFO ] Deduced a trap composed of 95 places in 180 ms of which 3 ms to minimize.
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 20/205 constraints. Problems are: Problem set: 23 solved, 411 unsolved
[2024-05-22 00:25:29] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:25:29] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:25:30] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:25:30] [INFO ] Deduced a trap composed of 91 places in 144 ms of which 3 ms to minimize.
SMT process timed out in 30116ms, After SMT, problems are : Problem set: 23 solved, 411 unsolved
Search for dead transitions found 23 dead transitions in 30121ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in LTL mode, iteration 1 : 502/548 places, 412/480 transitions.
Applied a total of 0 rules in 8 ms. Remains 502 /502 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31049 ms. Remains : 502/548 places, 412/480 transitions.
[2024-05-22 00:25:30] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:25:30] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:25:30] [INFO ] Input system was already deterministic with 412 transitions.
[2024-05-22 00:25:30] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:25:30] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:25:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality14196861865444872690.gal : 2 ms
[2024-05-22 00:25:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality2470063905629380120.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/CTLCardinality14196861865444872690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2470063905629380120.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:00] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:26:00] [INFO ] Applying decomposition
[2024-05-22 00:26:00] [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/graph13551075356866635595.txt' '-o' '/tmp/graph13551075356866635595.bin' '-w' '/tmp/graph13551075356866635595.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13551075356866635595.bin' '-l' '-1' '-v' '-w' '/tmp/graph13551075356866635595.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:26:00] [INFO ] Decomposing Gal with order
[2024-05-22 00:26:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:26:00] [INFO ] Removed a total of 163 redundant transitions.
[2024-05-22 00:26:00] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:26:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2024-05-22 00:26:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality1008284060754381471.gal : 6 ms
[2024-05-22 00:26:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality14099832563654867411.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/CTLCardinality1008284060754381471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14099832563654867411.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.9544e+26,2.30138,68412,5219,38,118929,458,1075,279615,52,1264,0


Converting to forward existential form...Done !
original formula: AX(EF((i14.u136.p489==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (i14.u136.p489==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t9, t172, t176, t270, t282, t393, t394, t396, t397, t405, i0.i0.u135.t69, i0.i1.u84.t...1389
(forward)formula 0,1,10.175,300468,1,0,574326,458,7144,1.0818e+06,240,1264,1288420
FORMULA BusinessProcesses-PT-17-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 516 transition count 449
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 516 transition count 449
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 74 place count 505 transition count 438
Iterating global reduction 1 with 11 rules applied. Total rules applied 85 place count 505 transition count 438
Applied a total of 85 rules in 64 ms. Remains 505 /548 variables (removed 43) and now considering 438/480 (removed 42) transitions.
// Phase 1: matrix 438 rows 505 cols
[2024-05-22 00:26:10] [INFO ] Computed 105 invariants in 3 ms
[2024-05-22 00:26:11] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-22 00:26:11] [INFO ] Invariant cache hit.
[2024-05-22 00:26:11] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
Running 437 sub problems to find dead transitions.
[2024-05-22 00:26:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 2 (OVERLAPS) 1/505 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 437 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 437 unsolved
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 95 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:26:21] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 71 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:26:22] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 1 ms to minimize.
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 20/125 constraints. Problems are: Problem set: 11 solved, 426 unsolved
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:26:23] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 83 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 91 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:26:24] [INFO ] Deduced a trap composed of 94 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 81 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 87 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 73 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:26:25] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 2 ms to minimize.
Problem TDEAD362 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 20/145 constraints. Problems are: Problem set: 17 solved, 420 unsolved
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:26:26] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:26:27] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:28] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 92 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:29] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 3 ms to minimize.
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD387 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 20/165 constraints. Problems are: Problem set: 21 solved, 416 unsolved
[2024-05-22 00:26:32] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:26:33] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:26:34] [INFO ] Deduced a trap composed of 86 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:26:35] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 4 ms to minimize.
[2024-05-22 00:26:35] [INFO ] Deduced a trap composed of 74 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 4 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 75 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:26:36] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 20/185 constraints. Problems are: Problem set: 21 solved, 416 unsolved
[2024-05-22 00:26:37] [INFO ] Deduced a trap composed of 74 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:26:37] [INFO ] Deduced a trap composed of 95 places in 171 ms of which 4 ms to minimize.
[2024-05-22 00:26:37] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:26:37] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:26:38] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:26:38] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:26:38] [INFO ] Deduced a trap composed of 98 places in 178 ms of which 3 ms to minimize.
[2024-05-22 00:26:38] [INFO ] Deduced a trap composed of 91 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:26:38] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 8 ms to minimize.
[2024-05-22 00:26:39] [INFO ] Deduced a trap composed of 93 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:26:39] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:39] [INFO ] Deduced a trap composed of 92 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:26:39] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:26:39] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:26:39] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:26:39] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:26:40] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:26:40] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:26:40] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:26:40] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 20/205 constraints. Problems are: Problem set: 21 solved, 416 unsolved
[2024-05-22 00:26:40] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:26:41] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:26:41] [INFO ] Deduced a trap composed of 93 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:26:41] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 505/943 variables, and 209 constraints, problems are : Problem set: 21 solved, 416 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/505 constraints, PredecessorRefiner: 437/437 constraints, Known Traps: 104/104 constraints]
Escalating to Integer solving :Problem set: 21 solved, 416 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/504 variables, 42/42 constraints. Problems are: Problem set: 21 solved, 416 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/504 variables, 0/42 constraints. Problems are: Problem set: 21 solved, 416 unsolved
At refinement iteration 2 (OVERLAPS) 1/505 variables, 59/101 constraints. Problems are: Problem set: 21 solved, 416 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/505 variables, 4/105 constraints. Problems are: Problem set: 21 solved, 416 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/505 variables, 104/209 constraints. Problems are: Problem set: 21 solved, 416 unsolved
[2024-05-22 00:26:45] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 92 places in 158 ms of which 4 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:26:46] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:47] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:26:47] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:26:47] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:26:47] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:26:47] [INFO ] Deduced a trap composed of 98 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:26:47] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:26:47] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:26:48] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:26:48] [INFO ] Deduced a trap composed of 89 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:26:48] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:26:48] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:26:48] [INFO ] Deduced a trap composed of 88 places in 126 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 20/229 constraints. Problems are: Problem set: 21 solved, 416 unsolved
[2024-05-22 00:26:49] [INFO ] Deduced a trap composed of 94 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:26:49] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:26:49] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:26:49] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:49] [INFO ] Deduced a trap composed of 98 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:26:50] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:26:50] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:26:50] [INFO ] Deduced a trap composed of 96 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:26:50] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:26:50] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:26:50] [INFO ] Deduced a trap composed of 92 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:26:50] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:26:51] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:26:51] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:26:51] [INFO ] Deduced a trap composed of 93 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:26:51] [INFO ] Deduced a trap composed of 96 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:26:51] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:26:51] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 2 ms to minimize.
[2024-05-22 00:26:52] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:26:52] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 3 ms to minimize.
Problem TDEAD375 is UNSAT
Problem TDEAD384 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 20/249 constraints. Problems are: Problem set: 23 solved, 414 unsolved
[2024-05-22 00:26:52] [INFO ] Deduced a trap composed of 92 places in 137 ms of which 4 ms to minimize.
[2024-05-22 00:26:52] [INFO ] Deduced a trap composed of 91 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:26:53] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:26:53] [INFO ] Deduced a trap composed of 108 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:26:53] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:26:53] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:26:53] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:26:53] [INFO ] Deduced a trap composed of 77 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:26:54] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:26:54] [INFO ] Deduced a trap composed of 90 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:26:54] [INFO ] Deduced a trap composed of 71 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:26:54] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:26:54] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:26:54] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:26:54] [INFO ] Deduced a trap composed of 79 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:26:55] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:26:55] [INFO ] Deduced a trap composed of 84 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:26:55] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:26:55] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:26:55] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 20/269 constraints. Problems are: Problem set: 23 solved, 414 unsolved
[2024-05-22 00:26:56] [INFO ] Deduced a trap composed of 98 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:26:56] [INFO ] Deduced a trap composed of 94 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:26:56] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:26:56] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:26:57] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:26:57] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:26:57] [INFO ] Deduced a trap composed of 93 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:26:57] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:26:57] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:26:57] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:26:58] [INFO ] Deduced a trap composed of 98 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:26:58] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:26:58] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:26:58] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:26:58] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:26:59] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:26:59] [INFO ] Deduced a trap composed of 95 places in 177 ms of which 3 ms to minimize.
[2024-05-22 00:26:59] [INFO ] Deduced a trap composed of 12 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:26:59] [INFO ] Deduced a trap composed of 91 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:26:59] [INFO ] Deduced a trap composed of 93 places in 161 ms of which 3 ms to minimize.
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD376 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/505 variables, 20/289 constraints. Problems are: Problem set: 26 solved, 411 unsolved
[2024-05-22 00:27:00] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:27:00] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:27:00] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:27:00] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:27:00] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:27:01] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:27:01] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:27:01] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 2 ms to minimize.
[2024-05-22 00:27:02] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:27:02] [INFO ] Deduced a trap composed of 85 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:27:02] [INFO ] Deduced a trap composed of 90 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:27:02] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:27:02] [INFO ] Deduced a trap composed of 115 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:27:02] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:27:02] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:27:03] [INFO ] Deduced a trap composed of 71 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:27:03] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:27:03] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:27:03] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:27:03] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
Problem TDEAD397 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/505 variables, 20/309 constraints. Problems are: Problem set: 27 solved, 410 unsolved
[2024-05-22 00:27:04] [INFO ] Deduced a trap composed of 91 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:27:04] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:27:04] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 103 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 89 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 91 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:27:05] [INFO ] Deduced a trap composed of 43 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 86 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 27 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:27:06] [INFO ] Deduced a trap composed of 91 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:27:07] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
Problem TDEAD379 is UNSAT
Problem TDEAD393 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/505 variables, 20/329 constraints. Problems are: Problem set: 29 solved, 408 unsolved
[2024-05-22 00:27:08] [INFO ] Deduced a trap composed of 68 places in 170 ms of which 3 ms to minimize.
[2024-05-22 00:27:09] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:27:09] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:27:09] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:27:09] [INFO ] Deduced a trap composed of 72 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:27:09] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:27:09] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:27:09] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:27:10] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:27:10] [INFO ] Deduced a trap composed of 74 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:27:11] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:27:11] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:27:11] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:27:11] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 2 ms to minimize.
(s427 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 1)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 1)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 1)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 1)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 1)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 1)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 1)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 1)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 1)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 1)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 1)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 1)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 1)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 1)
(s211 1)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 1)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 1)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s233 1)
(s234 1)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 1)
(s271 0)
(s272 0)
(s273 1)
(s274 0)
(s275 0)
(s276 0)
(s277 1)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 1)
(s283 0)
(s284 0)
(s285 0)
(s286 1)
(s287 0)
(s288 0)
(s289 1)
(s290 0)
(s291 1)
(s292 1)
(s293 1)
(s294 0)
(s295 0)
(s296 0)
(s297 1)
(s298 0)
(s299 0)
(s300 1)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 0)
(s306 0)
(s307 0)
(s308 1)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 1)
(s317 0)
(s318 0)
(s319 0)
(s320 1)
(s321 0)
(s322 0)
(s323 0)
(s324 1)
(s325 0)
(s326 0)
(s327 0)
(s328 1)
(s329 0)
(s330 0)
(s331 1)
(s332 0)
(s333 0)
(s334 1)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 1)
(s340 0)
(s341 0)
(s342 0)
(s343 1)
(s344 0)
(s345 0)
(s346 0)
(s347 1)
(s348 0)
(s349 0)
(s350 0)
(s351 1)
(s352 0)
(s353 0)
(s354 0)
(s355 1)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 1)
(s362 0)
(s363 1)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 1)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 1)
(s374 0)
(s375 1)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 1)
(s381 0)
(s382 0)
(s383 0)
(s384 1)
(s385 0)
(s386 0)
(s387 0)
(s388 1)
(s389 0)
(s390 0)
(s391 0)
(s392 1)
(s393 0)
(s394 0)
(s395 0)
(s396 1)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 505/943 variables, and 343 constraints, problems are : Problem set: 29 solved, 408 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 0/505 constraints, PredecessorRefiner: 0/437 constraints, Known Traps: 238/238 constraints]
After SMT, in 60172ms problems are : Problem set: 29 solved, 408 unsolved
Search for dead transitions found 29 dead transitions in 60177ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 505/548 places, 409/480 transitions.
Applied a total of 0 rules in 11 ms. Remains 505 /505 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61068 ms. Remains : 505/548 places, 409/480 transitions.
[2024-05-22 00:27:11] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:27:11] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:27:11] [INFO ] Input system was already deterministic with 409 transitions.
[2024-05-22 00:27:11] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:27:11] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:27:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality7414834601862919043.gal : 2 ms
[2024-05-22 00:27:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality12956245968524309183.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/CTLCardinality7414834601862919043.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12956245968524309183.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:27:41] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:27:41] [INFO ] Applying decomposition
[2024-05-22 00:27:41] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13081752955971579942.txt' '-o' '/tmp/graph13081752955971579942.bin' '-w' '/tmp/graph13081752955971579942.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13081752955971579942.bin' '-l' '-1' '-v' '-w' '/tmp/graph13081752955971579942.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:27:42] [INFO ] Decomposing Gal with order
[2024-05-22 00:27:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:27:42] [INFO ] Removed a total of 137 redundant transitions.
[2024-05-22 00:27:42] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:27:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 00:27:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality13949481860522739197.gal : 3 ms
[2024-05-22 00:27:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality2540478854242946650.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/CTLCardinality13949481860522739197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2540478854242946650.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.95444e+26,1.42674,42776,5279,39,68108,585,961,181497,57,1416,0


Converting to forward existential form...Done !
original formula: AX(AG(!(A(!(E((i8.u132.p446==1) U (i16.u163.p605==1))) U (((i14.u149.p542==0)&&(i16.u170.p623==0))&&((i16.u136.p487==1)&&(i9.u126.p414==1...162
=> equivalent forward existential formula: [((FwdU(EY(Init),TRUE) * !(EG(!((((i14.u149.p542==0)&&(i16.u170.p623==0))&&((i16.u136.p487==1)&&(i9.u126.p414==1...408
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t175, t183, t195, t273, t281, t389, t390, t391, t393, t394, t402, i0.u85.t173, i...1255
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 520 transition count 453
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 520 transition count 453
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 512 transition count 445
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 512 transition count 445
Applied a total of 71 rules in 31 ms. Remains 512 /548 variables (removed 36) and now considering 445/480 (removed 35) transitions.
// Phase 1: matrix 445 rows 512 cols
[2024-05-22 00:28:12] [INFO ] Computed 105 invariants in 8 ms
[2024-05-22 00:28:12] [INFO ] Implicit Places using invariants in 197 ms returned []
[2024-05-22 00:28:12] [INFO ] Invariant cache hit.
[2024-05-22 00:28:13] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 960 ms to find 0 implicit places.
Running 444 sub problems to find dead transitions.
[2024-05-22 00:28:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (OVERLAPS) 1/512 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/512 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2024-05-22 00:28:22] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:28:22] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:28:22] [INFO ] Deduced a trap composed of 100 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 94 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 94 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:28:23] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:28:24] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:28:24] [INFO ] Deduced a trap composed of 115 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:28:24] [INFO ] Deduced a trap composed of 82 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:28:24] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:28:24] [INFO ] Deduced a trap composed of 72 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:28:24] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:28:24] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 3 ms to minimize.
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/512 variables, 20/125 constraints. Problems are: Problem set: 13 solved, 431 unsolved
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:28:25] [INFO ] Deduced a trap composed of 97 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 111 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 114 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 95 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 95 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:28:26] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:28:27] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:28:27] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:28:27] [INFO ] Deduced a trap composed of 76 places in 118 ms of which 10 ms to minimize.
[2024-05-22 00:28:27] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:28:27] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:28:27] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:28:27] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:28:28] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:28:28] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 3 ms to minimize.
Problem TDEAD383 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD415 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/512 variables, 20/145 constraints. Problems are: Problem set: 17 solved, 427 unsolved
[2024-05-22 00:28:28] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:28:28] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:28:28] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:28:28] [INFO ] Deduced a trap composed of 97 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:28:29] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:28:29] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:28:29] [INFO ] Deduced a trap composed of 99 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:28:29] [INFO ] Deduced a trap composed of 96 places in 104 ms of which 1 ms to minimize.
[2024-05-22 00:28:29] [INFO ] Deduced a trap composed of 98 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:28:29] [INFO ] Deduced a trap composed of 95 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:28:30] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:28:30] [INFO ] Deduced a trap composed of 100 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:28:30] [INFO ] Deduced a trap composed of 97 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:28:30] [INFO ] Deduced a trap composed of 116 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:28:30] [INFO ] Deduced a trap composed of 75 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:28:30] [INFO ] Deduced a trap composed of 75 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:28:30] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 1 ms to minimize.
[2024-05-22 00:28:31] [INFO ] Deduced a trap composed of 73 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:28:31] [INFO ] Deduced a trap composed of 119 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:28:31] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/512 variables, 20/165 constraints. Problems are: Problem set: 17 solved, 427 unsolved
[2024-05-22 00:28:34] [INFO ] Deduced a trap composed of 77 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:28:34] [INFO ] Deduced a trap composed of 97 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:28:34] [INFO ] Deduced a trap composed of 89 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:28:34] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:28:34] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:28:35] [INFO ] Deduced a trap composed of 98 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:28:35] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:28:35] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:28:35] [INFO ] Deduced a trap composed of 104 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:28:35] [INFO ] Deduced a trap composed of 116 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:28:35] [INFO ] Deduced a trap composed of 100 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:28:35] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:28:35] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:28:36] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 1 ms to minimize.
[2024-05-22 00:28:36] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:28:36] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:28:36] [INFO ] Deduced a trap composed of 74 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:28:36] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:28:36] [INFO ] Deduced a trap composed of 104 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:28:36] [INFO ] Deduced a trap composed of 100 places in 117 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/512 variables, 20/185 constraints. Problems are: Problem set: 17 solved, 427 unsolved
[2024-05-22 00:28:37] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:28:37] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:28:37] [INFO ] Deduced a trap composed of 97 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:28:37] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:28:37] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 4 ms to minimize.
[2024-05-22 00:28:38] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:28:38] [INFO ] Deduced a trap composed of 94 places in 164 ms of which 2 ms to minimize.
[2024-05-22 00:28:38] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:28:38] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:28:38] [INFO ] Deduced a trap composed of 97 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:28:38] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:28:39] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:28:39] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:28:39] [INFO ] Deduced a trap composed of 97 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:28:39] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:28:39] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 4 ms to minimize.
[2024-05-22 00:28:39] [INFO ] Deduced a trap composed of 88 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:28:39] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:28:40] [INFO ] Deduced a trap composed of 90 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:28:40] [INFO ] Deduced a trap composed of 98 places in 136 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 20/205 constraints. Problems are: Problem set: 17 solved, 427 unsolved
[2024-05-22 00:28:40] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:28:41] [INFO ] Deduced a trap composed of 96 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:28:41] [INFO ] Deduced a trap composed of 95 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:28:41] [INFO ] Deduced a trap composed of 92 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:28:41] [INFO ] Deduced a trap composed of 96 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:28:41] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:28:42] [INFO ] Deduced a trap composed of 99 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:28:42] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:28:42] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:28:42] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:28:42] [INFO ] Deduced a trap composed of 91 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:28:42] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:28:42] [INFO ] Deduced a trap composed of 101 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:28:43] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:28:43] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:28:43] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
SMT process timed out in 30203ms, After SMT, problems are : Problem set: 17 solved, 427 unsolved
Search for dead transitions found 17 dead transitions in 30212ms
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 : 512/548 places, 428/480 transitions.
Applied a total of 0 rules in 21 ms. Remains 512 /512 variables (removed 0) and now considering 428/428 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31229 ms. Remains : 512/548 places, 428/480 transitions.
[2024-05-22 00:28:43] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:28:43] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:28:43] [INFO ] Input system was already deterministic with 428 transitions.
[2024-05-22 00:28:43] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:28:43] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:28:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality10076987082641878427.gal : 4 ms
[2024-05-22 00:28:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality4001072315030969715.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/CTLCardinality10076987082641878427.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4001072315030969715.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:29:13] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:29:13] [INFO ] Applying decomposition
[2024-05-22 00:29:13] [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/graph3753403456150553946.txt' '-o' '/tmp/graph3753403456150553946.bin' '-w' '/tmp/graph3753403456150553946.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3753403456150553946.bin' '-l' '-1' '-v' '-w' '/tmp/graph3753403456150553946.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:29:13] [INFO ] Decomposing Gal with order
[2024-05-22 00:29:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:29:13] [INFO ] Removed a total of 199 redundant transitions.
[2024-05-22 00:29:13] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:29:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 5 ms.
[2024-05-22 00:29:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality9164474027536909124.gal : 5 ms
[2024-05-22 00:29:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality18344211058683722099.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/CTLCardinality9164474027536909124.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18344211058683722099.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,2.0803e+26,3.74542,107300,7224,45,175579,503,1189,491021,55,1265,0


Converting to forward existential form...Done !
original formula: ((AX((((i11.i0.u25.p68==0)&&(i14.i0.u51.p151==1))&&(i3.u150.p516==0))) + AX(EG((((i10.i0.u53.p153==0)&&(i17.i0.u141.p592==1))&&((i14.i1.u...599
=> equivalent forward existential formula: [(EY(((Init * !((E(!(((i14.i0.u49.p144==1)&&(((i10.i2.u121.p371==1)||(i1.i0.u84.p240==0))||(((i17.i0.u181.p638==...805
Reverse transition relation is NOT exact ! Due to transitions t0, t7, t9, t178, t186, t198, t278, t301, t409, t410, t412, t413, t421, i0.i0.u140.t73, i0.i1...1465
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Graph (trivial) has 266 edges and 548 vertex of which 7 / 548 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1191 edges and 542 vertex of which 540 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 539 transition count 403
Reduce places removed 68 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 69 rules applied. Total rules applied 139 place count 471 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 470 transition count 402
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 140 place count 470 transition count 296
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 231 rules applied. Total rules applied 371 place count 345 transition count 296
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 400 place count 316 transition count 267
Iterating global reduction 3 with 29 rules applied. Total rules applied 429 place count 316 transition count 267
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 429 place count 316 transition count 266
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 431 place count 315 transition count 266
Performed 124 Post agglomeration using F-continuation condition.Transition count delta: 124
Deduced a syphon composed of 124 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 253 rules applied. Total rules applied 684 place count 186 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 685 place count 185 transition count 141
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 686 place count 184 transition count 141
Applied a total of 686 rules in 90 ms. Remains 184 /548 variables (removed 364) and now considering 141/480 (removed 339) transitions.
// Phase 1: matrix 141 rows 184 cols
[2024-05-22 00:29:43] [INFO ] Computed 80 invariants in 9 ms
[2024-05-22 00:29:44] [INFO ] Implicit Places using invariants in 160 ms returned [55, 56, 57, 60]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 161 ms to find 4 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 180/548 places, 141/480 transitions.
Applied a total of 0 rules in 4 ms. Remains 180 /180 variables (removed 0) and now considering 141/141 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 256 ms. Remains : 180/548 places, 141/480 transitions.
[2024-05-22 00:29:44] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:29:44] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:29:44] [INFO ] Input system was already deterministic with 141 transitions.
[2024-05-22 00:29:44] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:29:44] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:29:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality4735786342112690131.gal : 1 ms
[2024-05-22 00:29:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality16686082854514235896.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/CTLCardinality4735786342112690131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16686082854514235896.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(AF((((AG((p243==0)) + (p638==0)) + ((p130==1)||(p593==1))) + ((AF((p384==1)) * (p386==0)) * (p223==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((!(E(TRUE U !((p243==0)))) + (p638==0)) + ((p130==1)||(p593==1))) + ((!(EG(!((p384==1)...196
Reverse transition relation is NOT exact ! Due to transitions t5, t28, t30, t31, t32, t33, t34, t35, t63, t70, t71, t72, t73, t74, t77, t78, t88, t89, t93,...296
(forward)formula 0,1,3.59293,91300,1,0,321,426347,283,164,6488,365322,391
FORMULA BusinessProcesses-PT-17-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 29 place count 519 transition count 452
Iterating global reduction 1 with 28 rules applied. Total rules applied 57 place count 519 transition count 452
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 69 place count 507 transition count 440
Iterating global reduction 1 with 12 rules applied. Total rules applied 81 place count 507 transition count 440
Applied a total of 81 rules in 57 ms. Remains 507 /548 variables (removed 41) and now considering 440/480 (removed 40) transitions.
// Phase 1: matrix 440 rows 507 cols
[2024-05-22 00:29:47] [INFO ] Computed 105 invariants in 3 ms
[2024-05-22 00:29:47] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-22 00:29:47] [INFO ] Invariant cache hit.
[2024-05-22 00:29:48] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Running 439 sub problems to find dead transitions.
[2024-05-22 00:29:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/506 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/506 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (OVERLAPS) 1/507 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/507 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2024-05-22 00:29:57] [INFO ] Deduced a trap composed of 70 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 72 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:29:58] [INFO ] Deduced a trap composed of 96 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 93 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 94 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:29:59] [INFO ] Deduced a trap composed of 80 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 84 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 82 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 82 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:30:00] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 3 ms to minimize.
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 20/125 constraints. Problems are: Problem set: 14 solved, 425 unsolved
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 2 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 100 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 92 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:30:01] [INFO ] Deduced a trap composed of 87 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 95 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 101 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 69 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 26 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:30:02] [INFO ] Deduced a trap composed of 94 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 94 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:30:03] [INFO ] Deduced a trap composed of 68 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:30:04] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:30:04] [INFO ] Deduced a trap composed of 82 places in 149 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 20/145 constraints. Problems are: Problem set: 14 solved, 425 unsolved
[2024-05-22 00:30:04] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:30:04] [INFO ] Deduced a trap composed of 81 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 75 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:30:05] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:30:06] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:30:06] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:30:06] [INFO ] Deduced a trap composed of 68 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:30:06] [INFO ] Deduced a trap composed of 70 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:30:07] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:30:07] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:30:07] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:30:07] [INFO ] Deduced a trap composed of 86 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:30:07] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:30:08] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:30:08] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:30:08] [INFO ] Deduced a trap composed of 116 places in 157 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 20/165 constraints. Problems are: Problem set: 14 solved, 425 unsolved
[2024-05-22 00:30:11] [INFO ] Deduced a trap composed of 98 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:30:11] [INFO ] Deduced a trap composed of 88 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:30:12] [INFO ] Deduced a trap composed of 80 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:30:12] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:30:12] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 3 ms to minimize.
[2024-05-22 00:30:12] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 6 ms to minimize.
[2024-05-22 00:30:12] [INFO ] Deduced a trap composed of 93 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:30:12] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:30:13] [INFO ] Deduced a trap composed of 90 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:30:13] [INFO ] Deduced a trap composed of 22 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:30:14] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:30:14] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:30:14] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:30:15] [INFO ] Deduced a trap composed of 27 places in 182 ms of which 4 ms to minimize.
[2024-05-22 00:30:15] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 4 ms to minimize.
[2024-05-22 00:30:15] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:30:15] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:30:16] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:30:16] [INFO ] Deduced a trap composed of 18 places in 164 ms of which 2 ms to minimize.
[2024-05-22 00:30:16] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 3 ms to minimize.
Problem TDEAD377 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 20/185 constraints. Problems are: Problem set: 22 solved, 417 unsolved
[2024-05-22 00:30:17] [INFO ] Deduced a trap composed of 22 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:30:17] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:30:17] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:30:17] [INFO ] Deduced a trap composed of 71 places in 160 ms of which 3 ms to minimize.
[2024-05-22 00:30:17] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:30:18] [INFO ] Deduced a trap composed of 98 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:30:18] [INFO ] Deduced a trap composed of 114 places in 154 ms of which 4 ms to minimize.
[2024-05-22 00:30:18] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:30:18] [INFO ] Deduced a trap composed of 68 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:30:18] [INFO ] Deduced a trap composed of 101 places in 145 ms of which 2 ms to minimize.
SMT process timed out in 30170ms, After SMT, problems are : Problem set: 22 solved, 417 unsolved
Search for dead transitions found 22 dead transitions in 30176ms
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 : 507/548 places, 418/480 transitions.
Applied a total of 0 rules in 10 ms. Remains 507 /507 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31029 ms. Remains : 507/548 places, 418/480 transitions.
[2024-05-22 00:30:18] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:30:18] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:30:18] [INFO ] Input system was already deterministic with 418 transitions.
[2024-05-22 00:30:18] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:30:18] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:30:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality11182881847652418054.gal : 3 ms
[2024-05-22 00:30:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality14937840071061992048.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/CTLCardinality11182881847652418054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14937840071061992048.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:30:48] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:30:48] [INFO ] Applying decomposition
[2024-05-22 00:30:48] [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/graph5891805387033832062.txt' '-o' '/tmp/graph5891805387033832062.bin' '-w' '/tmp/graph5891805387033832062.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5891805387033832062.bin' '-l' '-1' '-v' '-w' '/tmp/graph5891805387033832062.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:30:48] [INFO ] Decomposing Gal with order
[2024-05-22 00:30:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:30:48] [INFO ] Removed a total of 171 redundant transitions.
[2024-05-22 00:30:49] [INFO ] Flatten gal took : 36 ms
[2024-05-22 00:30:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-22 00:30:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality8004728777091560149.gal : 17 ms
[2024-05-22 00:30:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality2695036439982912039.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/CTLCardinality8004728777091560149.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2695036439982912039.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.00317e+26,1.28954,40036,5268,43,75378,470,1072,145716,57,1289,0


Converting to forward existential form...Done !
original formula: E((EG(((i13.u47.p148==0)||(i16.u171.p627==1))) * EF((EX((i2.u52.p164==1)) + AG(((i9.u57.p177==0)||(i10.u161.p604==1)))))) U (EG(EF(EX((i1...568
=> equivalent forward existential formula: ([(FwdU(((FwdU(Init,(EG(((i13.u47.p148==0)||(i16.u171.p627==1))) * E(TRUE U (EX((i2.u52.p164==1)) + !(E(TRUE U !...1326
Reverse transition relation is NOT exact ! Due to transitions t6, t176, t189, t283, t287, t398, t400, t402, t403, t411, i0.u134.t71, i0.u82.t179, i0.u86.t1...1304
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 480/480 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 480
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 34 place count 514 transition count 447
Iterating global reduction 1 with 33 rules applied. Total rules applied 67 place count 514 transition count 447
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 503 transition count 436
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 503 transition count 436
Applied a total of 89 rules in 26 ms. Remains 503 /548 variables (removed 45) and now considering 436/480 (removed 44) transitions.
// Phase 1: matrix 436 rows 503 cols
[2024-05-22 00:31:19] [INFO ] Computed 105 invariants in 5 ms
[2024-05-22 00:31:19] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-22 00:31:19] [INFO ] Invariant cache hit.
[2024-05-22 00:31:20] [INFO ] Implicit Places using invariants and state equation in 639 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
Running 435 sub problems to find dead transitions.
[2024-05-22 00:31:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 59/101 constraints. Problems are: Problem set: 0 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 435 unsolved
[2024-05-22 00:31:27] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:31:27] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 67 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:31:28] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 83 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 89 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:31:29] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 74 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/125 constraints. Problems are: Problem set: 11 solved, 424 unsolved
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 92 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:31:30] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:31:31] [INFO ] Deduced a trap composed of 95 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:31:31] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:31:31] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:31:31] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 1 ms to minimize.
[2024-05-22 00:31:31] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:31:31] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:31:31] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:31:31] [INFO ] Deduced a trap composed of 93 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:31:32] [INFO ] Deduced a trap composed of 97 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:31:32] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:31:32] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:31:32] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:31:32] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:31:32] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:31:32] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:31:33] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 1 ms to minimize.
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD406 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/145 constraints. Problems are: Problem set: 28 solved, 407 unsolved
[2024-05-22 00:31:33] [INFO ] Deduced a trap composed of 105 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:31:33] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:31:33] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:31:33] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:31:33] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:31:34] [INFO ] Deduced a trap composed of 88 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:31:34] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:31:34] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:31:34] [INFO ] Deduced a trap composed of 92 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:31:34] [INFO ] Deduced a trap composed of 86 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:31:34] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:31:34] [INFO ] Deduced a trap composed of 87 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:31:34] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:31:35] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:31:35] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:31:35] [INFO ] Deduced a trap composed of 84 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:31:35] [INFO ] Deduced a trap composed of 93 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:31:35] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:31:35] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:31:36] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/165 constraints. Problems are: Problem set: 28 solved, 407 unsolved
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 68 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 90 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:31:39] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:31:40] [INFO ] Deduced a trap composed of 94 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:31:40] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:31:40] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:31:40] [INFO ] Deduced a trap composed of 91 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:31:40] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:31:40] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:31:40] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:31:40] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:31:41] [INFO ] Deduced a trap composed of 91 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:31:41] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:31:41] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:31:41] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:31:41] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
Problem TDEAD386 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 20/185 constraints. Problems are: Problem set: 29 solved, 406 unsolved
[2024-05-22 00:31:41] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:31:41] [INFO ] Deduced a trap composed of 84 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:31:42] [INFO ] Deduced a trap composed of 66 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:31:42] [INFO ] Deduced a trap composed of 114 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:31:42] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:31:42] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:31:42] [INFO ] Deduced a trap composed of 68 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:31:42] [INFO ] Deduced a trap composed of 87 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:31:42] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:31:43] [INFO ] Deduced a trap composed of 90 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:31:43] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:31:43] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:31:43] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:31:43] [INFO ] Deduced a trap composed of 88 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:31:43] [INFO ] Deduced a trap composed of 94 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:31:44] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:31:44] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:31:44] [INFO ] Deduced a trap composed of 88 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:31:44] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:31:45] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 20/205 constraints. Problems are: Problem set: 29 solved, 406 unsolved
[2024-05-22 00:31:45] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:31:45] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:31:45] [INFO ] Deduced a trap composed of 93 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:31:46] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:31:46] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:31:46] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:31:46] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:31:46] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:31:47] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:31:47] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:31:47] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:31:47] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:31:47] [INFO ] Deduced a trap composed of 91 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:31:48] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:31:49] [INFO ] Deduced a trap composed of 92 places in 172 ms of which 4 ms to minimize.
[2024-05-22 00:31:49] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:31:49] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:31:49] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:31:50] [INFO ] Deduced a trap composed of 28 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:31:50] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 3 ms to minimize.
SMT process timed out in 30150ms, After SMT, problems are : Problem set: 29 solved, 406 unsolved
Search for dead transitions found 29 dead transitions in 30155ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in LTL mode, iteration 1 : 503/548 places, 407/480 transitions.
Applied a total of 0 rules in 9 ms. Remains 503 /503 variables (removed 0) and now considering 407/407 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31176 ms. Remains : 503/548 places, 407/480 transitions.
[2024-05-22 00:31:50] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:31:50] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:31:50] [INFO ] Input system was already deterministic with 407 transitions.
[2024-05-22 00:31:50] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:31:50] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:31:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality2017816753731789596.gal : 3 ms
[2024-05-22 00:31:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality422126349964556722.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/CTLCardinality2017816753731789596.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality422126349964556722.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.
Detected timeout of ITS tools.
[2024-05-22 00:32:20] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:32:20] [INFO ] Applying decomposition
[2024-05-22 00:32:20] [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/graph13671126423520646529.txt' '-o' '/tmp/graph13671126423520646529.bin' '-w' '/tmp/graph13671126423520646529.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13671126423520646529.bin' '-l' '-1' '-v' '-w' '/tmp/graph13671126423520646529.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:32:20] [INFO ] Decomposing Gal with order
[2024-05-22 00:32:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:32:20] [INFO ] Removed a total of 135 redundant transitions.
[2024-05-22 00:32:20] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:32:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 00:32:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality7465644215809088326.gal : 5 ms
[2024-05-22 00:32:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality972409242188619068.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/CTLCardinality7465644215809088326.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality972409242188619068.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.95422e+26,1.82357,47544,5009,48,75785,551,1100,181372,57,1319,0


Converting to forward existential form...Done !
original formula: AF((EX(EF(((i15.i0.u18.p45==0)||(i14.i0.u27.p67==1)))) * ((E(EX((i11.i0.u80.p229==1)) U ((i1.u76.p219==1)&&((i11.i0.u161.p594==0)||(i16.i...243
=> equivalent forward existential formula: [FwdG(Init,!((EX(E(TRUE U ((i15.i0.u18.p45==0)||(i14.i0.u27.p67==1)))) * ((E(EX((i11.i0.u80.p229==1)) U ((i1.u76...294
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t171, t179, t269, t283, t387, t388, t389, t391, t392, t400, i0.i0.t175, i0.i0.u82.t18...1407
Detected timeout of ITS tools.
[2024-05-22 00:32:50] [INFO ] Flatten gal took : 28 ms
[2024-05-22 00:32:50] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:32:50] [INFO ] Applying decomposition
[2024-05-22 00:32:50] [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/graph6820392304140982090.txt' '-o' '/tmp/graph6820392304140982090.bin' '-w' '/tmp/graph6820392304140982090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6820392304140982090.bin' '-l' '-1' '-v' '-w' '/tmp/graph6820392304140982090.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:32:50] [INFO ] Decomposing Gal with order
[2024-05-22 00:32:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:32:50] [INFO ] Removed a total of 270 redundant transitions.
[2024-05-22 00:32:50] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:32:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 00:32:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality12062510615144711993.gal : 4 ms
[2024-05-22 00:32:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality7808523338850242907.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/CTLCardinality12062510615144711993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7808523338850242907.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.26879e+26,7.41504,176536,14266,136,292478,1629,1087,673998,87,5173,0


Converting to forward existential form...Done !
original formula: AG(A(AX(!(((i17.u86.p240==0)||(i17.u183.p598==1)))) U ((EX(((i13.u15.p29==0)||(i10.u172.p567==1))) * AF((i3.u109.p311==0))) + ((i19.u176....191
=> equivalent forward existential formula: (([(((FwdU(FwdU(Init,TRUE),!(((EX(((i13.u15.p29==0)||(i10.u172.p567==1))) * !(EG(!((i3.u109.p311==0))))) + ((i19...884
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t51, t210, t223, t327, t336, t460, t462, t473, i0.u89.t213, i0.u93.t205, i0.u91.t...1608
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-22 00:36:21] [INFO ] Applying decomposition
[2024-05-22 00:36:21] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:36:21] [INFO ] Decomposing Gal with order
[2024-05-22 00:36:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:36:21] [INFO ] Removed a total of 132 redundant transitions.
[2024-05-22 00:36:21] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:36:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 114 ms.
[2024-05-22 00:36:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality6413294978511723586.gal : 7 ms
[2024-05-22 00:36:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality8138332449030345552.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/CTLCardinality6413294978511723586.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8138332449030345552.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 8 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 00:43:42] [INFO ] Flatten gal took : 28 ms
[2024-05-22 00:43:42] [INFO ] Input system was already deterministic with 480 transitions.
[2024-05-22 00:43:42] [INFO ] Transformed 548 places.
[2024-05-22 00:43:42] [INFO ] Transformed 480 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 00:44:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality12791072099067615282.gal : 4 ms
[2024-05-22 00:44:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality18392427045138123555.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/CTLCardinality12791072099067615282.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18392427045138123555.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

BK_STOP 1716339292325

--------------------
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-17"
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-17, 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-171620399800577"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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