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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 211K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 157K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716336183013

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-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 00:03:04] [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:03:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:03:04] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-05-22 00:03:04] [INFO ] Transformed 630 places.
[2024-05-22 00:03:04] [INFO ] Transformed 566 transitions.
[2024-05-22 00:03:04] [INFO ] Found NUPN structural information;
[2024-05-22 00:03:04] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-15-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 101 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 623 transition count 562
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 78 place count 548 transition count 487
Iterating global reduction 1 with 75 rules applied. Total rules applied 153 place count 548 transition count 487
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 184 place count 517 transition count 456
Iterating global reduction 1 with 31 rules applied. Total rules applied 215 place count 517 transition count 456
Applied a total of 215 rules in 109 ms. Remains 517 /626 variables (removed 109) and now considering 456/562 (removed 106) transitions.
// Phase 1: matrix 456 rows 517 cols
[2024-05-22 00:03:04] [INFO ] Computed 99 invariants in 30 ms
[2024-05-22 00:03:05] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-05-22 00:03:05] [INFO ] Invariant cache hit.
[2024-05-22 00:03:05] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 954 ms to find 0 implicit places.
Running 455 sub problems to find dead transitions.
[2024-05-22 00:03:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 2 (OVERLAPS) 1/517 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 455 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-05-22 00:03:15] [INFO ] Deduced a trap composed of 80 places in 170 ms of which 31 ms to minimize.
[2024-05-22 00:03:15] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:03:15] [INFO ] Deduced a trap composed of 80 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:03:15] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:03:16] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:03:16] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:03:16] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:03:16] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:03:16] [INFO ] Deduced a trap composed of 104 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:03:16] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:03:16] [INFO ] Deduced a trap composed of 95 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:03:16] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 4 ms to minimize.
[2024-05-22 00:03:17] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:03:17] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:03:17] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:03:17] [INFO ] Deduced a trap composed of 103 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:03:17] [INFO ] Deduced a trap composed of 96 places in 172 ms of which 3 ms to minimize.
[2024-05-22 00:03:17] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:03:17] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:03:18] [INFO ] Deduced a trap composed of 81 places in 147 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 455 unsolved
[2024-05-22 00:03:18] [INFO ] Deduced a trap composed of 81 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:03:18] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:03:18] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:03:18] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:03:19] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:03:19] [INFO ] Deduced a trap composed of 84 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:03:19] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:03:19] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:03:19] [INFO ] Deduced a trap composed of 120 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:03:19] [INFO ] Deduced a trap composed of 104 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:03:19] [INFO ] Deduced a trap composed of 109 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:03:20] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:03:20] [INFO ] Deduced a trap composed of 99 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:03:20] [INFO ] Deduced a trap composed of 105 places in 150 ms of which 6 ms to minimize.
[2024-05-22 00:03:20] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:03:20] [INFO ] Deduced a trap composed of 105 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:03:20] [INFO ] Deduced a trap composed of 106 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:03:21] [INFO ] Deduced a trap composed of 100 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:03:21] [INFO ] Deduced a trap composed of 99 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:03:21] [INFO ] Deduced a trap composed of 59 places in 54 ms of which 2 ms to minimize.
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 20/139 constraints. Problems are: Problem set: 11 solved, 444 unsolved
[2024-05-22 00:03:21] [INFO ] Deduced a trap composed of 105 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:03:21] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:03:22] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:03:22] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:03:22] [INFO ] Deduced a trap composed of 107 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:03:22] [INFO ] Deduced a trap composed of 103 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:03:22] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:03:22] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:03:23] [INFO ] Deduced a trap composed of 102 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:03:23] [INFO ] Deduced a trap composed of 102 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:03:23] [INFO ] Deduced a trap composed of 98 places in 151 ms of which 4 ms to minimize.
[2024-05-22 00:03:23] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:03:23] [INFO ] Deduced a trap composed of 104 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:03:23] [INFO ] Deduced a trap composed of 103 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:03:24] [INFO ] Deduced a trap composed of 101 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:03:24] [INFO ] Deduced a trap composed of 105 places in 143 ms of which 10 ms to minimize.
[2024-05-22 00:03:24] [INFO ] Deduced a trap composed of 111 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:03:24] [INFO ] Deduced a trap composed of 108 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:03:24] [INFO ] Deduced a trap composed of 107 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:03:24] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 20/159 constraints. Problems are: Problem set: 11 solved, 444 unsolved
[2024-05-22 00:03:28] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:03:28] [INFO ] Deduced a trap composed of 103 places in 171 ms of which 3 ms to minimize.
[2024-05-22 00:03:28] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 4 ms to minimize.
[2024-05-22 00:03:28] [INFO ] Deduced a trap composed of 78 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:03:28] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 4 ms to minimize.
[2024-05-22 00:03:29] [INFO ] Deduced a trap composed of 104 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:03:29] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:03:29] [INFO ] Deduced a trap composed of 82 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:03:29] [INFO ] Deduced a trap composed of 105 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:03:29] [INFO ] Deduced a trap composed of 83 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:03:29] [INFO ] Deduced a trap composed of 111 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:03:29] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:03:30] [INFO ] Deduced a trap composed of 91 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:03:30] [INFO ] Deduced a trap composed of 77 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:03:30] [INFO ] Deduced a trap composed of 105 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:03:30] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:03:30] [INFO ] Deduced a trap composed of 83 places in 163 ms of which 3 ms to minimize.
[2024-05-22 00:03:31] [INFO ] Deduced a trap composed of 104 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:03:31] [INFO ] Deduced a trap composed of 81 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:03:31] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 20/179 constraints. Problems are: Problem set: 11 solved, 444 unsolved
[2024-05-22 00:03:31] [INFO ] Deduced a trap composed of 109 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:03:32] [INFO ] Deduced a trap composed of 100 places in 161 ms of which 3 ms to minimize.
[2024-05-22 00:03:32] [INFO ] Deduced a trap composed of 80 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:03:32] [INFO ] Deduced a trap composed of 78 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:03:32] [INFO ] Deduced a trap composed of 84 places in 181 ms of which 3 ms to minimize.
[2024-05-22 00:03:32] [INFO ] Deduced a trap composed of 83 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:03:33] [INFO ] Deduced a trap composed of 81 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:03:33] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:03:33] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:03:33] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:03:33] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:03:33] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:03:33] [INFO ] Deduced a trap composed of 98 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:03:34] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:03:34] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:03:34] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:03:34] [INFO ] Deduced a trap composed of 82 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:03:34] [INFO ] Deduced a trap composed of 83 places in 165 ms of which 4 ms to minimize.
[2024-05-22 00:03:34] [INFO ] Deduced a trap composed of 99 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:03:35] [INFO ] Deduced a trap composed of 81 places in 153 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 20/199 constraints. Problems are: Problem set: 11 solved, 444 unsolved
[2024-05-22 00:03:35] [INFO ] Deduced a trap composed of 125 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:03:35] [INFO ] Deduced a trap composed of 126 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:03:36] [INFO ] Deduced a trap composed of 80 places in 184 ms of which 3 ms to minimize.
SMT process timed out in 30378ms, After SMT, problems are : Problem set: 11 solved, 444 unsolved
Search for dead transitions found 11 dead transitions in 30400ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 517/626 places, 445/562 transitions.
Applied a total of 0 rules in 16 ms. Remains 517 /517 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31503 ms. Remains : 517/626 places, 445/562 transitions.
Support contains 101 out of 517 places after structural reductions.
[2024-05-22 00:03:36] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 00:03:36] [INFO ] Flatten gal took : 78 ms
FORMULA BusinessProcesses-PT-15-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:03:36] [INFO ] Flatten gal took : 39 ms
[2024-05-22 00:03:36] [INFO ] Input system was already deterministic with 445 transitions.
Support contains 97 out of 517 places (down from 101) after GAL structural reductions.
RANDOM walk for 40000 steps (269 resets) in 1793 ms. (22 steps per ms) remains 22/50 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
// Phase 1: matrix 445 rows 517 cols
[2024-05-22 00:03:37] [INFO ] Computed 99 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 217/271 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 87/358 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 151/509 variables, 39/95 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 4/513 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 443/956 variables, 513/612 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/956 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 11 (OVERLAPS) 6/962 variables, 4/616 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/962 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 13 (OVERLAPS) 0/962 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 962/962 variables, and 616 constraints, problems are : Problem set: 0 solved, 22 unsolved in 2084 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 517/517 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 217/271 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-22 00:03:39] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:03:39] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:03:39] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:03:39] [INFO ] Deduced a trap composed of 36 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:03:39] [INFO ] Deduced a trap composed of 39 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:03:39] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:03:39] [INFO ] Deduced a trap composed of 38 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:03:39] [INFO ] Deduced a trap composed of 41 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:03:39] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:03:39] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 30 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 87/358 variables, 18/69 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 2 ms to minimize.
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 2 ms to minimize.
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:03:40] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:03:41] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:03:41] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:03:41] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:03:41] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:03:41] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 14/83 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp48 is UNSAT
At refinement iteration 8 (OVERLAPS) 151/509 variables, 39/122 constraints. Problems are: Problem set: 1 solved, 21 unsolved
[2024-05-22 00:03:41] [INFO ] Deduced a trap composed of 25 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:03:41] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:03:41] [INFO ] Deduced a trap composed of 99 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 109 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 4 ms to minimize.
[2024-05-22 00:03:42] [INFO ] Deduced a trap composed of 94 places in 175 ms of which 3 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 21 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 92 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 109 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 110 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 120 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:03:43] [INFO ] Deduced a trap composed of 105 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:03:44] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 3 ms to minimize.
SMT process timed out in 7126ms, After SMT, problems are : Problem set: 1 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 49 out of 517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 445/445 transitions.
Graph (trivial) has 210 edges and 517 vertex of which 6 / 517 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1120 edges and 512 vertex of which 511 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 511 transition count 393
Reduce places removed 44 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 51 rules applied. Total rules applied 97 place count 467 transition count 386
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 104 place count 460 transition count 386
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 104 place count 460 transition count 299
Deduced a syphon composed of 87 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 188 rules applied. Total rules applied 292 place count 359 transition count 299
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 302 place count 349 transition count 289
Iterating global reduction 3 with 10 rules applied. Total rules applied 312 place count 349 transition count 289
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 312 place count 349 transition count 287
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 316 place count 347 transition count 287
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 514 place count 247 transition count 189
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 516 place count 246 transition count 193
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 518 place count 246 transition count 191
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 520 place count 244 transition count 191
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 522 place count 244 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 523 place count 243 transition count 190
Applied a total of 523 rules in 141 ms. Remains 243 /517 variables (removed 274) and now considering 190/445 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 243/517 places, 190/445 transitions.
RANDOM walk for 40000 steps (526 resets) in 751 ms. (53 steps per ms) remains 3/21 properties
BEST_FIRST walk for 40003 steps (146 resets) in 171 ms. (232 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40002 steps (195 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
// Phase 1: matrix 190 rows 243 cols
[2024-05-22 00:03:44] [INFO ] Computed 83 invariants in 3 ms
[2024-05-22 00:03:44] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 110/148 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 63/211 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/211 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 24/235 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/235 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 187/422 variables, 235/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 4/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/432 variables, 7/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/432 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/432 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/433 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/433 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/433 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 243/243 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 36/38 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 110/148 variables, 46/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:03:45] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 63/211 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 24/235 variables, 12/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 187/422 variables, 235/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/432 variables, 7/329 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/432 variables, 2/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/432 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/433 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 00:03:45] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/433 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/433 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/433 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 433/433 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 220 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 243/243 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 373ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1207 steps, including 14 resets, run visited all 1 properties in 7 ms. (steps per millisecond=172 )
Parikh walk visited 1 properties in 13 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-22 00:03:45] [INFO ] Flatten gal took : 29 ms
[2024-05-22 00:03:45] [INFO ] Flatten gal took : 29 ms
[2024-05-22 00:03:45] [INFO ] Input system was already deterministic with 445 transitions.
Computed a total of 222 stabilizing places and 194 stable transitions
Graph (complete) has 1127 edges and 517 vertex of which 516 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Graph (trivial) has 256 edges and 517 vertex of which 6 / 517 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1121 edges and 512 vertex of which 511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 510 transition count 373
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 446 transition count 373
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 130 place count 446 transition count 270
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 356 place count 323 transition count 270
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 380 place count 299 transition count 246
Iterating global reduction 2 with 24 rules applied. Total rules applied 404 place count 299 transition count 246
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 404 place count 299 transition count 242
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 413 place count 294 transition count 242
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 3 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 241 rules applied. Total rules applied 654 place count 172 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 655 place count 171 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 656 place count 170 transition count 122
Applied a total of 656 rules in 70 ms. Remains 170 /517 variables (removed 347) and now considering 122/445 (removed 323) transitions.
// Phase 1: matrix 122 rows 170 cols
[2024-05-22 00:03:45] [INFO ] Computed 74 invariants in 2 ms
[2024-05-22 00:03:45] [INFO ] Implicit Places using invariants in 106 ms returned [36, 37, 42, 43, 44, 48, 49, 50, 51, 52, 53, 54]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 109 ms to find 12 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 158/517 places, 122/445 transitions.
Applied a total of 0 rules in 6 ms. Remains 158 /158 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 187 ms. Remains : 158/517 places, 122/445 transitions.
[2024-05-22 00:03:45] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:03:45] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:03:45] [INFO ] Input system was already deterministic with 122 transitions.
[2024-05-22 00:03:45] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:03:45] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:03:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality11460323812273874036.gal : 3 ms
[2024-05-22 00:03:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality2290965952010835081.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/CTLCardinality11460323812273874036.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2290965952010835081.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,10948,0.14656,11444,2,3176,5,31732,6,0,753,17235,0


Converting to forward existential form...Done !
original formula: AG(AF((p20==0)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p20==0)))] = FALSE
Hit Full ! (commute/partial/dont) 120/0/2
(forward)formula 0,0,0.51448,26740,1,0,8,97583,20,2,4249,29223,8
FORMULA BusinessProcesses-PT-15-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 496 transition count 424
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 496 transition count 424
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 488 transition count 416
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 488 transition count 416
Applied a total of 58 rules in 45 ms. Remains 488 /517 variables (removed 29) and now considering 416/445 (removed 29) transitions.
// Phase 1: matrix 416 rows 488 cols
[2024-05-22 00:03:46] [INFO ] Computed 99 invariants in 12 ms
[2024-05-22 00:03:46] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-22 00:03:46] [INFO ] Invariant cache hit.
[2024-05-22 00:03:46] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2024-05-22 00:03:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/487 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/488 variables, 57/96 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 00:03:53] [INFO ] Deduced a trap composed of 94 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:03:54] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:03:54] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:03:54] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:03:54] [INFO ] Deduced a trap composed of 98 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:03:54] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:03:54] [INFO ] Deduced a trap composed of 95 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:03:54] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:03:55] [INFO ] Deduced a trap composed of 88 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:03:55] [INFO ] Deduced a trap composed of 90 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:03:55] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:03:55] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:03:55] [INFO ] Deduced a trap composed of 91 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:03:55] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:03:55] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:03:56] [INFO ] Deduced a trap composed of 94 places in 121 ms of which 4 ms to minimize.
[2024-05-22 00:03:56] [INFO ] Deduced a trap composed of 97 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:03:56] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:03:56] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:03:56] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 3 ms to minimize.
Problem TDEAD355 is UNSAT
Problem TDEAD369 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 20/119 constraints. Problems are: Problem set: 2 solved, 413 unsolved
[2024-05-22 00:03:56] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:03:57] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:03:57] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:03:57] [INFO ] Deduced a trap composed of 91 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:03:57] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:03:57] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:03:57] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:03:57] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 97 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 116 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:03:58] [INFO ] Deduced a trap composed of 83 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:03:59] [INFO ] Deduced a trap composed of 82 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:03:59] [INFO ] Deduced a trap composed of 117 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:03:59] [INFO ] Deduced a trap composed of 103 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:03:59] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:03:59] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:03:59] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 3 ms to minimize.
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 20/139 constraints. Problems are: Problem set: 10 solved, 405 unsolved
[2024-05-22 00:04:00] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:04:00] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:04:00] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:04:00] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:04:00] [INFO ] Deduced a trap composed of 93 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:04:00] [INFO ] Deduced a trap composed of 109 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 4 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:04:01] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 113 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 118 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 115 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 94 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:04:02] [INFO ] Deduced a trap composed of 97 places in 141 ms of which 3 ms to minimize.
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 20/159 constraints. Problems are: Problem set: 15 solved, 400 unsolved
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 98 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 100 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 5 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:04:06] [INFO ] Deduced a trap composed of 96 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 93 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 98 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 89 places in 162 ms of which 2 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:04:07] [INFO ] Deduced a trap composed of 91 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 102 places in 118 ms of which 4 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:04:08] [INFO ] Deduced a trap composed of 82 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 102 places in 128 ms of which 3 ms to minimize.
Problem TDEAD388 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 20/179 constraints. Problems are: Problem set: 16 solved, 399 unsolved
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 93 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 96 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:04:09] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 94 places in 152 ms of which 4 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 96 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 101 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:04:10] [INFO ] Deduced a trap composed of 108 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 104 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 90 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 89 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:04:11] [INFO ] Deduced a trap composed of 90 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 3 ms to minimize.
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD390 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 20/199 constraints. Problems are: Problem set: 19 solved, 396 unsolved
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 89 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:04:12] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 74 places in 151 ms of which 4 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 116 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:04:13] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 101 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 115 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:04:14] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 91 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:04:15] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 20/219 constraints. Problems are: Problem set: 19 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/904 variables, and 219 constraints, problems are : Problem set: 19 solved, 396 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/488 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 19 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 39/39 constraints. Problems are: Problem set: 19 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/487 variables, 0/39 constraints. Problems are: Problem set: 19 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/488 variables, 57/96 constraints. Problems are: Problem set: 19 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 3/99 constraints. Problems are: Problem set: 19 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 120/219 constraints. Problems are: Problem set: 19 solved, 396 unsolved
[2024-05-22 00:04:20] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:04:21] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:04:21] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:04:21] [INFO ] Deduced a trap composed of 89 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:04:21] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:04:21] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:04:21] [INFO ] Deduced a trap composed of 112 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:04:21] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 100 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:04:22] [INFO ] Deduced a trap composed of 94 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 87 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:04:23] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 3 ms to minimize.
Problem TDEAD382 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 20/239 constraints. Problems are: Problem set: 20 solved, 395 unsolved
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 94 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:04:24] [INFO ] Deduced a trap composed of 94 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 97 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 84 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:04:25] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 82 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 54 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 3 ms to minimize.
Problem TDEAD351 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 20/259 constraints. Problems are: Problem set: 21 solved, 394 unsolved
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 73 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 84 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 92 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 90 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 90 places in 152 ms of which 3 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 89 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 70 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 86 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:04:31] [INFO ] Deduced a trap composed of 83 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:04:31] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:04:31] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 20/279 constraints. Problems are: Problem set: 21 solved, 394 unsolved
[2024-05-22 00:04:32] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:04:32] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:04:32] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:04:32] [INFO ] Deduced a trap composed of 89 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 69 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 4 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 95 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:04:33] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 90 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 114 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 20/299 constraints. Problems are: Problem set: 21 solved, 394 unsolved
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 102 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 96 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:04:36] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 95 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 99 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 94 places in 162 ms of which 3 ms to minimize.
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 83 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 89 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:04:38] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 83 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:04:39] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 2 ms to minimize.
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 20/319 constraints. Problems are: Problem set: 23 solved, 392 unsolved
[2024-05-22 00:04:40] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:04:40] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:04:40] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:04:40] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 97 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 86 places in 168 ms of which 3 ms to minimize.
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 88 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 96 places in 140 ms of which 4 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 90 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 95 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 90 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:04:42] [INFO ] Deduced a trap composed of 99 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 98 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:04:43] [INFO ] Deduced a trap composed of 93 places in 135 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 20/339 constraints. Problems are: Problem set: 23 solved, 392 unsolved
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 99 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:04:44] [INFO ] Deduced a trap composed of 87 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 86 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 85 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:04:45] [INFO ] Deduced a trap composed of 88 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 88 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 94 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:04:46] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 20/359 constraints. Problems are: Problem set: 23 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/904 variables, and 359 constraints, problems are : Problem set: 23 solved, 392 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/488 constraints, PredecessorRefiner: 0/415 constraints, Known Traps: 260/260 constraints]
After SMT, in 60157ms problems are : Problem set: 23 solved, 392 unsolved
Search for dead transitions found 23 dead transitions in 60164ms
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 : 488/517 places, 393/445 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 486 transition count 393
Applied a total of 2 rules in 17 ms. Remains 486 /488 variables (removed 2) and now considering 393/393 (removed 0) transitions.
// Phase 1: matrix 393 rows 486 cols
[2024-05-22 00:04:47] [INFO ] Computed 104 invariants in 9 ms
[2024-05-22 00:04:47] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-22 00:04:47] [INFO ] Invariant cache hit.
[2024-05-22 00:04:47] [INFO ] Implicit Places using invariants and state equation in 520 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 726 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 485/517 places, 393/445 transitions.
Applied a total of 0 rules in 8 ms. Remains 485 /485 variables (removed 0) and now considering 393/393 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61678 ms. Remains : 485/517 places, 393/445 transitions.
[2024-05-22 00:04:47] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:04:47] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:04:47] [INFO ] Input system was already deterministic with 393 transitions.
[2024-05-22 00:04:47] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:04:47] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:04:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality10407385503019434119.gal : 4 ms
[2024-05-22 00:04:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality14736651529441471519.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/CTLCardinality10407385503019434119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14736651529441471519.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:05:18] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:05:18] [INFO ] Applying decomposition
[2024-05-22 00:05:18] [INFO ] Flatten gal took : 11 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/graph9638755908269341757.txt' '-o' '/tmp/graph9638755908269341757.bin' '-w' '/tmp/graph9638755908269341757.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9638755908269341757.bin' '-l' '-1' '-v' '-w' '/tmp/graph9638755908269341757.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:05:18] [INFO ] Decomposing Gal with order
[2024-05-22 00:05:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:05:18] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-22 00:05:18] [INFO ] Flatten gal took : 53 ms
[2024-05-22 00:05:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 12 ms.
[2024-05-22 00:05:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality2804308229079026121.gal : 8 ms
[2024-05-22 00:05:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality4321396019746821949.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/CTLCardinality2804308229079026121.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4321396019746821949.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.61063e+25,7.3198,204876,10727,38,312053,449,961,669410,54,1220,0


Converting to forward existential form...Done !
original formula: EX(A(AF(!(EX(((i18.u134.p466==0)||(i19.i1.u90.p269==1))))) U EF(((((i20.u156.p583==0)&&(i12.u127.p429!=1))&&((i20.u131.p452==1)&&((i17.u1...232
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(E(TRUE U ((((i20.u156.p583==0)&&(i12.u127.p429!=1))&&((i20.u131.p452==1)&&((i17.u109.p341==...635
Reverse transition relation is NOT exact ! Due to transitions t6, t170, t178, t272, t285, t373, t374, t375, t377, t378, i0.t182, i0.u71.t189, i0.u73.t185, ...1337
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 496 transition count 424
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 496 transition count 424
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 51 place count 487 transition count 415
Iterating global reduction 0 with 9 rules applied. Total rules applied 60 place count 487 transition count 415
Applied a total of 60 rules in 45 ms. Remains 487 /517 variables (removed 30) and now considering 415/445 (removed 30) transitions.
// Phase 1: matrix 415 rows 487 cols
[2024-05-22 00:05:48] [INFO ] Computed 99 invariants in 7 ms
[2024-05-22 00:05:48] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-05-22 00:05:48] [INFO ] Invariant cache hit.
[2024-05-22 00:05:49] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
Running 414 sub problems to find dead transitions.
[2024-05-22 00:05:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/487 variables, 56/95 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 00:05:57] [INFO ] Deduced a trap composed of 70 places in 171 ms of which 4 ms to minimize.
[2024-05-22 00:05:57] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:05:57] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:05:57] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:05:57] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:05:57] [INFO ] Deduced a trap composed of 92 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:05:57] [INFO ] Deduced a trap composed of 95 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:05:58] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 5 ms to minimize.
[2024-05-22 00:05:58] [INFO ] Deduced a trap composed of 95 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:05:58] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:05:58] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:05:58] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:05:58] [INFO ] Deduced a trap composed of 86 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:05:58] [INFO ] Deduced a trap composed of 87 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:05:58] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:05:59] [INFO ] Deduced a trap composed of 88 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:05:59] [INFO ] Deduced a trap composed of 87 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:05:59] [INFO ] Deduced a trap composed of 84 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:05:59] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 9 ms to minimize.
[2024-05-22 00:05:59] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 00:06:00] [INFO ] Deduced a trap composed of 93 places in 150 ms of which 6 ms to minimize.
[2024-05-22 00:06:00] [INFO ] Deduced a trap composed of 94 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:06:00] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:06:00] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:06:00] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:06:00] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:06:00] [INFO ] Deduced a trap composed of 83 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:06:01] [INFO ] Deduced a trap composed of 83 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:06:01] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:06:01] [INFO ] Deduced a trap composed of 82 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:06:01] [INFO ] Deduced a trap composed of 81 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:06:01] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:06:01] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:06:01] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:06:01] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:06:02] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:06:02] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:06:02] [INFO ] Deduced a trap composed of 96 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:06:02] [INFO ] Deduced a trap composed of 93 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:06:02] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 3 ms to minimize.
Problem TDEAD366 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 20/139 constraints. Problems are: Problem set: 3 solved, 411 unsolved
[2024-05-22 00:06:03] [INFO ] Deduced a trap composed of 93 places in 138 ms of which 7 ms to minimize.
[2024-05-22 00:06:03] [INFO ] Deduced a trap composed of 91 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:06:03] [INFO ] Deduced a trap composed of 93 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:06:03] [INFO ] Deduced a trap composed of 91 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:06:03] [INFO ] Deduced a trap composed of 95 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:06:03] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:06:04] [INFO ] Deduced a trap composed of 90 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:06:04] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:06:04] [INFO ] Deduced a trap composed of 87 places in 157 ms of which 2 ms to minimize.
[2024-05-22 00:06:04] [INFO ] Deduced a trap composed of 70 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:06:04] [INFO ] Deduced a trap composed of 88 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:06:04] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:06:04] [INFO ] Deduced a trap composed of 85 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:06:04] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:06:05] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:06:05] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:06:05] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:06:05] [INFO ] Deduced a trap composed of 92 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:06:05] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:06:05] [INFO ] Deduced a trap composed of 101 places in 127 ms of which 2 ms to minimize.
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD389 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 20/159 constraints. Problems are: Problem set: 16 solved, 398 unsolved
[2024-05-22 00:06:08] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:06:08] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:06:08] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:06:09] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:06:09] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:06:09] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:06:09] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:06:09] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:06:09] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:06:09] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:06:10] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:06:10] [INFO ] Deduced a trap composed of 93 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:06:10] [INFO ] Deduced a trap composed of 88 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:06:10] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:06:10] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:06:10] [INFO ] Deduced a trap composed of 87 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:06:10] [INFO ] Deduced a trap composed of 91 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:06:10] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 4 ms to minimize.
[2024-05-22 00:06:11] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:06:11] [INFO ] Deduced a trap composed of 85 places in 121 ms of which 3 ms to minimize.
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 20/179 constraints. Problems are: Problem set: 18 solved, 396 unsolved
[2024-05-22 00:06:11] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:06:11] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:06:11] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:06:11] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:06:12] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 88 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 97 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 95 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:06:13] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 96 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:06:14] [INFO ] Deduced a trap composed of 95 places in 132 ms of which 7 ms to minimize.
Problem TDEAD348 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 20/199 constraints. Problems are: Problem set: 21 solved, 393 unsolved
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 84 places in 158 ms of which 4 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 93 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 52 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:06:15] [INFO ] Deduced a trap composed of 86 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 88 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:06:16] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:06:17] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 2 ms to minimize.
Problem TDEAD354 is UNSAT
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 20/219 constraints. Problems are: Problem set: 22 solved, 392 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/902 variables, and 219 constraints, problems are : Problem set: 22 solved, 392 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/487 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 22 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 39/39 constraints. Problems are: Problem set: 22 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 0/39 constraints. Problems are: Problem set: 22 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/487 variables, 56/95 constraints. Problems are: Problem set: 22 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 4/99 constraints. Problems are: Problem set: 22 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 120/219 constraints. Problems are: Problem set: 22 solved, 392 unsolved
[2024-05-22 00:06:22] [INFO ] Deduced a trap composed of 94 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:06:22] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 91 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 94 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 92 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 93 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 110 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 93 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 94 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:06:24] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 2 ms to minimize.
[2024-05-22 00:06:25] [INFO ] Deduced a trap composed of 123 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:06:25] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:06:25] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 20/239 constraints. Problems are: Problem set: 22 solved, 392 unsolved
[2024-05-22 00:06:25] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 92 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 88 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 15 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 94 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 82 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 81 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 86 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 79 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 87 places in 116 ms of which 6 ms to minimize.
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 20/259 constraints. Problems are: Problem set: 22 solved, 392 unsolved
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:06:30] [INFO ] Deduced a trap composed of 121 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 88 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:06:31] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:06:32] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 3 ms to minimize.
[2024-05-22 00:06:32] [INFO ] Deduced a trap composed of 101 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:06:32] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:06:33] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:06:33] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:06:33] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:06:33] [INFO ] Deduced a trap composed of 22 places in 167 ms of which 3 ms to minimize.
[2024-05-22 00:06:33] [INFO ] Deduced a trap composed of 111 places in 155 ms of which 3 ms to minimize.
[2024-05-22 00:06:33] [INFO ] Deduced a trap composed of 131 places in 179 ms of which 3 ms to minimize.
[2024-05-22 00:06:34] [INFO ] Deduced a trap composed of 36 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:06:34] [INFO ] Deduced a trap composed of 37 places in 176 ms of which 3 ms to minimize.
[2024-05-22 00:06:34] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 20/279 constraints. Problems are: Problem set: 22 solved, 392 unsolved
[2024-05-22 00:06:35] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:06:35] [INFO ] Deduced a trap composed of 91 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:06:35] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:06:36] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:06:36] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:06:36] [INFO ] Deduced a trap composed of 105 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:06:36] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:06:37] [INFO ] Deduced a trap composed of 103 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:06:37] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:06:37] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:06:37] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:06:37] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:06:38] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:06:38] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:06:38] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:06:38] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 130 places in 157 ms of which 3 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:06:39] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 20/299 constraints. Problems are: Problem set: 22 solved, 392 unsolved
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 90 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:06:40] [INFO ] Deduced a trap composed of 92 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:06:41] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:06:41] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:06:41] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:06:41] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:06:41] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:06:41] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 83 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:06:42] [INFO ] Deduced a trap composed of 24 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:06:43] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 4 ms to minimize.
[2024-05-22 00:06:43] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:06:43] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:06:43] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 2 ms to minimize.
Problem TDEAD381 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 20/319 constraints. Problems are: Problem set: 23 solved, 391 unsolved
[2024-05-22 00:06:44] [INFO ] Deduced a trap composed of 93 places in 153 ms of which 3 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 3 ms to minimize.
[2024-05-22 00:06:45] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:06:46] [INFO ] Deduced a trap composed of 21 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:06:46] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 2 ms to minimize.
[2024-05-22 00:06:47] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:06:47] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:06:47] [INFO ] Deduced a trap composed of 22 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:06:47] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:06:47] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:06:48] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:06:49] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 3 ms to minimize.
SMT process timed out in 60187ms, After SMT, problems are : Problem set: 23 solved, 391 unsolved
Search for dead transitions found 23 dead transitions in 60192ms
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 : 487/517 places, 392/445 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 485 transition count 392
Applied a total of 2 rules in 11 ms. Remains 485 /487 variables (removed 2) and now considering 392/392 (removed 0) transitions.
// Phase 1: matrix 392 rows 485 cols
[2024-05-22 00:06:49] [INFO ] Computed 104 invariants in 5 ms
[2024-05-22 00:06:49] [INFO ] Implicit Places using invariants in 202 ms returned []
[2024-05-22 00:06:49] [INFO ] Invariant cache hit.
[2024-05-22 00:06:50] [INFO ] Implicit Places using invariants and state equation in 483 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 687 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 484/517 places, 392/445 transitions.
Applied a total of 0 rules in 9 ms. Remains 484 /484 variables (removed 0) and now considering 392/392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61783 ms. Remains : 484/517 places, 392/445 transitions.
[2024-05-22 00:06:50] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:06:50] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:06:50] [INFO ] Input system was already deterministic with 392 transitions.
[2024-05-22 00:06:50] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:06:50] [INFO ] Flatten gal took : 15 ms
[2024-05-22 00:06:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality14701956874372947873.gal : 3 ms
[2024-05-22 00:06:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality517132411847858764.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/CTLCardinality14701956874372947873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality517132411847858764.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:07:20] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:07:20] [INFO ] Applying decomposition
[2024-05-22 00:07:20] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13811511312534686729.txt' '-o' '/tmp/graph13811511312534686729.bin' '-w' '/tmp/graph13811511312534686729.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13811511312534686729.bin' '-l' '-1' '-v' '-w' '/tmp/graph13811511312534686729.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:07:20] [INFO ] Decomposing Gal with order
[2024-05-22 00:07:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:07:20] [INFO ] Removed a total of 114 redundant transitions.
[2024-05-22 00:07:20] [INFO ] Flatten gal took : 22 ms
[2024-05-22 00:07:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2024-05-22 00:07:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality13546470369382365815.gal : 5 ms
[2024-05-22 00:07:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality9440689395719588737.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/CTLCardinality13546470369382365815.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9440689395719588737.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.90206e+25,1.66051,48556,5637,49,72395,824,964,154942,69,1858,0


Converting to forward existential form...Done !
original formula: (AX(FALSE) + EX(((AG((i17.i0.u7.p16==0)) * ((!(A((i1.u73.p221==1) U (i14.i0.u102.p313==1))) + (EF((i7.u64.p200==0)) * AF(((i12.u106.p332=...342
=> equivalent forward existential formula: [(EY((Init * !(EX(((!(E(TRUE U !((i17.i0.u7.p16==0)))) * ((!(!((E(!((i14.i0.u102.p313==1)) U (!((i1.u73.p221==1)...487
Reverse transition relation is NOT exact ! Due to transitions t6, t169, t177, t263, t284, t372, t373, t374, t376, t377, t385, i0.i0.u79.t172, i0.i0.u83.t16...1320
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 493 transition count 421
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 493 transition count 421
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 484 transition count 412
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 484 transition count 412
Applied a total of 66 rules in 35 ms. Remains 484 /517 variables (removed 33) and now considering 412/445 (removed 33) transitions.
// Phase 1: matrix 412 rows 484 cols
[2024-05-22 00:07:50] [INFO ] Computed 99 invariants in 7 ms
[2024-05-22 00:07:50] [INFO ] Implicit Places using invariants in 240 ms returned []
[2024-05-22 00:07:50] [INFO ] Invariant cache hit.
[2024-05-22 00:07:51] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2024-05-22 00:07:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/483 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/483 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 1/484 variables, 56/95 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/484 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 411 unsolved
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 71 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:07:59] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:08:00] [INFO ] Deduced a trap composed of 94 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 95 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 90 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:08:01] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 95 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
Problem TDEAD347 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD365 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/484 variables, 20/119 constraints. Problems are: Problem set: 3 solved, 408 unsolved
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 93 places in 154 ms of which 2 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 91 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 87 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 90 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 92 places in 151 ms of which 3 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:08:03] [INFO ] Deduced a trap composed of 95 places in 154 ms of which 3 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:08:04] [INFO ] Deduced a trap composed of 92 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:08:05] [INFO ] Deduced a trap composed of 86 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:08:05] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:08:05] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
Problem TDEAD345 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/484 variables, 20/139 constraints. Problems are: Problem set: 15 solved, 396 unsolved
[2024-05-22 00:08:05] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:08:05] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 85 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 84 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:08:06] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 81 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 116 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 119 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 86 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:08:07] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 83 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:08:08] [INFO ] Deduced a trap composed of 108 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/484 variables, 20/159 constraints. Problems are: Problem set: 15 solved, 396 unsolved
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 94 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 96 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 110 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 90 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:08:11] [INFO ] Deduced a trap composed of 85 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 90 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:08:12] [INFO ] Deduced a trap composed of 94 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 22 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:08:13] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:08:14] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:08:14] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:08:14] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:08:14] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
Problem TDEAD378 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/484 variables, 20/179 constraints. Problems are: Problem set: 16 solved, 395 unsolved
[2024-05-22 00:08:14] [INFO ] Deduced a trap composed of 90 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:08:14] [INFO ] Deduced a trap composed of 89 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:08:15] [INFO ] Deduced a trap composed of 111 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:08:15] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:08:15] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:08:15] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:08:15] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 2 ms to minimize.
[2024-05-22 00:08:16] [INFO ] Deduced a trap composed of 92 places in 111 ms of which 5 ms to minimize.
[2024-05-22 00:08:16] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:08:16] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:08:16] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:08:16] [INFO ] Deduced a trap composed of 93 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:08:16] [INFO ] Deduced a trap composed of 91 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:08:16] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:08:17] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:08:17] [INFO ] Deduced a trap composed of 93 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:08:17] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:08:17] [INFO ] Deduced a trap composed of 90 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:08:17] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:08:17] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 2 ms to minimize.
Problem TDEAD352 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/484 variables, 20/199 constraints. Problems are: Problem set: 22 solved, 389 unsolved
[2024-05-22 00:08:18] [INFO ] Deduced a trap composed of 86 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 112 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:08:19] [INFO ] Deduced a trap composed of 49 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 25 places in 148 ms of which 3 ms to minimize.
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:08:20] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 27 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:08:21] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 3 ms to minimize.
SMT process timed out in 30113ms, After SMT, problems are : Problem set: 22 solved, 389 unsolved
Search for dead transitions found 22 dead transitions in 30119ms
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 : 484/517 places, 390/445 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 483 transition count 390
Applied a total of 1 rules in 8 ms. Remains 483 /484 variables (removed 1) and now considering 390/390 (removed 0) transitions.
// Phase 1: matrix 390 rows 483 cols
[2024-05-22 00:08:21] [INFO ] Computed 104 invariants in 3 ms
[2024-05-22 00:08:21] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 00:08:21] [INFO ] Invariant cache hit.
[2024-05-22 00:08:22] [INFO ] Implicit Places using invariants and state equation in 379 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 558 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 481/517 places, 390/445 transitions.
Applied a total of 0 rules in 13 ms. Remains 481 /481 variables (removed 0) and now considering 390/390 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31458 ms. Remains : 481/517 places, 390/445 transitions.
[2024-05-22 00:08:22] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:08:22] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:08:22] [INFO ] Input system was already deterministic with 390 transitions.
[2024-05-22 00:08:22] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:08:22] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:08:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality12604471919829061459.gal : 2 ms
[2024-05-22 00:08:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality5058088787142736980.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/CTLCardinality12604471919829061459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5058088787142736980.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:08:52] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:08:52] [INFO ] Applying decomposition
[2024-05-22 00:08:52] [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/graph2498617065473409975.txt' '-o' '/tmp/graph2498617065473409975.bin' '-w' '/tmp/graph2498617065473409975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2498617065473409975.bin' '-l' '-1' '-v' '-w' '/tmp/graph2498617065473409975.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:08:52] [INFO ] Decomposing Gal with order
[2024-05-22 00:08:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:08:52] [INFO ] Removed a total of 123 redundant transitions.
[2024-05-22 00:08:52] [INFO ] Flatten gal took : 28 ms
[2024-05-22 00:08:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2024-05-22 00:08:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality14514120031343232216.gal : 6 ms
[2024-05-22 00:08:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality8102851713750261326.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/CTLCardinality14514120031343232216.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8102851713750261326.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.61016e+25,0.563954,22732,3242,43,37351,543,960,63615,60,1166,0


Converting to forward existential form...Done !
original formula: EF((EX((i13.i0.u126.p421==0)) * EF(((i14.u122.p402==0)&&(i16.u106.p322==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * EX((i13.i0.u126.p421==0))),TRUE) * ((i14.u122.p402==0)&&(i16.u106.p322==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t166, t174, t260, t272, t370, t371, t372, t374, t375, t383, i0.i0.u131.t66, i0.i1.u82...1277
(forward)formula 0,1,3.27374,124108,1,0,256023,617,6483,442114,286,1613,627783
FORMULA BusinessProcesses-PT-15-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 496 transition count 424
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 496 transition count 424
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 50 place count 488 transition count 416
Iterating global reduction 0 with 8 rules applied. Total rules applied 58 place count 488 transition count 416
Applied a total of 58 rules in 43 ms. Remains 488 /517 variables (removed 29) and now considering 416/445 (removed 29) transitions.
// Phase 1: matrix 416 rows 488 cols
[2024-05-22 00:08:55] [INFO ] Computed 99 invariants in 6 ms
[2024-05-22 00:08:55] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-22 00:08:55] [INFO ] Invariant cache hit.
[2024-05-22 00:08:56] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2024-05-22 00:08:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/487 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/488 variables, 56/95 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 00:09:05] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:09:05] [INFO ] Deduced a trap composed of 70 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:09:05] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:09:05] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:09:05] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:09:06] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:09:06] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:09:06] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:09:06] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:09:06] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:09:06] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:09:06] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:09:06] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 1 ms to minimize.
[2024-05-22 00:09:06] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:09:07] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:09:07] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:09:07] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:09:07] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:09:07] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:09:07] [INFO ] Deduced a trap composed of 86 places in 133 ms of which 3 ms to minimize.
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 20/119 constraints. Problems are: Problem set: 2 solved, 413 unsolved
[2024-05-22 00:09:08] [INFO ] Deduced a trap composed of 69 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:09:08] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:09:08] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:09:08] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:09:08] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:09:08] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:09:08] [INFO ] Deduced a trap composed of 80 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:09:09] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:09:09] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:09:09] [INFO ] Deduced a trap composed of 87 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:09:09] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:09:09] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:09:09] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:09:09] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 71 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 86 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:09:10] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 20/139 constraints. Problems are: Problem set: 2 solved, 413 unsolved
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 76 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 90 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 91 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 87 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:09:11] [INFO ] Deduced a trap composed of 88 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 87 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:09:12] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:09:13] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:09:13] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:09:13] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 20/159 constraints. Problems are: Problem set: 2 solved, 413 unsolved
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 92 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 94 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 93 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 86 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 91 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 90 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:09:16] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 87 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 86 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 89 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:09:17] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:09:18] [INFO ] Deduced a trap composed of 92 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:09:18] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:09:18] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:09:18] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:09:18] [INFO ] Deduced a trap composed of 85 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:09:19] [INFO ] Deduced a trap composed of 94 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:09:19] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
Problem TDEAD351 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 20/179 constraints. Problems are: Problem set: 3 solved, 412 unsolved
[2024-05-22 00:09:19] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:09:19] [INFO ] Deduced a trap composed of 98 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:09:19] [INFO ] Deduced a trap composed of 91 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:09:19] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:09:20] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 91 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:09:21] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 103 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 101 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
Problem TDEAD350 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 20/199 constraints. Problems are: Problem set: 4 solved, 411 unsolved
[2024-05-22 00:09:22] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 91 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 71 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 89 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 3 ms to minimize.
SMT process timed out in 30111ms, After SMT, problems are : Problem set: 4 solved, 411 unsolved
Search for dead transitions found 4 dead transitions in 30120ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 488/517 places, 412/445 transitions.
Applied a total of 0 rules in 7 ms. Remains 488 /488 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30876 ms. Remains : 488/517 places, 412/445 transitions.
[2024-05-22 00:09:26] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:09:26] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:09:26] [INFO ] Input system was already deterministic with 412 transitions.
[2024-05-22 00:09:26] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:09:26] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:09:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality8664317206599388207.gal : 2 ms
[2024-05-22 00:09:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality596283078291676867.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/CTLCardinality8664317206599388207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality596283078291676867.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:09:56] [INFO ] Flatten gal took : 29 ms
[2024-05-22 00:09:56] [INFO ] Applying decomposition
[2024-05-22 00:09:56] [INFO ] Flatten gal took : 22 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4455390150959697701.txt' '-o' '/tmp/graph4455390150959697701.bin' '-w' '/tmp/graph4455390150959697701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4455390150959697701.bin' '-l' '-1' '-v' '-w' '/tmp/graph4455390150959697701.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:09:56] [INFO ] Decomposing Gal with order
[2024-05-22 00:09:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:09:56] [INFO ] Removed a total of 199 redundant transitions.
[2024-05-22 00:09:56] [INFO ] Flatten gal took : 29 ms
[2024-05-22 00:09:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 9 ms.
[2024-05-22 00:09:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality9669204554606570517.gal : 6 ms
[2024-05-22 00:09:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality5411183911688218738.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/CTLCardinality9669204554606570517.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5411183911688218738.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.62069e+25,0.959748,32380,4016,60,52644,584,1092,102875,71,1303,0


Converting to forward existential form...Done !
original formula: AX((AF((((((i3.u30.p90==0)||(i14.i1.u96.p285==0))&&(i10.i0.u84.p254==0))&&((i16.u118.p384==1)&&((i5.i0.u23.p62==0)||(i6.i3.u31.p105==1)))...232
=> equivalent forward existential formula: [FwdG((EY(Init) * !(E(TRUE U EG(EX(((i15.u97.p288==0)&&(i8.u63.p190==1))))))),!((((((i3.u30.p90==0)||(i14.i1.u96...286
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t172, t176, t188, t285, t393, t394, t396, t405, i0.t180, i0.u72.t187, i0.u74....1336
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 a local SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,18.1818,554044,1,0,999318,644,7828,1.90757e+06,386,1880,2191927
FORMULA BusinessProcesses-PT-15-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 495 transition count 423
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 495 transition count 423
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 488 transition count 416
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 488 transition count 416
Applied a total of 58 rules in 19 ms. Remains 488 /517 variables (removed 29) and now considering 416/445 (removed 29) transitions.
// Phase 1: matrix 416 rows 488 cols
[2024-05-22 00:10:15] [INFO ] Computed 99 invariants in 6 ms
[2024-05-22 00:10:15] [INFO ] Implicit Places using invariants in 215 ms returned []
[2024-05-22 00:10:15] [INFO ] Invariant cache hit.
[2024-05-22 00:10:16] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Running 415 sub problems to find dead transitions.
[2024-05-22 00:10:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/487 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 2 (OVERLAPS) 1/488 variables, 59/98 constraints. Problems are: Problem set: 0 solved, 415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 415 unsolved
[2024-05-22 00:10:23] [INFO ] Deduced a trap composed of 72 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 96 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:10:24] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 94 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 110 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 98 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 94 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:10:25] [INFO ] Deduced a trap composed of 90 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 90 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 83 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 2 ms to minimize.
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 20/119 constraints. Problems are: Problem set: 9 solved, 406 unsolved
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:10:26] [INFO ] Deduced a trap composed of 92 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 100 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 95 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 90 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:10:27] [INFO ] Deduced a trap composed of 90 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 94 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:10:28] [INFO ] Deduced a trap composed of 92 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:10:29] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 20/139 constraints. Problems are: Problem set: 9 solved, 406 unsolved
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 81 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 3 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:10:30] [INFO ] Deduced a trap composed of 89 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 118 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 91 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:10:31] [INFO ] Deduced a trap composed of 119 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 90 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 92 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 94 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:10:32] [INFO ] Deduced a trap composed of 115 places in 97 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 20/159 constraints. Problems are: Problem set: 9 solved, 406 unsolved
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:10:35] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 93 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 90 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:10:36] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 90 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:10:37] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 86 places in 116 ms of which 3 ms to minimize.
Problem TDEAD349 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 20/179 constraints. Problems are: Problem set: 20 solved, 395 unsolved
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:10:38] [INFO ] Deduced a trap composed of 95 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:10:39] [INFO ] Deduced a trap composed of 93 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:10:39] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:10:39] [INFO ] Deduced a trap composed of 93 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:10:39] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:10:39] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 91 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 91 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 93 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 103 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:10:40] [INFO ] Deduced a trap composed of 95 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 46 places in 47 ms of which 2 ms to minimize.
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:10:41] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 3 ms to minimize.
Problem TDEAD365 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 20/199 constraints. Problems are: Problem set: 21 solved, 394 unsolved
[2024-05-22 00:10:42] [INFO ] Deduced a trap composed of 93 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:10:42] [INFO ] Deduced a trap composed of 116 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:10:42] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:10:42] [INFO ] Deduced a trap composed of 89 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 90 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:10:43] [INFO ] Deduced a trap composed of 92 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:10:44] [INFO ] Deduced a trap composed of 91 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:10:45] [INFO ] Deduced a trap composed of 15 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:10:45] [INFO ] Deduced a trap composed of 25 places in 158 ms of which 3 ms to minimize.
[2024-05-22 00:10:45] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:10:45] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:10:46] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/904 variables, and 214 constraints, problems are : Problem set: 21 solved, 394 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/488 constraints, PredecessorRefiner: 415/415 constraints, Known Traps: 115/115 constraints]
Escalating to Integer solving :Problem set: 21 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/487 variables, 39/39 constraints. Problems are: Problem set: 21 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/487 variables, 0/39 constraints. Problems are: Problem set: 21 solved, 394 unsolved
At refinement iteration 2 (OVERLAPS) 1/488 variables, 59/98 constraints. Problems are: Problem set: 21 solved, 394 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/488 variables, 1/99 constraints. Problems are: Problem set: 21 solved, 394 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/488 variables, 115/214 constraints. Problems are: Problem set: 21 solved, 394 unsolved
[2024-05-22 00:10:49] [INFO ] Deduced a trap composed of 87 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:10:49] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:10:49] [INFO ] Deduced a trap composed of 88 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:10:49] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:10:49] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:10:50] [INFO ] Deduced a trap composed of 88 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:10:50] [INFO ] Deduced a trap composed of 71 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:10:50] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:10:50] [INFO ] Deduced a trap composed of 88 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:10:50] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:10:50] [INFO ] Deduced a trap composed of 91 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:10:50] [INFO ] Deduced a trap composed of 86 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:10:51] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:10:51] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:10:51] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:10:51] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:10:51] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:10:51] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:10:51] [INFO ] Deduced a trap composed of 92 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:10:52] [INFO ] Deduced a trap composed of 88 places in 117 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 20/234 constraints. Problems are: Problem set: 21 solved, 394 unsolved
[2024-05-22 00:10:52] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:10:52] [INFO ] Deduced a trap composed of 88 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:10:52] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:10:52] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:10:53] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:10:53] [INFO ] Deduced a trap composed of 91 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:10:53] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:10:54] [INFO ] Deduced a trap composed of 36 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:10:54] [INFO ] Deduced a trap composed of 96 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:10:55] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:10:55] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 4 ms to minimize.
[2024-05-22 00:10:55] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:10:55] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:10:56] [INFO ] Deduced a trap composed of 22 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 2 ms to minimize.
Problem TDEAD350 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 20/254 constraints. Problems are: Problem set: 22 solved, 393 unsolved
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 89 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:10:57] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:10:58] [INFO ] Deduced a trap composed of 88 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:10:58] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:10:58] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:10:58] [INFO ] Deduced a trap composed of 108 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:10:58] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:10:58] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:10:58] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:10:59] [INFO ] Deduced a trap composed of 84 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:10:59] [INFO ] Deduced a trap composed of 91 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:10:59] [INFO ] Deduced a trap composed of 92 places in 147 ms of which 3 ms to minimize.
[2024-05-22 00:10:59] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:10:59] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 3 ms to minimize.
[2024-05-22 00:10:59] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:11:00] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:11:00] [INFO ] Deduced a trap composed of 85 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:11:00] [INFO ] Deduced a trap composed of 93 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:11:00] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 20/274 constraints. Problems are: Problem set: 22 solved, 393 unsolved
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 89 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 89 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:11:01] [INFO ] Deduced a trap composed of 94 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:11:02] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 2 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:11:03] [INFO ] Deduced a trap composed of 96 places in 137 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 20/294 constraints. Problems are: Problem set: 22 solved, 393 unsolved
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 44 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:11:04] [INFO ] Deduced a trap composed of 115 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 113 places in 113 ms of which 2 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 95 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 82 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 85 places in 119 ms of which 3 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:11:05] [INFO ] Deduced a trap composed of 84 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 82 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:11:06] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 93 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:11:07] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
Problem TDEAD360 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 20/314 constraints. Problems are: Problem set: 23 solved, 392 unsolved
[2024-05-22 00:11:08] [INFO ] Deduced a trap composed of 91 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:11:08] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:11:08] [INFO ] Deduced a trap composed of 87 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:11:08] [INFO ] Deduced a trap composed of 96 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:11:09] [INFO ] Deduced a trap composed of 117 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:11:09] [INFO ] Deduced a trap composed of 116 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:11:09] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:11:09] [INFO ] Deduced a trap composed of 92 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:11:09] [INFO ] Deduced a trap composed of 112 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:09] [INFO ] Deduced a trap composed of 113 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:11:10] [INFO ] Deduced a trap composed of 79 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:11:10] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:11:10] [INFO ] Deduced a trap composed of 82 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:11:10] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:11:10] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:11:11] [INFO ] Deduced a trap composed of 70 places in 159 ms of which 5 ms to minimize.
[2024-05-22 00:11:11] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:11:11] [INFO ] Deduced a trap composed of 68 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:11:11] [INFO ] Deduced a trap composed of 89 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:11:11] [INFO ] Deduced a trap composed of 28 places in 120 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 20/334 constraints. Problems are: Problem set: 23 solved, 392 unsolved
[2024-05-22 00:11:12] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:11:12] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 4 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
(s177 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 1)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(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 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 1)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 1)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 1)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/904 variables, and 350 constraints, problems are : Problem set: 23 solved, 392 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 0/488 constraints, PredecessorRefiner: 0/415 constraints, Known Traps: 251/251 constraints]
After SMT, in 60129ms problems are : Problem set: 23 solved, 392 unsolved
Search for dead transitions found 23 dead transitions in 60136ms
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 : 488/517 places, 393/445 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 487 transition count 393
Applied a total of 1 rules in 11 ms. Remains 487 /488 variables (removed 1) and now considering 393/393 (removed 0) transitions.
// Phase 1: matrix 393 rows 487 cols
[2024-05-22 00:11:16] [INFO ] Computed 105 invariants in 5 ms
[2024-05-22 00:11:16] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-22 00:11:16] [INFO ] Invariant cache hit.
[2024-05-22 00:11:16] [INFO ] Implicit Places using invariants and state equation in 513 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 713 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 485/517 places, 393/445 transitions.
Applied a total of 0 rules in 6 ms. Remains 485 /485 variables (removed 0) and now considering 393/393 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61759 ms. Remains : 485/517 places, 393/445 transitions.
[2024-05-22 00:11:16] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:11:16] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:11:17] [INFO ] Input system was already deterministic with 393 transitions.
[2024-05-22 00:11:17] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:11:17] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:11:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality942751821818666143.gal : 2 ms
[2024-05-22 00:11:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality4619947065600076668.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/CTLCardinality942751821818666143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4619947065600076668.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:11:47] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:11:47] [INFO ] Applying decomposition
[2024-05-22 00:11:47] [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/graph17474278381098780819.txt' '-o' '/tmp/graph17474278381098780819.bin' '-w' '/tmp/graph17474278381098780819.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17474278381098780819.bin' '-l' '-1' '-v' '-w' '/tmp/graph17474278381098780819.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:11:47] [INFO ] Decomposing Gal with order
[2024-05-22 00:11:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:11:47] [INFO ] Removed a total of 117 redundant transitions.
[2024-05-22 00:11:47] [INFO ] Flatten gal took : 25 ms
[2024-05-22 00:11:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 5 ms.
[2024-05-22 00:11:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality1406821199242131525.gal : 23 ms
[2024-05-22 00:11:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality90255467670627086.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/CTLCardinality1406821199242131525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality90255467670627086.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 -...260
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.61468e+25,0.820869,29980,4595,57,48664,1334,927,98529,68,2944,0


Converting to forward existential form...Done !
original formula: (A((((i19.u141.p515==0)||(i9.u53.p159==1)) * EG((!(E(((i16.u95.p281==0)||(i19.u131.p453==1)) U ((i15.u139.p506==0)||(i19.u153.p571==1))))...370
=> equivalent forward existential formula: ([((Init * !(EG(!(!(EG(!(EX(!(E(TRUE U !((i20.i1.i1.u159.p596==0)))))))))))) * !(E(!(!(EG(!(EX(!(E(TRUE U !((i20...609
Reverse transition relation is NOT exact ! Due to transitions t6, t170, t174, t190, t264, t272, t285, t373, t374, t377, t378, t386, i0.u129.t73, i0.u130.t7...1241
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found a local SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Graph (trivial) has 255 edges and 517 vertex of which 6 / 517 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1121 edges and 512 vertex of which 511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 66 place count 510 transition count 373
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 130 place count 446 transition count 373
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 130 place count 446 transition count 271
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 223 rules applied. Total rules applied 353 place count 325 transition count 271
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 377 place count 301 transition count 247
Iterating global reduction 2 with 24 rules applied. Total rules applied 401 place count 301 transition count 247
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 401 place count 301 transition count 243
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 410 place count 296 transition count 243
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 655 place count 172 transition count 122
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 656 place count 171 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 657 place count 170 transition count 121
Applied a total of 657 rules in 52 ms. Remains 170 /517 variables (removed 347) and now considering 121/445 (removed 324) transitions.
// Phase 1: matrix 121 rows 170 cols
[2024-05-22 00:12:17] [INFO ] Computed 75 invariants in 2 ms
[2024-05-22 00:12:17] [INFO ] Implicit Places using invariants in 142 ms returned [0, 1, 2, 3, 4, 8, 9, 32, 33, 34, 35, 40, 41, 42, 43, 47, 48, 49, 50, 51, 52, 53]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 156 ms to find 22 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 148/517 places, 121/445 transitions.
Applied a total of 0 rules in 6 ms. Remains 148 /148 variables (removed 0) and now considering 121/121 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 216 ms. Remains : 148/517 places, 121/445 transitions.
[2024-05-22 00:12:17] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:12:17] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:12:17] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-22 00:12:17] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:12:17] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:12:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8296939474271261473.gal : 1 ms
[2024-05-22 00:12:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9720126207706981312.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8296939474271261473.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9720126207706981312.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
RANDOM walk for 40000 steps (8304 resets) in 222 ms. (179 steps per ms) remains 1/1 properties
Loading property file /tmp/ReachabilityCardinality9720126207706981312.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
BEST_FIRST walk for 40004 steps (2400 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 88 steps, run visited all 1 properties in 6 ms. (steps per millisecond=14 )
SDD proceeding with computation,1 properties remain. new max is 8
Probabilistic random walk after 88 steps, saw 56 distinct states, run finished after 9 ms. (steps per millisecond=9 ) properties seen :1
FORMULA BusinessProcesses-PT-15-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
SDD size :9 after 30
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :30 after 54
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :54 after 108
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :108 after 384
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :870 after 948
Reachability property BusinessProcesses-PT-15-CTLCardinality-2024-06 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 129 fixpoint passes
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 494 transition count 422
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 494 transition count 422
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 55 place count 485 transition count 413
Iterating global reduction 0 with 9 rules applied. Total rules applied 64 place count 485 transition count 413
Applied a total of 64 rules in 19 ms. Remains 485 /517 variables (removed 32) and now considering 413/445 (removed 32) transitions.
// Phase 1: matrix 413 rows 485 cols
[2024-05-22 00:12:17] [INFO ] Computed 99 invariants in 3 ms
[2024-05-22 00:12:18] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-22 00:12:18] [INFO ] Invariant cache hit.
[2024-05-22 00:12:18] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-05-22 00:12:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/485 variables, 56/95 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-05-22 00:12:26] [INFO ] Deduced a trap composed of 69 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:12:26] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:12:26] [INFO ] Deduced a trap composed of 94 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:12:26] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:12:26] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:12:26] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:12:27] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:12:27] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:12:27] [INFO ] Deduced a trap composed of 66 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:12:27] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:12:27] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:12:27] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:12:27] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:12:27] [INFO ] Deduced a trap composed of 95 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:12:27] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:12:27] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:12:27] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:12:28] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:12:28] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:12:28] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 2 ms to minimize.
Problem TDEAD358 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD387 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 20/119 constraints. Problems are: Problem set: 11 solved, 401 unsolved
[2024-05-22 00:12:28] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:12:28] [INFO ] Deduced a trap composed of 90 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:12:28] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:12:28] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:12:28] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 84 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 88 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:12:29] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:12:30] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:12:30] [INFO ] Deduced a trap composed of 77 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:12:30] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:12:30] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:12:30] [INFO ] Deduced a trap composed of 97 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:12:30] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:12:30] [INFO ] Deduced a trap composed of 50 places in 108 ms of which 2 ms to minimize.
Problem TDEAD347 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 20/139 constraints. Problems are: Problem set: 12 solved, 400 unsolved
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 71 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 88 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:12:31] [INFO ] Deduced a trap composed of 89 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 88 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 93 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 91 places in 126 ms of which 3 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:12:32] [INFO ] Deduced a trap composed of 73 places in 138 ms of which 3 ms to minimize.
[2024-05-22 00:12:33] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:12:33] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 36 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 3 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:12:34] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 2 ms to minimize.
Problem TDEAD346 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 20/159 constraints. Problems are: Problem set: 17 solved, 395 unsolved
[2024-05-22 00:12:36] [INFO ] Deduced a trap composed of 93 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 97 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 90 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 95 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 97 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:12:37] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 89 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 89 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:12:38] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 20/179 constraints. Problems are: Problem set: 17 solved, 395 unsolved
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 83 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 87 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 84 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 116 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:12:39] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:12:40] [INFO ] Deduced a trap composed of 88 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:12:40] [INFO ] Deduced a trap composed of 111 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:12:40] [INFO ] Deduced a trap composed of 88 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:12:40] [INFO ] Deduced a trap composed of 70 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:12:40] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:12:40] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:12:40] [INFO ] Deduced a trap composed of 89 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:12:41] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:12:41] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:12:41] [INFO ] Deduced a trap composed of 109 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:12:41] [INFO ] Deduced a trap composed of 97 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:12:41] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 20/199 constraints. Problems are: Problem set: 17 solved, 395 unsolved
[2024-05-22 00:12:41] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:12:42] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:12:42] [INFO ] Deduced a trap composed of 74 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:12:42] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:12:43] [INFO ] Deduced a trap composed of 94 places in 137 ms of which 2 ms to minimize.
[2024-05-22 00:12:43] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 3 ms to minimize.
[2024-05-22 00:12:43] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:12:43] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:12:43] [INFO ] Deduced a trap composed of 112 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:12:43] [INFO ] Deduced a trap composed of 111 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:12:44] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:12:44] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:12:44] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:12:44] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:12:44] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:12:44] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:12:45] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:12:45] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:12:45] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:12:45] [INFO ] Deduced a trap composed of 15 places in 138 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 20/219 constraints. Problems are: Problem set: 17 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 485/898 variables, and 219 constraints, problems are : Problem set: 17 solved, 395 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/485 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 17 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/484 variables, 39/39 constraints. Problems are: Problem set: 17 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/484 variables, 0/39 constraints. Problems are: Problem set: 17 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/485 variables, 56/95 constraints. Problems are: Problem set: 17 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/485 variables, 4/99 constraints. Problems are: Problem set: 17 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/485 variables, 120/219 constraints. Problems are: Problem set: 17 solved, 395 unsolved
[2024-05-22 00:12:52] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:12:52] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:12:52] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:12:52] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:12:53] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:12:53] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 3 ms to minimize.
[2024-05-22 00:12:53] [INFO ] Deduced a trap composed of 83 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:12:53] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:12:53] [INFO ] Deduced a trap composed of 85 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:12:54] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:12:54] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 2 ms to minimize.
[2024-05-22 00:12:54] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:12:54] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:12:54] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:12:54] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:12:54] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:12:54] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:12:54] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:12:55] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 2 ms to minimize.
[2024-05-22 00:12:55] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/485 variables, 20/239 constraints. Problems are: Problem set: 17 solved, 395 unsolved
[2024-05-22 00:12:55] [INFO ] Deduced a trap composed of 93 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:12:55] [INFO ] Deduced a trap composed of 105 places in 131 ms of which 2 ms to minimize.
[2024-05-22 00:12:55] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:12:56] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:12:56] [INFO ] Deduced a trap composed of 66 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:12:56] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:12:56] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:12:56] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 3 ms to minimize.
[2024-05-22 00:12:57] [INFO ] Deduced a trap composed of 80 places in 142 ms of which 3 ms to minimize.
[2024-05-22 00:12:57] [INFO ] Deduced a trap composed of 80 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:12:57] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:12:57] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:12:57] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:12:57] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:12:58] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:12:58] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:12:58] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:12:58] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 3 ms to minimize.
[2024-05-22 00:12:59] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:12:59] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
Problem TDEAD348 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 20/259 constraints. Problems are: Problem set: 18 solved, 394 unsolved
[2024-05-22 00:12:59] [INFO ] Deduced a trap composed of 68 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:13:00] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:13:00] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 3 ms to minimize.
[2024-05-22 00:13:00] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:13:00] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:13:00] [INFO ] Deduced a trap composed of 87 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:13:00] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:13:00] [INFO ] Deduced a trap composed of 92 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 92 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 90 places in 122 ms of which 3 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 89 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 91 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 91 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 87 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:13:01] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 101 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 20/279 constraints. Problems are: Problem set: 18 solved, 394 unsolved
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 89 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 87 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:13:02] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 88 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 87 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 85 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:13:03] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 96 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 76 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:04] [INFO ] Deduced a trap composed of 63 places in 83 ms of which 2 ms to minimize.
Problem TDEAD370 is UNSAT
Problem TDEAD375 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 20/299 constraints. Problems are: Problem set: 20 solved, 392 unsolved
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 3 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:13:06] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:13:07] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 89 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:13:08] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 3 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 20/319 constraints. Problems are: Problem set: 20 solved, 392 unsolved
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 87 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 83 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 90 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:13:12] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 3 ms to minimize.
[2024-05-22 00:13:12] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 3 ms to minimize.
[2024-05-22 00:13:12] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 2 ms to minimize.
[2024-05-22 00:13:12] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:13:12] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 82 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 91 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 87 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 87 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 20/339 constraints. Problems are: Problem set: 20 solved, 392 unsolved
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 45 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 87 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:13:15] [INFO ] Deduced a trap composed of 119 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 102 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 3 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 112 places in 149 ms of which 3 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 114 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:13:18] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 485/898 variables, and 356 constraints, problems are : Problem set: 20 solved, 392 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/485 constraints, PredecessorRefiner: 0/412 constraints, Known Traps: 257/257 constraints]
After SMT, in 60100ms problems are : Problem set: 20 solved, 392 unsolved
Search for dead transitions found 20 dead transitions in 60104ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 485/517 places, 393/445 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 484 transition count 393
Applied a total of 1 rules in 9 ms. Remains 484 /485 variables (removed 1) and now considering 393/393 (removed 0) transitions.
// Phase 1: matrix 393 rows 484 cols
[2024-05-22 00:13:18] [INFO ] Computed 103 invariants in 8 ms
[2024-05-22 00:13:18] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-22 00:13:18] [INFO ] Invariant cache hit.
[2024-05-22 00:13:19] [INFO ] Implicit Places using invariants and state equation in 427 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 597 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 482/517 places, 393/445 transitions.
Applied a total of 0 rules in 13 ms. Remains 482 /482 variables (removed 0) and now considering 393/393 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61444 ms. Remains : 482/517 places, 393/445 transitions.
[2024-05-22 00:13:19] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:13:19] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:13:19] [INFO ] Input system was already deterministic with 393 transitions.
[2024-05-22 00:13:19] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:13:19] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:13:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality15269255454128310728.gal : 2 ms
[2024-05-22 00:13:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality9364344861848793354.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/CTLCardinality15269255454128310728.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9364344861848793354.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:13:49] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:13:49] [INFO ] Applying decomposition
[2024-05-22 00:13:49] [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/graph1306163227509918275.txt' '-o' '/tmp/graph1306163227509918275.bin' '-w' '/tmp/graph1306163227509918275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1306163227509918275.bin' '-l' '-1' '-v' '-w' '/tmp/graph1306163227509918275.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:13:49] [INFO ] Decomposing Gal with order
[2024-05-22 00:13:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:13:49] [INFO ] Removed a total of 131 redundant transitions.
[2024-05-22 00:13:49] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:13:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2024-05-22 00:13:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality18314253129294440607.gal : 8 ms
[2024-05-22 00:13:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality17007190405617590918.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/CTLCardinality18314253129294440607.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17007190405617590918.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.61016e+25,3.0929,91652,5428,40,136758,533,979,307856,59,1157,0


Converting to forward existential form...Done !
original formula: AX(AX(AG(E((i8.i1.u55.p168==1) U ((i19.u130.p580==0)||(i0.u61.p188==1))))))
=> equivalent forward existential formula: [(FwdU(EY(EY(Init)),TRUE) * !(E((i8.i1.u55.p168==1) U ((i19.u130.p580==0)||(i0.u61.p188==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t167, t175, t187, t261, t273, t282, t373, t374, t375, t377, t378, t386, i0.u59.t208, ...1305
(forward)formula 0,0,11.8052,294140,1,0,505115,596,7446,1.03129e+06,291,1523,1336979
FORMULA BusinessProcesses-PT-15-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Graph (trivial) has 249 edges and 517 vertex of which 6 / 517 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1121 edges and 512 vertex of which 511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 510 transition count 377
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 450 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 449 transition count 376
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 124 place count 449 transition count 273
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 225 rules applied. Total rules applied 349 place count 327 transition count 273
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 370 place count 306 transition count 252
Iterating global reduction 3 with 21 rules applied. Total rules applied 391 place count 306 transition count 252
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 391 place count 306 transition count 249
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 397 place count 303 transition count 249
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 233 rules applied. Total rules applied 630 place count 186 transition count 133
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 636 place count 186 transition count 133
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 637 place count 185 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 638 place count 184 transition count 132
Applied a total of 638 rules in 76 ms. Remains 184 /517 variables (removed 333) and now considering 132/445 (removed 313) transitions.
// Phase 1: matrix 132 rows 184 cols
[2024-05-22 00:14:01] [INFO ] Computed 78 invariants in 1 ms
[2024-05-22 00:14:01] [INFO ] Implicit Places using invariants in 123 ms returned [4, 7, 62, 63, 64, 180, 182]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 124 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 177/517 places, 132/445 transitions.
Applied a total of 0 rules in 4 ms. Remains 177 /177 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 204 ms. Remains : 177/517 places, 132/445 transitions.
[2024-05-22 00:14:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:14:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:14:01] [INFO ] Input system was already deterministic with 132 transitions.
[2024-05-22 00:14:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:14:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:14:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality14924621488736529764.gal : 1 ms
[2024-05-22 00:14:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality2093482205051374195.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/CTLCardinality14924621488736529764.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2093482205051374195.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,31347,0.119813,9072,2,2270,5,17688,6,0,839,12922,0


Converting to forward existential form...Done !
original formula: !(E(EF((((EG(!(((p200==0)||(p11==1)))) + E((p466==0) U (p88==0))) + ((p68==1)||(p221==1))) + !(((p100==0)||(p480==1))))) U (p534==1)))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U (((EG(!(((p200==0)||(p11==1)))) + E((p466==0) U (p88==0))) + ((p68==1)||(p221==1))) + !(((p...200
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t9, t28, t33, t34, t35, t36, t37, t39, t40, t57, t58, t59, t60, t61, t71, t78, t81, t...301
(forward)formula 0,0,1.06824,40788,1,0,222,134823,276,115,6377,101748,292
FORMULA BusinessProcesses-PT-15-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 495 transition count 423
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 495 transition count 423
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 52 place count 487 transition count 415
Iterating global reduction 0 with 8 rules applied. Total rules applied 60 place count 487 transition count 415
Applied a total of 60 rules in 42 ms. Remains 487 /517 variables (removed 30) and now considering 415/445 (removed 30) transitions.
// Phase 1: matrix 415 rows 487 cols
[2024-05-22 00:14:02] [INFO ] Computed 99 invariants in 5 ms
[2024-05-22 00:14:02] [INFO ] Implicit Places using invariants in 195 ms returned []
[2024-05-22 00:14:02] [INFO ] Invariant cache hit.
[2024-05-22 00:14:03] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 817 ms to find 0 implicit places.
Running 414 sub problems to find dead transitions.
[2024-05-22 00:14:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 2 (OVERLAPS) 1/487 variables, 58/97 constraints. Problems are: Problem set: 0 solved, 414 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 00:14:13] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:14:13] [INFO ] Deduced a trap composed of 95 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:14:13] [INFO ] Deduced a trap composed of 99 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:14:14] [INFO ] Deduced a trap composed of 92 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:14:14] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:14:14] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:14:14] [INFO ] Deduced a trap composed of 93 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:14:14] [INFO ] Deduced a trap composed of 85 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:14:14] [INFO ] Deduced a trap composed of 85 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:14:14] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:14:14] [INFO ] Deduced a trap composed of 94 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:14:14] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:14:14] [INFO ] Deduced a trap composed of 94 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:14:15] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:14:15] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:14:15] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:14:15] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:14:15] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:14:15] [INFO ] Deduced a trap composed of 86 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:14:15] [INFO ] Deduced a trap composed of 100 places in 83 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 414 unsolved
[2024-05-22 00:14:15] [INFO ] Deduced a trap composed of 93 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:14:15] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:14:15] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:14:16] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:14:16] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:14:16] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:14:16] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 3 ms to minimize.
[2024-05-22 00:14:16] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:14:16] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:14:16] [INFO ] Deduced a trap composed of 93 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:14:16] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:14:16] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:14:17] [INFO ] Deduced a trap composed of 92 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:14:17] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:14:17] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:14:17] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:14:17] [INFO ] Deduced a trap composed of 91 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:14:17] [INFO ] Deduced a trap composed of 92 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:14:17] [INFO ] Deduced a trap composed of 91 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:14:17] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 1 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 20/139 constraints. Problems are: Problem set: 9 solved, 405 unsolved
[2024-05-22 00:14:17] [INFO ] Deduced a trap composed of 90 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 5 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 94 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:14:18] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 90 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 101 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 90 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 112 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:14:19] [INFO ] Deduced a trap composed of 88 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:14:20] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 2 ms to minimize.
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 20/159 constraints. Problems are: Problem set: 16 solved, 398 unsolved
[2024-05-22 00:14:22] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:14:22] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:14:22] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 66 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 84 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 82 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 69 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:14:23] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:24] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 20/179 constraints. Problems are: Problem set: 16 solved, 398 unsolved
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 85 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 89 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 103 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 93 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 44 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:14:25] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 4 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 84 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 3 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 45 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 86 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 47 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:14:26] [INFO ] Deduced a trap composed of 90 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 3 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD387 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 20/199 constraints. Problems are: Problem set: 21 solved, 393 unsolved
[2024-05-22 00:14:27] [INFO ] Deduced a trap composed of 113 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 106 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 94 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:14:28] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 90 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 104 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 76 places in 86 ms of which 3 ms to minimize.
[2024-05-22 00:14:29] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 2 ms to minimize.
Problem TDEAD389 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 20/219 constraints. Problems are: Problem set: 22 solved, 392 unsolved
[2024-05-22 00:14:32] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:14:33] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
(s7 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/902 variables, and 221 constraints, problems are : Problem set: 22 solved, 392 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 58/58 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/487 constraints, PredecessorRefiner: 414/414 constraints, Known Traps: 122/122 constraints]
Escalating to Integer solving :Problem set: 22 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 39/39 constraints. Problems are: Problem set: 22 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 0/39 constraints. Problems are: Problem set: 22 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/487 variables, 58/97 constraints. Problems are: Problem set: 22 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 2/99 constraints. Problems are: Problem set: 22 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 122/221 constraints. Problems are: Problem set: 22 solved, 392 unsolved
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 79 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:14:37] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:14:38] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:14:38] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:14:38] [INFO ] Deduced a trap composed of 89 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:14:38] [INFO ] Deduced a trap composed of 88 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:14:38] [INFO ] Deduced a trap composed of 95 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:14:38] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:14:38] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 4 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 84 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:14:39] [INFO ] Deduced a trap composed of 50 places in 86 ms of which 2 ms to minimize.
Problem TDEAD355 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 20/241 constraints. Problems are: Problem set: 23 solved, 391 unsolved
[2024-05-22 00:14:40] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:14:40] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 3 ms to minimize.
[2024-05-22 00:14:40] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:14:40] [INFO ] Deduced a trap composed of 92 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:14:40] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:14:40] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:14:41] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:14:41] [INFO ] Deduced a trap composed of 94 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:14:41] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:14:41] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:14:41] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:14:42] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:14:42] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:14:42] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:14:42] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:14:42] [INFO ] Deduced a trap composed of 81 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:14:42] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:14:42] [INFO ] Deduced a trap composed of 86 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:14:42] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 3 ms to minimize.
[2024-05-22 00:14:43] [INFO ] Deduced a trap composed of 84 places in 105 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/487 variables, 20/261 constraints. Problems are: Problem set: 23 solved, 391 unsolved
[2024-05-22 00:14:43] [INFO ] Deduced a trap composed of 106 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:14:43] [INFO ] Deduced a trap composed of 88 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:14:43] [INFO ] Deduced a trap composed of 83 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:14:43] [INFO ] Deduced a trap composed of 82 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 81 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 3 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 89 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 89 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 81 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 84 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:14:44] [INFO ] Deduced a trap composed of 83 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:14:45] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:14:45] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:14:45] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 3 ms to minimize.
[2024-05-22 00:14:45] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:14:45] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:14:45] [INFO ] Deduced a trap composed of 97 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/487 variables, 20/281 constraints. Problems are: Problem set: 23 solved, 391 unsolved
[2024-05-22 00:14:46] [INFO ] Deduced a trap composed of 96 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:14:46] [INFO ] Deduced a trap composed of 98 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:14:46] [INFO ] Deduced a trap composed of 93 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:46] [INFO ] Deduced a trap composed of 95 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:14:46] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:14:46] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:14:46] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:14:47] [INFO ] Deduced a trap composed of 96 places in 107 ms of which 3 ms to minimize.
[2024-05-22 00:14:47] [INFO ] Deduced a trap composed of 96 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:14:47] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 3 ms to minimize.
[2024-05-22 00:14:47] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 4 ms to minimize.
[2024-05-22 00:14:47] [INFO ] Deduced a trap composed of 106 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:14:47] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:14:47] [INFO ] Deduced a trap composed of 114 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:14:47] [INFO ] Deduced a trap composed of 107 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:14:47] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:14:48] [INFO ] Deduced a trap composed of 90 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:14:48] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:14:48] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:14:48] [INFO ] Deduced a trap composed of 26 places in 109 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/487 variables, 20/301 constraints. Problems are: Problem set: 23 solved, 391 unsolved
[2024-05-22 00:14:50] [INFO ] Deduced a trap composed of 90 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:14:50] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:14:50] [INFO ] Deduced a trap composed of 67 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:14:50] [INFO ] Deduced a trap composed of 80 places in 151 ms of which 2 ms to minimize.
[2024-05-22 00:14:50] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:14:50] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:14:50] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:14:50] [INFO ] Deduced a trap composed of 111 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:14:51] [INFO ] Deduced a trap composed of 109 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:14:51] [INFO ] Deduced a trap composed of 92 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:14:51] [INFO ] Deduced a trap composed of 90 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:14:51] [INFO ] Deduced a trap composed of 113 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:14:51] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:14:51] [INFO ] Deduced a trap composed of 87 places in 84 ms of which 3 ms to minimize.
[2024-05-22 00:14:51] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:14:51] [INFO ] Deduced a trap composed of 81 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:14:51] [INFO ] Deduced a trap composed of 90 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:14:51] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:14:51] [INFO ] Deduced a trap composed of 97 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:14:52] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 20/321 constraints. Problems are: Problem set: 23 solved, 391 unsolved
[2024-05-22 00:14:52] [INFO ] Deduced a trap composed of 93 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:14:52] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:14:52] [INFO ] Deduced a trap composed of 91 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:14:53] [INFO ] Deduced a trap composed of 110 places in 150 ms of which 3 ms to minimize.
[2024-05-22 00:14:53] [INFO ] Deduced a trap composed of 94 places in 108 ms of which 3 ms to minimize.
[2024-05-22 00:14:53] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:14:54] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 89 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:14:55] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 3 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 3 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:14:56] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 20/341 constraints. Problems are: Problem set: 23 solved, 391 unsolved
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 95 places in 133 ms of which 3 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 91 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 90 places in 97 ms of which 3 ms to minimize.
[2024-05-22 00:14:57] [INFO ] Deduced a trap composed of 90 places in 96 ms of which 3 ms to minimize.
[2024-05-22 00:14:58] [INFO ] Deduced a trap composed of 20 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:14:58] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:14:59] [INFO ] Deduced a trap composed of 113 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:14:59] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:14:59] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 3 ms to minimize.
[2024-05-22 00:15:00] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 3 ms to minimize.
[2024-05-22 00:15:00] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:15:00] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 3 ms to minimize.
[2024-05-22 00:15:00] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:15:00] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 3 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 3 ms to minimize.
[2024-05-22 00:15:01] [INFO ] Deduced a trap composed of 25 places in 145 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/487 variables, 20/361 constraints. Problems are: Problem set: 23 solved, 391 unsolved
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 102 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 84 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 110 places in 121 ms of which 3 ms to minimize.
[2024-05-22 00:15:02] [INFO ] Deduced a trap composed of 111 places in 114 ms of which 3 ms to minimize.
[2024-05-22 00:15:03] [INFO ] Deduced a trap composed of 103 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:15:03] [INFO ] Deduced a trap composed of 103 places in 111 ms of which 3 ms to minimize.
[2024-05-22 00:15:03] [INFO ] Deduced a trap composed of 83 places in 102 ms of which 2 ms to minimize.
[2024-05-22 00:15:03] [INFO ] Deduced a trap composed of 82 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:15:03] [INFO ] Deduced a trap composed of 109 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:15:03] [INFO ] Deduced a trap composed of 105 places in 121 ms of which 3 ms to minimize.
SMT process timed out in 60137ms, After SMT, problems are : Problem set: 23 solved, 391 unsolved
Search for dead transitions found 23 dead transitions in 60143ms
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 : 487/517 places, 392/445 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 485 transition count 392
Applied a total of 2 rules in 7 ms. Remains 485 /487 variables (removed 2) and now considering 392/392 (removed 0) transitions.
// Phase 1: matrix 392 rows 485 cols
[2024-05-22 00:15:03] [INFO ] Computed 104 invariants in 3 ms
[2024-05-22 00:15:03] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-05-22 00:15:03] [INFO ] Invariant cache hit.
[2024-05-22 00:15:04] [INFO ] Implicit Places using invariants and state equation in 414 ms returned [85]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 557 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 484/517 places, 392/445 transitions.
Applied a total of 0 rules in 8 ms. Remains 484 /484 variables (removed 0) and now considering 392/392 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 61578 ms. Remains : 484/517 places, 392/445 transitions.
[2024-05-22 00:15:04] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:15:04] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:15:04] [INFO ] Input system was already deterministic with 392 transitions.
[2024-05-22 00:15:04] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:15:04] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:15:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality6111190496811909146.gal : 2 ms
[2024-05-22 00:15:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality6796741951645035111.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/CTLCardinality6111190496811909146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6796741951645035111.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:15:34] [INFO ] Flatten gal took : 21 ms
[2024-05-22 00:15:34] [INFO ] Applying decomposition
[2024-05-22 00:15:34] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10686819717842650211.txt' '-o' '/tmp/graph10686819717842650211.bin' '-w' '/tmp/graph10686819717842650211.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10686819717842650211.bin' '-l' '-1' '-v' '-w' '/tmp/graph10686819717842650211.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:15:34] [INFO ] Decomposing Gal with order
[2024-05-22 00:15:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:15:34] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-22 00:15:34] [INFO ] Flatten gal took : 28 ms
[2024-05-22 00:15:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 7 ms.
[2024-05-22 00:15:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality6414898852595940140.gal : 5 ms
[2024-05-22 00:15:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality11567665364048938710.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/CTLCardinality6414898852595940140.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11567665364048938710.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.68968e+25,0.976528,33708,3773,42,56263,620,1022,92939,64,1502,0


Converting to forward existential form...Done !
original formula: EG((AG((EF(((i16.i2.u127.p428==0)&&(i13.i0.u82.p250==1))) * EF((i16.i2.u126.p427==1)))) * ((i17.u145.p534==1) + AX(EX((i8.i0.u86.p260==0)...160
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !((E(TRUE U ((i16.i2.u127.p428==0)&&(i13.i0.u82.p250==1))) * E(TRUE U (i16.i2.u126.p427==...233
Reverse transition relation is NOT exact ! Due to transitions t6, t169, t181, t263, t275, t284, t373, t374, t376, t377, t385, i0.t177, i0.i0.t173, i0.i0.u7...1353
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
(forward)formula 0,0,4.40104,150132,1,0,300899,674,6979,470660,323,1502,953605
FORMULA BusinessProcesses-PT-15-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Graph (trivial) has 254 edges and 517 vertex of which 6 / 517 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1121 edges and 512 vertex of which 511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 510 transition count 374
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 1 with 63 rules applied. Total rules applied 128 place count 447 transition count 374
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 103 Pre rules applied. Total rules applied 128 place count 447 transition count 271
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 354 place count 324 transition count 271
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 377 place count 301 transition count 248
Iterating global reduction 2 with 23 rules applied. Total rules applied 400 place count 301 transition count 248
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 400 place count 301 transition count 244
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 409 place count 296 transition count 244
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 3 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 241 rules applied. Total rules applied 650 place count 174 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 651 place count 173 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 652 place count 172 transition count 124
Applied a total of 652 rules in 42 ms. Remains 172 /517 variables (removed 345) and now considering 124/445 (removed 321) transitions.
// Phase 1: matrix 124 rows 172 cols
[2024-05-22 00:15:39] [INFO ] Computed 74 invariants in 1 ms
[2024-05-22 00:15:39] [INFO ] Implicit Places using invariants in 107 ms returned [0, 1, 2, 3, 4, 8, 9, 32, 33, 34, 35, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 109 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 151/517 places, 124/445 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 157 ms. Remains : 151/517 places, 124/445 transitions.
[2024-05-22 00:15:39] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:15:39] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:15:39] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-22 00:15:39] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:15:39] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:15:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality10665124165196402724.gal : 1 ms
[2024-05-22 00:15:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality6502458566513958000.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/CTLCardinality10665124165196402724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6502458566513958000.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,16224,0.094824,6756,2,1821,5,10439,6,0,728,7914,0


Converting to forward existential form...Done !
original formula: A(((p194==0)||(p452==1)) U ((p265==1) + AG(!(AG(((p406==0)||(p361==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(((p265==1) + !(E(TRUE U !(!(!(E(TRUE U !(((p406==0)||(p361==1)))))))))))))) * !(E(!(((p265==1) ...336
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t27, t30, t31, t32, t33, t54, t55, t56, t57, t58, t74, t77, t78, t79, t95, t99, t100,...268
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.3878,51268,1,0,463,248452,255,294,5547,226110,508
FORMULA BusinessProcesses-PT-15-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 496 transition count 424
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 496 transition count 424
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 490 transition count 418
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 490 transition count 418
Applied a total of 54 rules in 20 ms. Remains 490 /517 variables (removed 27) and now considering 418/445 (removed 27) transitions.
// Phase 1: matrix 418 rows 490 cols
[2024-05-22 00:15:40] [INFO ] Computed 99 invariants in 5 ms
[2024-05-22 00:15:40] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 00:15:40] [INFO ] Invariant cache hit.
[2024-05-22 00:15:41] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
Running 417 sub problems to find dead transitions.
[2024-05-22 00:15:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/490 variables, 56/95 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/490 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 72 places in 99 ms of which 3 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 70 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 83 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 92 places in 86 ms of which 3 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:15:49] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 1 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 89 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 93 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:15:50] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 102 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:15:51] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 92 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 56 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 50 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 87 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:15:52] [INFO ] Deduced a trap composed of 91 places in 81 ms of which 2 ms to minimize.
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/490 variables, 20/139 constraints. Problems are: Problem set: 11 solved, 406 unsolved
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 98 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 98 places in 86 ms of which 3 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 89 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 93 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 92 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 94 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:15:53] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 89 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 76 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 88 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 84 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:15:54] [INFO ] Deduced a trap composed of 93 places in 83 ms of which 2 ms to minimize.
Problem TDEAD351 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD384 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 20/159 constraints. Problems are: Problem set: 18 solved, 399 unsolved
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 26 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 97 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:15:57] [INFO ] Deduced a trap composed of 95 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 94 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:15:58] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 89 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 95 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 91 places in 86 ms of which 2 ms to minimize.
Problem TDEAD371 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 20/179 constraints. Problems are: Problem set: 19 solved, 398 unsolved
[2024-05-22 00:15:59] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 88 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 91 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 91 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 94 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 87 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:16:00] [INFO ] Deduced a trap composed of 84 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 91 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 96 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 85 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:16:01] [INFO ] Deduced a trap composed of 90 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 20/199 constraints. Problems are: Problem set: 19 solved, 398 unsolved
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 91 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 43 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 93 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:16:02] [INFO ] Deduced a trap composed of 89 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 92 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:16:03] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 3 ms to minimize.
[2024-05-22 00:16:04] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:16:05] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:16:05] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:16:05] [INFO ] Deduced a trap composed of 66 places in 106 ms of which 3 ms to minimize.
[2024-05-22 00:16:05] [INFO ] Deduced a trap composed of 49 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 20/219 constraints. Problems are: Problem set: 19 solved, 398 unsolved
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 4 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 96 places in 115 ms of which 2 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:16:09] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 89 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 3 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:16:10] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-05-22 00:16:11] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
SMT process timed out in 30096ms, After SMT, problems are : Problem set: 19 solved, 398 unsolved
Search for dead transitions found 19 dead transitions in 30101ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 490/517 places, 399/445 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 489 transition count 399
Applied a total of 1 rules in 9 ms. Remains 489 /490 variables (removed 1) and now considering 399/399 (removed 0) transitions.
// Phase 1: matrix 399 rows 489 cols
[2024-05-22 00:16:11] [INFO ] Computed 101 invariants in 3 ms
[2024-05-22 00:16:11] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 00:16:11] [INFO ] Invariant cache hit.
[2024-05-22 00:16:11] [INFO ] Implicit Places using invariants and state equation in 395 ms returned [89, 90]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 568 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 487/517 places, 399/445 transitions.
Applied a total of 0 rules in 6 ms. Remains 487 /487 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 31339 ms. Remains : 487/517 places, 399/445 transitions.
[2024-05-22 00:16:11] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:16:11] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:16:11] [INFO ] Input system was already deterministic with 399 transitions.
[2024-05-22 00:16:11] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:16:11] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:16:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality10977342379960617042.gal : 2 ms
[2024-05-22 00:16:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality10088848502091820108.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/CTLCardinality10977342379960617042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10088848502091820108.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:16:42] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:16:42] [INFO ] Applying decomposition
[2024-05-22 00:16:42] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4627245683674628766.txt' '-o' '/tmp/graph4627245683674628766.bin' '-w' '/tmp/graph4627245683674628766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4627245683674628766.bin' '-l' '-1' '-v' '-w' '/tmp/graph4627245683674628766.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:16:42] [INFO ] Decomposing Gal with order
[2024-05-22 00:16:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:16:42] [INFO ] Removed a total of 140 redundant transitions.
[2024-05-22 00:16:42] [INFO ] Flatten gal took : 27 ms
[2024-05-22 00:16:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 7 ms.
[2024-05-22 00:16:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality2354060698094563425.gal : 6 ms
[2024-05-22 00:16:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality17520170337215827553.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/CTLCardinality2354060698094563425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17520170337215827553.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,5.43043e+25,1.34661,46852,4710,40,73655,462,1042,219395,59,1257,0


Converting to forward existential form...Done !
original formula: EG(E((EF(((i17.i1.u102.p293==0)||(i13.i0.u120.p381==1))) * (((EX((i18.u136.p464==1)) * AG(((i7.u26.p69==0)||(i15.u98.p283==1)))) + (((i1....339
=> equivalent forward existential formula: [FwdG(Init,E((E(TRUE U ((i17.i1.u102.p293==0)||(i13.i0.u120.p381==1))) * (((EX((i18.u136.p464==1)) * !(E(TRUE U ...406
Reverse transition relation is NOT exact ! Due to transitions t6, t9, t168, t176, t262, t274, t287, t380, t383, t384, t392, i0.i0.t172, i0.i0.u78.t179, i0....1343
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Graph (trivial) has 253 edges and 517 vertex of which 6 / 517 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1121 edges and 512 vertex of which 511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 510 transition count 375
Reduce places removed 62 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 448 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 446 transition count 373
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 130 place count 446 transition count 272
Deduced a syphon composed of 101 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 3 with 221 rules applied. Total rules applied 351 place count 326 transition count 272
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 374 place count 303 transition count 249
Iterating global reduction 3 with 23 rules applied. Total rules applied 397 place count 303 transition count 249
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 397 place count 303 transition count 245
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 406 place count 298 transition count 245
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 649 place count 175 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 650 place count 174 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 651 place count 173 transition count 124
Applied a total of 651 rules in 34 ms. Remains 173 /517 variables (removed 344) and now considering 124/445 (removed 321) transitions.
// Phase 1: matrix 124 rows 173 cols
[2024-05-22 00:17:12] [INFO ] Computed 75 invariants in 2 ms
[2024-05-22 00:17:12] [INFO ] Implicit Places using invariants in 138 ms returned [0, 1, 2, 3, 4, 10, 33, 34, 35, 36, 41, 42, 43, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 139 ms to find 21 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 152/517 places, 124/445 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 177 ms. Remains : 152/517 places, 124/445 transitions.
[2024-05-22 00:17:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:17:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:17:12] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-22 00:17:12] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:17:12] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:17:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality11879187798672432337.gal : 1 ms
[2024-05-22 00:17:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality2115790935809949036.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/CTLCardinality11879187798672432337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2115790935809949036.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,16941,0.097315,7028,2,1864,5,10865,6,0,732,7843,0


Converting to forward existential form...Done !
original formula: AF((EF((p384==1)) + ((p587==0)&&(p82==1))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U (p384==1)) + ((p587==0)&&(p82==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t24, t25, t27, t28, t29, t30, t31, t32, t33, t53, t54, t55, t56, t57, t72, t76, t77, t78, t95...279
(forward)formula 0,1,0.637849,25948,1,0,185,88178,250,96,5343,54666,238
FORMULA BusinessProcesses-PT-15-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 517/517 places, 445/445 transitions.
Graph (trivial) has 240 edges and 517 vertex of which 6 / 517 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1121 edges and 512 vertex of which 511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 510 transition count 378
Reduce places removed 59 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 61 rules applied. Total rules applied 122 place count 451 transition count 376
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 124 place count 449 transition count 376
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 94 Pre rules applied. Total rules applied 124 place count 449 transition count 282
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 328 place count 339 transition count 282
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 347 place count 320 transition count 263
Iterating global reduction 3 with 19 rules applied. Total rules applied 366 place count 320 transition count 263
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 366 place count 320 transition count 261
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 371 place count 317 transition count 261
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 613 place count 195 transition count 141
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 614 place count 194 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 615 place count 193 transition count 140
Applied a total of 615 rules in 62 ms. Remains 193 /517 variables (removed 324) and now considering 140/445 (removed 305) transitions.
// Phase 1: matrix 140 rows 193 cols
[2024-05-22 00:17:13] [INFO ] Computed 79 invariants in 2 ms
[2024-05-22 00:17:13] [INFO ] Implicit Places using invariants in 150 ms returned [4, 7, 59, 63, 66, 156, 168]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 151 ms to find 7 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 186/517 places, 140/445 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 216 ms. Remains : 186/517 places, 140/445 transitions.
[2024-05-22 00:17:13] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:17:13] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:17:13] [INFO ] Input system was already deterministic with 140 transitions.
[2024-05-22 00:17:13] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:17:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:17:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality12001538401724700518.gal : 1 ms
[2024-05-22 00:17:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality5882093582634200477.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/CTLCardinality12001538401724700518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5882093582634200477.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,139590,0.125871,9068,2,3099,5,17420,6,0,881,13349,0


Converting to forward existential form...Done !
original formula: E((p107==0) U E((((p586==1)||(p8==0))||((p476==1)||(p569==1))) U ((!(((((p487==0)||(p295==1))&&(p294==0))&&((p358==0)||(p356==1)))) * !(A...225
=> equivalent forward existential formula: [(FwdU((FwdU(FwdU(Init,(p107==0)),(((p586==1)||(p8==0))||((p476==1)||(p569==1)))) * (!(((((p487==0)||(p295==1))&...326
Reverse transition relation is NOT exact ! Due to transitions t0, t10, t12, t14, t19, t48, t49, t51, t52, t53, t54, t55, t57, t77, t78, t79, t80, t81, t87,...295
Hit Full ! (commute/partial/dont) 138/0/2
Hit Full ! (commute/partial/dont) 131/0/9
(forward)formula 0,1,2.83031,99432,1,0,495,483859,299,260,6629,389030,600
FORMULA BusinessProcesses-PT-15-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-22 00:17:16] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:17:16] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:17:16] [INFO ] Applying decomposition
[2024-05-22 00:17:16] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14771412321892177416.txt' '-o' '/tmp/graph14771412321892177416.bin' '-w' '/tmp/graph14771412321892177416.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14771412321892177416.bin' '-l' '-1' '-v' '-w' '/tmp/graph14771412321892177416.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:17:16] [INFO ] Decomposing Gal with order
[2024-05-22 00:17:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:17:16] [INFO ] Removed a total of 216 redundant transitions.
[2024-05-22 00:17:16] [INFO ] Flatten gal took : 19 ms
[2024-05-22 00:17:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 00:17:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality8205608146029672290.gal : 3 ms
[2024-05-22 00:17:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality229257093380842517.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/CTLCardinality8205608146029672290.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality229257093380842517.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 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.99339e+25,2.69875,79080,6711,62,127464,757,1160,309119,74,2494,0


Converting to forward existential form...Done !
original formula: EX(A(AF(!(EX(((i0.i1.u145.p466==0)||(i7.i2.u92.p269==1))))) U EF(((((i17.u171.p583==0)&&(i3.i1.u137.p429!=1))&&((i17.u141.p452==1)&&((i10...244
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(E(TRUE U ((((i17.u171.p583==0)&&(i3.i1.u137.p429!=1))&&((i17.u141.p452==1)&&((i10.i1.u115.p...669
Reverse transition relation is NOT exact ! Due to transitions t6, t7, t8, t9, t41, t189, t193, t209, t304, t426, t429, i0.t313, i0.i0.u16.t316, i0.i1.u14.t...1661
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 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 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
Detected timeout of ITS tools.
[2024-05-22 00:41:59] [INFO ] Applying decomposition
[2024-05-22 00:41:59] [INFO ] Flatten gal took : 23 ms
[2024-05-22 00:41:59] [INFO ] Decomposing Gal with order
[2024-05-22 00:41:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:41:59] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-22 00:41:59] [INFO ] Flatten gal took : 29 ms
[2024-05-22 00:41:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 212 labels/synchronizations in 112 ms.
[2024-05-22 00:41:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality10068928013641917376.gal : 21 ms
[2024-05-22 00:41:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality14665333711224337377.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/CTLCardinality10068928013641917376.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14665333711224337377.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 4 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 00:48:03] [INFO ] Flatten gal took : 26 ms
[2024-05-22 00:48:03] [INFO ] Input system was already deterministic with 445 transitions.
[2024-05-22 00:48:03] [INFO ] Transformed 517 places.
[2024-05-22 00:48:03] [INFO ] Transformed 445 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:48:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality12627153772675263641.gal : 4 ms
[2024-05-22 00:48:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality17563066217734334374.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/CTLCardinality12627153772675263641.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17563066217734334374.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 4 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3422986 ms.

BK_STOP 1716339607405

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

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