Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r576-smll-171734920100138.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is MedleyA-PT-18, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920100138
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 158K Jun 2 16:33 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 MedleyA-PT-18-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-18-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717376707282

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-06-03 01:05:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-03 01:05:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 01:05:10] [INFO ] Load time of PNML (sax parser for PT used): 359 ms
[2024-06-03 01:05:10] [INFO ] Transformed 252 places.
[2024-06-03 01:05:10] [INFO ] Transformed 543 transitions.
[2024-06-03 01:05:10] [INFO ] Found NUPN structural information;
[2024-06-03 01:05:10] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 605 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 103 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 541/541 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 225 transition count 500
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 225 transition count 500
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 223 transition count 498
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 223 transition count 498
Applied a total of 58 rules in 100 ms. Remains 223 /252 variables (removed 29) and now considering 498/541 (removed 43) transitions.
// Phase 1: matrix 498 rows 223 cols
[2024-06-03 01:05:10] [INFO ] Computed 7 invariants in 53 ms
[2024-06-03 01:05:10] [INFO ] Implicit Places using invariants in 479 ms returned []
[2024-06-03 01:05:10] [INFO ] Invariant cache hit.
[2024-06-03 01:05:11] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
Running 497 sub problems to find dead transitions.
[2024-06-03 01:05:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 497 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-03 01:05:21] [INFO ] Deduced a trap composed of 14 places in 308 ms of which 39 ms to minimize.
[2024-06-03 01:05:21] [INFO ] Deduced a trap composed of 15 places in 271 ms of which 3 ms to minimize.
[2024-06-03 01:05:21] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 3 ms to minimize.
[2024-06-03 01:05:21] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-03 01:05:21] [INFO ] Deduced a trap composed of 46 places in 175 ms of which 2 ms to minimize.
[2024-06-03 01:05:22] [INFO ] Deduced a trap composed of 44 places in 250 ms of which 3 ms to minimize.
[2024-06-03 01:05:22] [INFO ] Deduced a trap composed of 31 places in 294 ms of which 4 ms to minimize.
[2024-06-03 01:05:22] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 3 ms to minimize.
[2024-06-03 01:05:22] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 2 ms to minimize.
[2024-06-03 01:05:22] [INFO ] Deduced a trap composed of 34 places in 193 ms of which 4 ms to minimize.
[2024-06-03 01:05:23] [INFO ] Deduced a trap composed of 41 places in 323 ms of which 4 ms to minimize.
[2024-06-03 01:05:23] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 2 ms to minimize.
[2024-06-03 01:05:23] [INFO ] Deduced a trap composed of 131 places in 179 ms of which 8 ms to minimize.
[2024-06-03 01:05:23] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2024-06-03 01:05:23] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 2 ms to minimize.
[2024-06-03 01:05:24] [INFO ] Deduced a trap composed of 37 places in 135 ms of which 2 ms to minimize.
[2024-06-03 01:05:25] [INFO ] Deduced a trap composed of 39 places in 196 ms of which 3 ms to minimize.
[2024-06-03 01:05:25] [INFO ] Deduced a trap composed of 147 places in 194 ms of which 3 ms to minimize.
[2024-06-03 01:05:25] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-06-03 01:05:26] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-03 01:05:26] [INFO ] Deduced a trap composed of 32 places in 100 ms of which 1 ms to minimize.
[2024-06-03 01:05:26] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2024-06-03 01:05:26] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 2 ms to minimize.
[2024-06-03 01:05:26] [INFO ] Deduced a trap composed of 132 places in 115 ms of which 2 ms to minimize.
[2024-06-03 01:05:26] [INFO ] Deduced a trap composed of 118 places in 183 ms of which 4 ms to minimize.
[2024-06-03 01:05:28] [INFO ] Deduced a trap composed of 35 places in 318 ms of which 4 ms to minimize.
[2024-06-03 01:05:29] [INFO ] Deduced a trap composed of 28 places in 315 ms of which 4 ms to minimize.
[2024-06-03 01:05:29] [INFO ] Deduced a trap composed of 24 places in 314 ms of which 4 ms to minimize.
[2024-06-03 01:05:29] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 4 ms to minimize.
[2024-06-03 01:05:30] [INFO ] Deduced a trap composed of 38 places in 231 ms of which 3 ms to minimize.
[2024-06-03 01:05:30] [INFO ] Deduced a trap composed of 36 places in 308 ms of which 3 ms to minimize.
[2024-06-03 01:05:30] [INFO ] Deduced a trap composed of 39 places in 297 ms of which 3 ms to minimize.
[2024-06-03 01:05:31] [INFO ] Deduced a trap composed of 26 places in 301 ms of which 5 ms to minimize.
[2024-06-03 01:05:31] [INFO ] Deduced a trap composed of 25 places in 283 ms of which 4 ms to minimize.
[2024-06-03 01:05:31] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 6 ms to minimize.
[2024-06-03 01:05:32] [INFO ] Deduced a trap composed of 28 places in 316 ms of which 5 ms to minimize.
[2024-06-03 01:05:32] [INFO ] Deduced a trap composed of 35 places in 320 ms of which 4 ms to minimize.
[2024-06-03 01:05:32] [INFO ] Deduced a trap composed of 30 places in 317 ms of which 4 ms to minimize.
[2024-06-03 01:05:33] [INFO ] Deduced a trap composed of 36 places in 313 ms of which 4 ms to minimize.
[2024-06-03 01:05:33] [INFO ] Deduced a trap composed of 26 places in 306 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 497 unsolved
[2024-06-03 01:05:38] [INFO ] Deduced a trap composed of 49 places in 273 ms of which 3 ms to minimize.
[2024-06-03 01:05:38] [INFO ] Deduced a trap composed of 42 places in 270 ms of which 3 ms to minimize.
[2024-06-03 01:05:40] [INFO ] Deduced a trap composed of 30 places in 333 ms of which 4 ms to minimize.
[2024-06-03 01:05:40] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 2 ms to minimize.
[2024-06-03 01:05:40] [INFO ] Deduced a trap composed of 24 places in 178 ms of which 3 ms to minimize.
[2024-06-03 01:05:40] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 3 ms to minimize.
[2024-06-03 01:05:41] [INFO ] Deduced a trap composed of 27 places in 157 ms of which 2 ms to minimize.
[2024-06-03 01:05:41] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
[2024-06-03 01:05:41] [INFO ] Deduced a trap composed of 54 places in 177 ms of which 2 ms to minimize.
[2024-06-03 01:05:41] [INFO ] Deduced a trap composed of 120 places in 196 ms of which 3 ms to minimize.
[2024-06-03 01:05:41] [INFO ] Deduced a trap composed of 24 places in 213 ms of which 5 ms to minimize.
[2024-06-03 01:05:42] [INFO ] Deduced a trap composed of 140 places in 300 ms of which 4 ms to minimize.
[2024-06-03 01:05:42] [INFO ] Deduced a trap composed of 49 places in 297 ms of which 4 ms to minimize.
[2024-06-03 01:05:42] [INFO ] Deduced a trap composed of 23 places in 298 ms of which 4 ms to minimize.
SMT process timed out in 31284ms, After SMT, problems are : Problem set: 0 solved, 497 unsolved
Search for dead transitions found 0 dead transitions in 31349ms
Starting structural reductions in LTL mode, iteration 1 : 223/252 places, 498/541 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32574 ms. Remains : 223/252 places, 498/541 transitions.
Support contains 103 out of 223 places after structural reductions.
[2024-06-03 01:05:43] [INFO ] Flatten gal took : 182 ms
[2024-06-03 01:05:43] [INFO ] Flatten gal took : 101 ms
[2024-06-03 01:05:43] [INFO ] Input system was already deterministic with 498 transitions.
Reduction of identical properties reduced properties to check from 79 to 78
RANDOM walk for 40000 steps (1527 resets) in 3521 ms. (11 steps per ms) remains 67/78 properties
BEST_FIRST walk for 4003 steps (33 resets) in 41 ms. (95 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (35 resets) in 66 ms. (59 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 51 ms. (76 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (32 resets) in 48 ms. (81 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (32 resets) in 36 ms. (108 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 67 ms. (58 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (32 resets) in 45 ms. (87 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 40 ms. (97 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (34 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (33 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (32 resets) in 25 ms. (154 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 31 ms. (125 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (35 resets) in 41 ms. (95 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 28 ms. (138 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (34 resets) in 30 ms. (129 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (32 resets) in 27 ms. (142 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 31 ms. (125 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (34 resets) in 21 ms. (182 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (36 resets) in 26 ms. (148 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (32 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (35 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (35 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (34 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (33 resets) in 34 ms. (114 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (33 resets) in 25 ms. (153 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (33 resets) in 20 ms. (190 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (32 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 27 ms. (142 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (33 resets) in 16 ms. (235 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 14 ms. (266 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (33 resets) in 24 ms. (160 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (33 resets) in 32 ms. (121 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4001 steps (34 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (33 resets) in 23 ms. (166 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4004 steps (35 resets) in 15 ms. (250 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4003 steps (34 resets) in 17 ms. (222 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (35 resets) in 22 ms. (174 steps per ms) remains 67/67 properties
BEST_FIRST walk for 4002 steps (34 resets) in 19 ms. (200 steps per ms) remains 67/67 properties
[2024-06-03 01:05:45] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 1 (OVERLAPS) 132/223 variables, 7/7 constraints. Problems are: Problem set: 6 solved, 61 unsolved
[2024-06-03 01:05:46] [INFO ] Deduced a trap composed of 49 places in 243 ms of which 3 ms to minimize.
[2024-06-03 01:05:46] [INFO ] Deduced a trap composed of 24 places in 151 ms of which 2 ms to minimize.
[2024-06-03 01:05:47] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 6 ms to minimize.
[2024-06-03 01:05:47] [INFO ] Deduced a trap composed of 25 places in 174 ms of which 2 ms to minimize.
[2024-06-03 01:05:47] [INFO ] Deduced a trap composed of 37 places in 158 ms of which 2 ms to minimize.
[2024-06-03 01:05:47] [INFO ] Deduced a trap composed of 143 places in 172 ms of which 3 ms to minimize.
[2024-06-03 01:05:47] [INFO ] Deduced a trap composed of 142 places in 177 ms of which 3 ms to minimize.
[2024-06-03 01:05:47] [INFO ] Deduced a trap composed of 26 places in 167 ms of which 3 ms to minimize.
[2024-06-03 01:05:48] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 2 ms to minimize.
[2024-06-03 01:05:48] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 2 ms to minimize.
[2024-06-03 01:05:48] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2024-06-03 01:05:48] [INFO ] Deduced a trap composed of 118 places in 139 ms of which 3 ms to minimize.
[2024-06-03 01:05:48] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-03 01:05:48] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-03 01:05:48] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-06-03 01:05:49] [INFO ] Deduced a trap composed of 37 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 16/23 constraints. Problems are: Problem set: 6 solved, 61 unsolved
[2024-06-03 01:05:49] [INFO ] Deduced a trap composed of 35 places in 130 ms of which 2 ms to minimize.
[2024-06-03 01:05:49] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2024-06-03 01:05:49] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 3/26 constraints. Problems are: Problem set: 6 solved, 61 unsolved
[2024-06-03 01:05:50] [INFO ] Deduced a trap composed of 140 places in 194 ms of which 3 ms to minimize.
[2024-06-03 01:05:50] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 2 ms to minimize.
[2024-06-03 01:05:50] [INFO ] Deduced a trap composed of 137 places in 205 ms of which 2 ms to minimize.
SMT process timed out in 5274ms, After SMT, problems are : Problem set: 6 solved, 61 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 82 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 498/498 transitions.
Graph (trivial) has 81 edges and 223 vertex of which 4 / 223 are part of one of the 1 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 220 transition count 475
Reduce places removed 19 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 29 rules applied. Total rules applied 49 place count 201 transition count 465
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 61 place count 191 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 62 place count 190 transition count 463
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 62 place count 190 transition count 456
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 76 place count 183 transition count 456
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 79 place count 180 transition count 450
Iterating global reduction 4 with 3 rules applied. Total rules applied 82 place count 180 transition count 450
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 120 place count 161 transition count 431
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 160 transition count 429
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 160 transition count 429
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 123 place count 159 transition count 427
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 159 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 130 place count 156 transition count 433
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 141 place count 156 transition count 422
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 145 place count 152 transition count 418
Iterating global reduction 4 with 4 rules applied. Total rules applied 149 place count 152 transition count 418
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 151 place count 151 transition count 423
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 156 place count 151 transition count 418
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 161 place count 146 transition count 418
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 162 place count 145 transition count 416
Iterating global reduction 5 with 1 rules applied. Total rules applied 163 place count 145 transition count 416
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 164 place count 145 transition count 416
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 145 transition count 415
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 166 place count 144 transition count 414
Applied a total of 166 rules in 305 ms. Remains 144 /223 variables (removed 79) and now considering 414/498 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 144/223 places, 414/498 transitions.
RANDOM walk for 40000 steps (2647 resets) in 840 ms. (47 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (56 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (57 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (54 resets) in 21 ms. (182 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (57 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (57 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (56 resets) in 28 ms. (138 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (55 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (56 resets) in 39 ms. (100 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (56 resets) in 52 ms. (75 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (54 resets) in 52 ms. (75 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (57 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (55 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (56 resets) in 34 ms. (114 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (56 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (56 resets) in 33 ms. (117 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (59 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (55 resets) in 28 ms. (138 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (56 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (59 resets) in 23 ms. (166 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (57 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (52 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (58 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (54 resets) in 29 ms. (133 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (57 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (56 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (54 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (60 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (57 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (57 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (57 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (55 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (59 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (58 resets) in 22 ms. (174 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (52 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (57 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (56 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (60 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (55 resets) in 21 ms. (181 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (58 resets) in 17 ms. (222 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (55 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (57 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4002 steps (56 resets) in 19 ms. (200 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (57 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (60 resets) in 20 ms. (190 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (55 resets) in 18 ms. (210 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (56 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4004 steps (54 resets) in 16 ms. (235 steps per ms) remains 61/61 properties
BEST_FIRST walk for 4003 steps (55 resets) in 14 ms. (266 steps per ms) remains 61/61 properties
Interrupted probabilistic random walk after 364101 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :44 out of 61
Probabilistic random walk after 364101 steps, saw 62494 distinct states, run finished after 3006 ms. (steps per millisecond=121 ) properties seen :44
[2024-06-03 01:05:54] [INFO ] Flow matrix only has 412 transitions (discarded 2 similar events)
// Phase 1: matrix 412 rows 144 cols
[2024-06-03 01:05:54] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 01:05:54] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 109/144 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-03 01:05:55] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-06-03 01:05:55] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 23 ms to minimize.
Problem AtomicPropp43 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-06-03 01:05:55] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 2 ms to minimize.
[2024-06-03 01:05:55] [INFO ] Deduced a trap composed of 14 places in 183 ms of which 3 ms to minimize.
[2024-06-03 01:05:55] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 2 ms to minimize.
[2024-06-03 01:05:56] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 2 ms to minimize.
[2024-06-03 01:05:56] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 2 ms to minimize.
[2024-06-03 01:05:56] [INFO ] Deduced a trap composed of 29 places in 180 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 6/15 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-06-03 01:05:56] [INFO ] Deduced a trap composed of 14 places in 145 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 412/556 variables, 144/160 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 6/166 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/556 variables, 0/166 constraints. Problems are: Problem set: 1 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 166 constraints, problems are : Problem set: 1 solved, 16 unsolved in 2586 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 1 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 111/144 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 9/16 constraints. Problems are: Problem set: 1 solved, 16 unsolved
[2024-06-03 01:05:57] [INFO ] Deduced a trap composed of 25 places in 125 ms of which 2 ms to minimize.
[2024-06-03 01:05:57] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-06-03 01:05:57] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-03 01:05:58] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2024-06-03 01:05:58] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2024-06-03 01:05:58] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 1 ms to minimize.
[2024-06-03 01:05:58] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 1 ms to minimize.
[2024-06-03 01:05:58] [INFO ] Deduced a trap composed of 30 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/144 variables, 8/24 constraints. Problems are: Problem set: 1 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 5 (OVERLAPS) 412/556 variables, 144/168 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 6/174 constraints. Problems are: Problem set: 5 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 12/186 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-06-03 01:06:29] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-06-03 01:06:32] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 2/188 constraints. Problems are: Problem set: 5 solved, 12 unsolved
[2024-06-03 01:06:42] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/556 variables, and 189 constraints, problems are : Problem set: 5 solved, 12 unsolved in 45008 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 12/17 constraints, Known Traps: 20/20 constraints]
After SMT, in 47650ms problems are : Problem set: 5 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 414/414 transitions.
Graph (trivial) has 89 edges and 144 vertex of which 2 / 144 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 143 transition count 404
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 135 transition count 403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 134 transition count 403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 19 place count 134 transition count 400
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 25 place count 131 transition count 400
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 41 place count 115 transition count 372
Iterating global reduction 3 with 16 rules applied. Total rules applied 57 place count 115 transition count 372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 57 place count 115 transition count 371
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 114 transition count 371
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 113 transition count 369
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 113 transition count 369
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 75 place count 106 transition count 362
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 104 transition count 356
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 104 transition count 356
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 103 transition count 354
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 103 transition count 354
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 91 place count 98 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 99 place count 98 transition count 352
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 97 transition count 348
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 97 transition count 348
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 96 transition count 346
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 96 transition count 346
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -33
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 109 place count 93 transition count 379
Free-agglomeration rule applied 17 times with reduction of 4 identical transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 126 place count 93 transition count 358
Reduce places removed 17 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 155 place count 76 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 166 place count 76 transition count 335
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 167 place count 76 transition count 334
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 168 place count 75 transition count 334
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 170 place count 75 transition count 332
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 173 place count 75 transition count 336
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 180 place count 72 transition count 332
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 182 place count 72 transition count 330
Applied a total of 182 rules in 143 ms. Remains 72 /144 variables (removed 72) and now considering 330/414 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 145 ms. Remains : 72/144 places, 330/414 transitions.
RANDOM walk for 40000 steps (3543 resets) in 238 ms. (167 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40002 steps (853 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (878 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (853 resets) in 82 ms. (481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (900 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (190 resets) in 162 ms. (245 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (970 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (822 resets) in 83 ms. (476 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (884 resets) in 66 ms. (597 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (911 resets) in 49 ms. (800 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (906 resets) in 49 ms. (800 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (821 resets) in 49 ms. (800 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 1165587 steps, run timeout after 3001 ms. (steps per millisecond=388 ) properties seen :10 out of 11
Probabilistic random walk after 1165587 steps, saw 216497 distinct states, run finished after 3001 ms. (steps per millisecond=388 ) properties seen :10
[2024-06-03 01:06:46] [INFO ] Flow matrix only has 308 transitions (discarded 22 similar events)
// Phase 1: matrix 308 rows 72 cols
[2024-06-03 01:06:46] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:06:46] [INFO ] State equation strengthened by 16 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/36 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 281/317 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/380 variables, 36/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/380 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 16/16 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) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 11/36 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 281/317 variables, 36/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/317 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/380 variables, 36/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 4/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/380 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 72/72 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 403ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 330/330 transitions.
Graph (trivial) has 48 edges and 72 vertex of which 2 / 72 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 71 transition count 321
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 64 transition count 321
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 64 transition count 319
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 61 transition count 289
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 61 transition count 289
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 60 transition count 288
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 58 transition count 294
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 58 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 58 transition count 286
Free-agglomeration rule applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 49 place count 58 transition count 274
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 71 place count 46 transition count 264
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 46 transition count 352
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 75 place count 44 transition count 352
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 44 transition count 350
Applied a total of 77 rules in 82 ms. Remains 44 /72 variables (removed 28) and now considering 350/330 (removed -20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 44/72 places, 350/330 transitions.
RANDOM walk for 30046 steps (32 resets) in 504 ms. (59 steps per ms) remains 0/1 properties
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA MedleyA-PT-18-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-03 01:06:46] [INFO ] Flatten gal took : 49 ms
[2024-06-03 01:06:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA MedleyA-PT-18-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-03 01:06:46] [INFO ] Flatten gal took : 47 ms
[2024-06-03 01:06:47] [INFO ] Input system was already deterministic with 498 transitions.
Support contains 80 out of 223 places (down from 89) after GAL structural reductions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 204 transition count 464
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 204 transition count 464
Applied a total of 38 rules in 7 ms. Remains 204 /223 variables (removed 19) and now considering 464/498 (removed 34) transitions.
// Phase 1: matrix 464 rows 204 cols
[2024-06-03 01:06:47] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:06:47] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-06-03 01:06:47] [INFO ] Invariant cache hit.
[2024-06-03 01:06:47] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2024-06-03 01:06:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:06:52] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 2 ms to minimize.
[2024-06-03 01:06:52] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 1 ms to minimize.
[2024-06-03 01:06:53] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2024-06-03 01:06:53] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-06-03 01:06:53] [INFO ] Deduced a trap composed of 125 places in 132 ms of which 2 ms to minimize.
[2024-06-03 01:06:53] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 3 ms to minimize.
[2024-06-03 01:06:53] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 2 ms to minimize.
[2024-06-03 01:06:53] [INFO ] Deduced a trap composed of 114 places in 174 ms of which 2 ms to minimize.
[2024-06-03 01:06:54] [INFO ] Deduced a trap composed of 120 places in 153 ms of which 2 ms to minimize.
[2024-06-03 01:06:54] [INFO ] Deduced a trap composed of 125 places in 181 ms of which 2 ms to minimize.
[2024-06-03 01:06:55] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 2 ms to minimize.
[2024-06-03 01:06:55] [INFO ] Deduced a trap composed of 24 places in 172 ms of which 2 ms to minimize.
[2024-06-03 01:06:55] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 2 ms to minimize.
[2024-06-03 01:06:55] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 2 ms to minimize.
[2024-06-03 01:06:55] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 3 ms to minimize.
[2024-06-03 01:06:56] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 2 ms to minimize.
[2024-06-03 01:06:56] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 2 ms to minimize.
[2024-06-03 01:06:56] [INFO ] Deduced a trap composed of 22 places in 173 ms of which 2 ms to minimize.
[2024-06-03 01:06:56] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 2 ms to minimize.
[2024-06-03 01:06:56] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:06:57] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 2 ms to minimize.
[2024-06-03 01:06:57] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 2 ms to minimize.
[2024-06-03 01:06:58] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 3 ms to minimize.
[2024-06-03 01:06:58] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 3 ms to minimize.
[2024-06-03 01:06:58] [INFO ] Deduced a trap composed of 40 places in 185 ms of which 2 ms to minimize.
[2024-06-03 01:06:59] [INFO ] Deduced a trap composed of 32 places in 187 ms of which 2 ms to minimize.
[2024-06-03 01:06:59] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 3 ms to minimize.
[2024-06-03 01:06:59] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 2 ms to minimize.
[2024-06-03 01:06:59] [INFO ] Deduced a trap composed of 39 places in 170 ms of which 2 ms to minimize.
[2024-06-03 01:06:59] [INFO ] Deduced a trap composed of 20 places in 180 ms of which 2 ms to minimize.
[2024-06-03 01:07:00] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 2 ms to minimize.
[2024-06-03 01:07:00] [INFO ] Deduced a trap composed of 35 places in 176 ms of which 2 ms to minimize.
[2024-06-03 01:07:00] [INFO ] Deduced a trap composed of 115 places in 174 ms of which 2 ms to minimize.
[2024-06-03 01:07:00] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 2 ms to minimize.
[2024-06-03 01:07:00] [INFO ] Deduced a trap composed of 23 places in 179 ms of which 2 ms to minimize.
[2024-06-03 01:07:01] [INFO ] Deduced a trap composed of 24 places in 174 ms of which 3 ms to minimize.
[2024-06-03 01:07:01] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 3 ms to minimize.
[2024-06-03 01:07:01] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 2 ms to minimize.
[2024-06-03 01:07:01] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 2 ms to minimize.
[2024-06-03 01:07:01] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:07:05] [INFO ] Deduced a trap composed of 138 places in 170 ms of which 2 ms to minimize.
[2024-06-03 01:07:05] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 2 ms to minimize.
[2024-06-03 01:07:05] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 2 ms to minimize.
[2024-06-03 01:07:05] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2024-06-03 01:07:06] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 2 ms to minimize.
[2024-06-03 01:07:06] [INFO ] Deduced a trap composed of 24 places in 186 ms of which 2 ms to minimize.
[2024-06-03 01:07:06] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 4 ms to minimize.
[2024-06-03 01:07:06] [INFO ] Deduced a trap composed of 26 places in 175 ms of which 2 ms to minimize.
[2024-06-03 01:07:06] [INFO ] Deduced a trap composed of 26 places in 177 ms of which 3 ms to minimize.
[2024-06-03 01:07:06] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 2 ms to minimize.
[2024-06-03 01:07:07] [INFO ] Deduced a trap composed of 41 places in 188 ms of which 3 ms to minimize.
[2024-06-03 01:07:08] [INFO ] Deduced a trap composed of 39 places in 134 ms of which 2 ms to minimize.
[2024-06-03 01:07:08] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:07:09] [INFO ] Deduced a trap composed of 24 places in 165 ms of which 3 ms to minimize.
[2024-06-03 01:07:09] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 3 ms to minimize.
[2024-06-03 01:07:10] [INFO ] Deduced a trap composed of 42 places in 264 ms of which 3 ms to minimize.
[2024-06-03 01:07:10] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 2 ms to minimize.
[2024-06-03 01:07:11] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 2 ms to minimize.
[2024-06-03 01:07:11] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 2 ms to minimize.
[2024-06-03 01:07:11] [INFO ] Deduced a trap composed of 23 places in 178 ms of which 2 ms to minimize.
[2024-06-03 01:07:11] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 2 ms to minimize.
[2024-06-03 01:07:12] [INFO ] Deduced a trap composed of 139 places in 146 ms of which 3 ms to minimize.
[2024-06-03 01:07:12] [INFO ] Deduced a trap composed of 101 places in 170 ms of which 2 ms to minimize.
[2024-06-03 01:07:12] [INFO ] Deduced a trap composed of 137 places in 188 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 11/71 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:07:14] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2024-06-03 01:07:14] [INFO ] Deduced a trap composed of 36 places in 162 ms of which 3 ms to minimize.
[2024-06-03 01:07:15] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 2 ms to minimize.
[2024-06-03 01:07:16] [INFO ] Deduced a trap composed of 25 places in 273 ms of which 4 ms to minimize.
[2024-06-03 01:07:17] [INFO ] Deduced a trap composed of 40 places in 262 ms of which 3 ms to minimize.
[2024-06-03 01:07:17] [INFO ] Deduced a trap composed of 41 places in 274 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 204/668 variables, and 77 constraints, problems are : Problem set: 0 solved, 463 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 463/463 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 463 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 70/77 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:07:24] [INFO ] Deduced a trap composed of 41 places in 273 ms of which 3 ms to minimize.
[2024-06-03 01:07:24] [INFO ] Deduced a trap composed of 39 places in 257 ms of which 3 ms to minimize.
[2024-06-03 01:07:24] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 3 ms to minimize.
[2024-06-03 01:07:24] [INFO ] Deduced a trap composed of 38 places in 284 ms of which 3 ms to minimize.
[2024-06-03 01:07:25] [INFO ] Deduced a trap composed of 137 places in 270 ms of which 3 ms to minimize.
[2024-06-03 01:07:25] [INFO ] Deduced a trap composed of 138 places in 266 ms of which 4 ms to minimize.
[2024-06-03 01:07:25] [INFO ] Deduced a trap composed of 25 places in 282 ms of which 3 ms to minimize.
[2024-06-03 01:07:26] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 4 ms to minimize.
[2024-06-03 01:07:26] [INFO ] Deduced a trap composed of 137 places in 294 ms of which 3 ms to minimize.
[2024-06-03 01:07:26] [INFO ] Deduced a trap composed of 102 places in 271 ms of which 3 ms to minimize.
[2024-06-03 01:07:27] [INFO ] Deduced a trap composed of 86 places in 270 ms of which 3 ms to minimize.
[2024-06-03 01:07:27] [INFO ] Deduced a trap composed of 106 places in 272 ms of which 3 ms to minimize.
[2024-06-03 01:07:27] [INFO ] Deduced a trap composed of 134 places in 271 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:07:31] [INFO ] Deduced a trap composed of 138 places in 252 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:07:37] [INFO ] Deduced a trap composed of 85 places in 250 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 463 unsolved
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 7 (OVERLAPS) 464/668 variables, 204/296 constraints. Problems are: Problem set: 50 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 668/668 variables, and 709 constraints, problems are : Problem set: 50 solved, 413 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 204/204 constraints, PredecessorRefiner: 413/463 constraints, Known Traps: 85/85 constraints]
After SMT, in 60556ms problems are : Problem set: 50 solved, 413 unsolved
Search for dead transitions found 50 dead transitions in 60563ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 204/223 places, 414/498 transitions.
Applied a total of 0 rules in 4 ms. Remains 204 /204 variables (removed 0) and now considering 414/414 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61018 ms. Remains : 204/223 places, 414/498 transitions.
[2024-06-03 01:07:48] [INFO ] Flatten gal took : 41 ms
[2024-06-03 01:07:48] [INFO ] Flatten gal took : 43 ms
[2024-06-03 01:07:48] [INFO ] Input system was already deterministic with 414 transitions.
[2024-06-03 01:07:48] [INFO ] Flatten gal took : 36 ms
[2024-06-03 01:07:48] [INFO ] Flatten gal took : 36 ms
[2024-06-03 01:07:48] [INFO ] Time to serialize gal into /tmp/CTLFireability10784734679870981878.gal : 31 ms
[2024-06-03 01:07:48] [INFO ] Time to serialize properties into /tmp/CTLFireability10961941484063030655.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10784734679870981878.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10961941484063030655.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-06-03 01:08:18] [INFO ] Flatten gal took : 21 ms
[2024-06-03 01:08:18] [INFO ] Applying decomposition
[2024-06-03 01:08:18] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5675167223366383369.txt' '-o' '/tmp/graph5675167223366383369.bin' '-w' '/tmp/graph5675167223366383369.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5675167223366383369.bin' '-l' '-1' '-v' '-w' '/tmp/graph5675167223366383369.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:08:18] [INFO ] Decomposing Gal with order
[2024-06-03 01:08:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:08:18] [INFO ] Removed a total of 928 redundant transitions.
[2024-06-03 01:08:18] [INFO ] Flatten gal took : 171 ms
[2024-06-03 01:08:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 36 ms.
[2024-06-03 01:08:19] [INFO ] Time to serialize gal into /tmp/CTLFireability14349902116986677553.gal : 17 ms
[2024-06-03 01:08:19] [INFO ] Time to serialize properties into /tmp/CTLFireability10012751481037003009.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/CTLFireability14349902116986677553.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10012751481037003009.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,3.38034e+07,1.6443,51484,2036,72,79698,692,870,266527,83,2166,0


Converting to forward existential form...Done !
original formula: E((!(EX(EG(EF(((i2.u9.p31==1)&&(i1.i0.u28.p113==1)))))) + (A(!(((((((i10.u6.p25==1)&&(i2.u9.p36==1))&&((i3.i0.u12.p65==1)&&(i10.u24.p99==...421
=> equivalent forward existential formula: [(FwdU(Init,(!(EX(EG(E(TRUE U ((i2.u9.p31==1)&&(i1.i0.u28.p113==1)))))) + (!((E(!(!(E(TRUE U !(!(((((i10.u6.p25=...756
Reverse transition relation is NOT exact ! Due to transitions t28, t35, t48, t94, t101, t105, t122, t185, t192, t199, t203, t206, t208, t231, t234, t239, t...1196
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
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
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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 202 transition count 460
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 202 transition count 460
Applied a total of 42 rules in 7 ms. Remains 202 /223 variables (removed 21) and now considering 460/498 (removed 38) transitions.
// Phase 1: matrix 460 rows 202 cols
[2024-06-03 01:08:49] [INFO ] Computed 7 invariants in 4 ms
[2024-06-03 01:08:49] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-03 01:08:49] [INFO ] Invariant cache hit.
[2024-06-03 01:08:49] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 459 sub problems to find dead transitions.
[2024-06-03 01:08:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/201 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 459 unsolved
At refinement iteration 1 (OVERLAPS) 1/202 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:08:56] [INFO ] Deduced a trap composed of 15 places in 257 ms of which 4 ms to minimize.
[2024-06-03 01:08:57] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 3 ms to minimize.
[2024-06-03 01:08:57] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-06-03 01:08:57] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 3 ms to minimize.
[2024-06-03 01:08:57] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 3 ms to minimize.
[2024-06-03 01:08:57] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 3 ms to minimize.
[2024-06-03 01:08:58] [INFO ] Deduced a trap composed of 33 places in 265 ms of which 3 ms to minimize.
[2024-06-03 01:08:58] [INFO ] Deduced a trap composed of 36 places in 268 ms of which 4 ms to minimize.
[2024-06-03 01:08:58] [INFO ] Deduced a trap composed of 41 places in 186 ms of which 2 ms to minimize.
[2024-06-03 01:08:59] [INFO ] Deduced a trap composed of 125 places in 261 ms of which 4 ms to minimize.
[2024-06-03 01:08:59] [INFO ] Deduced a trap composed of 41 places in 285 ms of which 4 ms to minimize.
[2024-06-03 01:08:59] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 4 ms to minimize.
[2024-06-03 01:09:00] [INFO ] Deduced a trap composed of 37 places in 251 ms of which 3 ms to minimize.
[2024-06-03 01:09:01] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 3 ms to minimize.
[2024-06-03 01:09:01] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 3 ms to minimize.
[2024-06-03 01:09:01] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 3 ms to minimize.
[2024-06-03 01:09:02] [INFO ] Deduced a trap composed of 26 places in 288 ms of which 4 ms to minimize.
[2024-06-03 01:09:02] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 3 ms to minimize.
[2024-06-03 01:09:02] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 2 ms to minimize.
[2024-06-03 01:09:03] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/202 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:09:03] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 1 ms to minimize.
[2024-06-03 01:09:03] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 2 ms to minimize.
[2024-06-03 01:09:03] [INFO ] Deduced a trap composed of 32 places in 143 ms of which 2 ms to minimize.
[2024-06-03 01:09:03] [INFO ] Deduced a trap composed of 19 places in 132 ms of which 2 ms to minimize.
[2024-06-03 01:09:04] [INFO ] Deduced a trap composed of 125 places in 216 ms of which 3 ms to minimize.
[2024-06-03 01:09:05] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 4 ms to minimize.
[2024-06-03 01:09:05] [INFO ] Deduced a trap composed of 36 places in 282 ms of which 3 ms to minimize.
[2024-06-03 01:09:05] [INFO ] Deduced a trap composed of 27 places in 195 ms of which 3 ms to minimize.
[2024-06-03 01:09:06] [INFO ] Deduced a trap composed of 28 places in 301 ms of which 4 ms to minimize.
[2024-06-03 01:09:06] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 4 ms to minimize.
[2024-06-03 01:09:07] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 4 ms to minimize.
[2024-06-03 01:09:07] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 4 ms to minimize.
[2024-06-03 01:09:07] [INFO ] Deduced a trap composed of 141 places in 284 ms of which 3 ms to minimize.
[2024-06-03 01:09:08] [INFO ] Deduced a trap composed of 26 places in 297 ms of which 3 ms to minimize.
[2024-06-03 01:09:08] [INFO ] Deduced a trap composed of 28 places in 257 ms of which 4 ms to minimize.
[2024-06-03 01:09:08] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 4 ms to minimize.
[2024-06-03 01:09:09] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 4 ms to minimize.
[2024-06-03 01:09:09] [INFO ] Deduced a trap composed of 41 places in 272 ms of which 4 ms to minimize.
[2024-06-03 01:09:09] [INFO ] Deduced a trap composed of 107 places in 239 ms of which 4 ms to minimize.
[2024-06-03 01:09:10] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/202 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 459 unsolved
[2024-06-03 01:09:15] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 3 ms to minimize.
[2024-06-03 01:09:15] [INFO ] Deduced a trap composed of 24 places in 278 ms of which 3 ms to minimize.
[2024-06-03 01:09:15] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 4 ms to minimize.
[2024-06-03 01:09:16] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 3 ms to minimize.
[2024-06-03 01:09:16] [INFO ] Deduced a trap composed of 22 places in 258 ms of which 3 ms to minimize.
[2024-06-03 01:09:16] [INFO ] Deduced a trap composed of 41 places in 296 ms of which 4 ms to minimize.
[2024-06-03 01:09:17] [INFO ] Deduced a trap composed of 23 places in 296 ms of which 4 ms to minimize.
[2024-06-03 01:09:17] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 4 ms to minimize.
[2024-06-03 01:09:17] [INFO ] Deduced a trap composed of 31 places in 218 ms of which 3 ms to minimize.
[2024-06-03 01:09:17] [INFO ] Deduced a trap composed of 24 places in 205 ms of which 3 ms to minimize.
[2024-06-03 01:09:18] [INFO ] Deduced a trap composed of 23 places in 297 ms of which 4 ms to minimize.
[2024-06-03 01:09:18] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 3 ms to minimize.
[2024-06-03 01:09:18] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 3 ms to minimize.
[2024-06-03 01:09:19] [INFO ] Deduced a trap composed of 28 places in 295 ms of which 3 ms to minimize.
[2024-06-03 01:09:19] [INFO ] Deduced a trap composed of 29 places in 242 ms of which 3 ms to minimize.
[2024-06-03 01:09:19] [INFO ] Deduced a trap composed of 28 places in 286 ms of which 3 ms to minimize.
[2024-06-03 01:09:20] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 4 ms to minimize.
[2024-06-03 01:09:20] [INFO ] Deduced a trap composed of 23 places in 268 ms of which 4 ms to minimize.
SMT process timed out in 30687ms, After SMT, problems are : Problem set: 0 solved, 459 unsolved
Search for dead transitions found 0 dead transitions in 30697ms
Starting structural reductions in LTL mode, iteration 1 : 202/223 places, 460/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31256 ms. Remains : 202/223 places, 460/498 transitions.
[2024-06-03 01:09:20] [INFO ] Flatten gal took : 38 ms
[2024-06-03 01:09:20] [INFO ] Flatten gal took : 38 ms
[2024-06-03 01:09:20] [INFO ] Input system was already deterministic with 460 transitions.
[2024-06-03 01:09:20] [INFO ] Flatten gal took : 34 ms
[2024-06-03 01:09:20] [INFO ] Flatten gal took : 34 ms
[2024-06-03 01:09:20] [INFO ] Time to serialize gal into /tmp/CTLFireability13668811945013238428.gal : 6 ms
[2024-06-03 01:09:20] [INFO ] Time to serialize properties into /tmp/CTLFireability2847783632022303584.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/CTLFireability13668811945013238428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2847783632022303584.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-06-03 01:09:50] [INFO ] Flatten gal took : 21 ms
[2024-06-03 01:09:50] [INFO ] Applying decomposition
[2024-06-03 01:09:50] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3782285103303988503.txt' '-o' '/tmp/graph3782285103303988503.bin' '-w' '/tmp/graph3782285103303988503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3782285103303988503.bin' '-l' '-1' '-v' '-w' '/tmp/graph3782285103303988503.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:09:50] [INFO ] Decomposing Gal with order
[2024-06-03 01:09:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:09:50] [INFO ] Removed a total of 1326 redundant transitions.
[2024-06-03 01:09:51] [INFO ] Flatten gal took : 61 ms
[2024-06-03 01:09:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 16 ms.
[2024-06-03 01:09:51] [INFO ] Time to serialize gal into /tmp/CTLFireability5734467740930656000.gal : 7 ms
[2024-06-03 01:09:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6823601936519021575.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/CTLFireability5734467740930656000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6823601936519021575.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,3.07979e+07,9.45684,227792,4148,41,209815,621,1023,2.02676e+06,81,1963,0


Converting to forward existential form...Done !
original formula: AF(((!(E(EF(((i1.u11.p56==1)&&(i2.i0.i0.u45.p165==1))) U ((!((i5.u3.p8==1)&&(i8.u48.p177==1)))||((((i5.u4.p18==1)&&(i1.u9.p48==1))&&((i1....475
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(E(TRUE U ((i1.u11.p56==1)&&(i2.i0.i0.u45.p165==1))) U ((!((i5.u3.p8==1)&&(i8.u48.p177==1)))||...731
Reverse transition relation is NOT exact ! Due to transitions t19, t35, t101, t159, t175, t192, t202, t206, t228, t230, t236, t238, t260, t262, t268, t270,...1024
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 201 transition count 458
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 201 transition count 458
Applied a total of 44 rules in 8 ms. Remains 201 /223 variables (removed 22) and now considering 458/498 (removed 40) transitions.
// Phase 1: matrix 458 rows 201 cols
[2024-06-03 01:10:21] [INFO ] Computed 7 invariants in 7 ms
[2024-06-03 01:10:21] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-03 01:10:21] [INFO ] Invariant cache hit.
[2024-06-03 01:10:21] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-03 01:10:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:10:28] [INFO ] Deduced a trap composed of 15 places in 221 ms of which 3 ms to minimize.
[2024-06-03 01:10:28] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 3 ms to minimize.
[2024-06-03 01:10:28] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2024-06-03 01:10:28] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 3 ms to minimize.
[2024-06-03 01:10:29] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 3 ms to minimize.
[2024-06-03 01:10:29] [INFO ] Deduced a trap composed of 46 places in 219 ms of which 3 ms to minimize.
[2024-06-03 01:10:29] [INFO ] Deduced a trap composed of 35 places in 224 ms of which 3 ms to minimize.
[2024-06-03 01:10:29] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 3 ms to minimize.
[2024-06-03 01:10:30] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 3 ms to minimize.
[2024-06-03 01:10:30] [INFO ] Deduced a trap composed of 40 places in 266 ms of which 4 ms to minimize.
[2024-06-03 01:10:30] [INFO ] Deduced a trap composed of 125 places in 188 ms of which 3 ms to minimize.
[2024-06-03 01:10:31] [INFO ] Deduced a trap composed of 20 places in 271 ms of which 4 ms to minimize.
[2024-06-03 01:10:31] [INFO ] Deduced a trap composed of 125 places in 201 ms of which 3 ms to minimize.
[2024-06-03 01:10:31] [INFO ] Deduced a trap composed of 125 places in 155 ms of which 2 ms to minimize.
[2024-06-03 01:10:31] [INFO ] Deduced a trap composed of 125 places in 185 ms of which 2 ms to minimize.
[2024-06-03 01:10:31] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 2 ms to minimize.
[2024-06-03 01:10:31] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 4 ms to minimize.
[2024-06-03 01:10:32] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 3 ms to minimize.
[2024-06-03 01:10:33] [INFO ] Deduced a trap composed of 24 places in 296 ms of which 4 ms to minimize.
[2024-06-03 01:10:34] [INFO ] Deduced a trap composed of 28 places in 292 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:10:34] [INFO ] Deduced a trap composed of 30 places in 137 ms of which 2 ms to minimize.
[2024-06-03 01:10:34] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 1 ms to minimize.
[2024-06-03 01:10:34] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 2 ms to minimize.
[2024-06-03 01:10:36] [INFO ] Deduced a trap composed of 26 places in 278 ms of which 3 ms to minimize.
[2024-06-03 01:10:36] [INFO ] Deduced a trap composed of 22 places in 308 ms of which 3 ms to minimize.
[2024-06-03 01:10:36] [INFO ] Deduced a trap composed of 24 places in 289 ms of which 4 ms to minimize.
[2024-06-03 01:10:37] [INFO ] Deduced a trap composed of 22 places in 299 ms of which 4 ms to minimize.
[2024-06-03 01:10:37] [INFO ] Deduced a trap composed of 28 places in 269 ms of which 4 ms to minimize.
[2024-06-03 01:10:38] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 4 ms to minimize.
[2024-06-03 01:10:38] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 4 ms to minimize.
[2024-06-03 01:10:38] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 3 ms to minimize.
[2024-06-03 01:10:38] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 3 ms to minimize.
[2024-06-03 01:10:39] [INFO ] Deduced a trap composed of 33 places in 247 ms of which 3 ms to minimize.
[2024-06-03 01:10:39] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 4 ms to minimize.
[2024-06-03 01:10:39] [INFO ] Deduced a trap composed of 38 places in 270 ms of which 3 ms to minimize.
[2024-06-03 01:10:39] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 3 ms to minimize.
[2024-06-03 01:10:40] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 3 ms to minimize.
[2024-06-03 01:10:40] [INFO ] Deduced a trap composed of 22 places in 221 ms of which 3 ms to minimize.
[2024-06-03 01:10:40] [INFO ] Deduced a trap composed of 37 places in 280 ms of which 3 ms to minimize.
[2024-06-03 01:10:41] [INFO ] Deduced a trap composed of 23 places in 276 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:10:44] [INFO ] Deduced a trap composed of 32 places in 308 ms of which 4 ms to minimize.
[2024-06-03 01:10:45] [INFO ] Deduced a trap composed of 31 places in 288 ms of which 3 ms to minimize.
[2024-06-03 01:10:45] [INFO ] Deduced a trap composed of 29 places in 276 ms of which 3 ms to minimize.
[2024-06-03 01:10:45] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 3 ms to minimize.
[2024-06-03 01:10:46] [INFO ] Deduced a trap composed of 23 places in 232 ms of which 3 ms to minimize.
[2024-06-03 01:10:46] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 3 ms to minimize.
[2024-06-03 01:10:46] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 3 ms to minimize.
[2024-06-03 01:10:46] [INFO ] Deduced a trap composed of 23 places in 284 ms of which 3 ms to minimize.
[2024-06-03 01:10:47] [INFO ] Deduced a trap composed of 30 places in 269 ms of which 3 ms to minimize.
[2024-06-03 01:10:47] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 3 ms to minimize.
[2024-06-03 01:10:47] [INFO ] Deduced a trap composed of 30 places in 261 ms of which 3 ms to minimize.
[2024-06-03 01:10:47] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 3 ms to minimize.
[2024-06-03 01:10:48] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 4 ms to minimize.
[2024-06-03 01:10:49] [INFO ] Deduced a trap composed of 23 places in 267 ms of which 3 ms to minimize.
[2024-06-03 01:10:49] [INFO ] Deduced a trap composed of 29 places in 277 ms of which 4 ms to minimize.
[2024-06-03 01:10:49] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 3 ms to minimize.
[2024-06-03 01:10:50] [INFO ] Deduced a trap composed of 41 places in 223 ms of which 3 ms to minimize.
[2024-06-03 01:10:50] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 3 ms to minimize.
[2024-06-03 01:10:51] [INFO ] Deduced a trap composed of 41 places in 274 ms of which 3 ms to minimize.
[2024-06-03 01:10:51] [INFO ] Deduced a trap composed of 37 places in 268 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 457 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 201/659 variables, and 67 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/201 constraints, PredecessorRefiner: 457/457 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 457 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 60/67 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:10:57] [INFO ] Deduced a trap composed of 134 places in 257 ms of which 4 ms to minimize.
[2024-06-03 01:10:57] [INFO ] Deduced a trap composed of 137 places in 256 ms of which 3 ms to minimize.
[2024-06-03 01:10:58] [INFO ] Deduced a trap composed of 29 places in 264 ms of which 3 ms to minimize.
[2024-06-03 01:10:58] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 4 ms to minimize.
[2024-06-03 01:10:59] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 3 ms to minimize.
[2024-06-03 01:10:59] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 3 ms to minimize.
[2024-06-03 01:11:00] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 3 ms to minimize.
[2024-06-03 01:11:01] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:11:03] [INFO ] Deduced a trap composed of 139 places in 284 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:11:09] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 3 ms to minimize.
[2024-06-03 01:11:09] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:11:12] [INFO ] Deduced a trap composed of 41 places in 214 ms of which 4 ms to minimize.
[2024-06-03 01:11:13] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:11:19] [INFO ] Deduced a trap composed of 141 places in 266 ms of which 3 ms to minimize.
[2024-06-03 01:11:19] [INFO ] Deduced a trap composed of 37 places in 253 ms of which 4 ms to minimize.
[2024-06-03 01:11:19] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 201/659 variables, and 83 constraints, problems are : Problem set: 0 solved, 457 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/201 constraints, PredecessorRefiner: 0/457 constraints, Known Traps: 76/76 constraints]
After SMT, in 60367ms problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 60374ms
Starting structural reductions in LTL mode, iteration 1 : 201/223 places, 458/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61066 ms. Remains : 201/223 places, 458/498 transitions.
[2024-06-03 01:11:22] [INFO ] Flatten gal took : 30 ms
[2024-06-03 01:11:22] [INFO ] Flatten gal took : 34 ms
[2024-06-03 01:11:22] [INFO ] Input system was already deterministic with 458 transitions.
[2024-06-03 01:11:22] [INFO ] Flatten gal took : 31 ms
[2024-06-03 01:11:22] [INFO ] Flatten gal took : 32 ms
[2024-06-03 01:11:22] [INFO ] Time to serialize gal into /tmp/CTLFireability3809331505953375343.gal : 7 ms
[2024-06-03 01:11:22] [INFO ] Time to serialize properties into /tmp/CTLFireability11644262225883525843.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/CTLFireability3809331505953375343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11644262225883525843.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-06-03 01:11:52] [INFO ] Flatten gal took : 18 ms
[2024-06-03 01:11:52] [INFO ] Applying decomposition
[2024-06-03 01:11:52] [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/graph977559097061921875.txt' '-o' '/tmp/graph977559097061921875.bin' '-w' '/tmp/graph977559097061921875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph977559097061921875.bin' '-l' '-1' '-v' '-w' '/tmp/graph977559097061921875.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:11:52] [INFO ] Decomposing Gal with order
[2024-06-03 01:11:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:11:52] [INFO ] Removed a total of 1316 redundant transitions.
[2024-06-03 01:11:52] [INFO ] Flatten gal took : 42 ms
[2024-06-03 01:11:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 16 ms.
[2024-06-03 01:11:52] [INFO ] Time to serialize gal into /tmp/CTLFireability2694409320165871681.gal : 5 ms
[2024-06-03 01:11:52] [INFO ] Time to serialize properties into /tmp/CTLFireability391469054279054674.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/CTLFireability2694409320165871681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability391469054279054674.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.94267e+07,6.39152,112108,3421,24,99181,340,1159,884034,60,929,0


Converting to forward existential form...Done !
original formula: E(AX((i4.i3.u65.p229!=1)) U ((AX(FALSE) * (i0.i2.u18.p81==1)) * (i1.i0.u44.p164==1)))
=> equivalent forward existential formula: [(((FwdU(Init,!(EX(!((i4.i3.u65.p229!=1))))) * (i1.i0.u44.p164==1)) * (i0.i2.u18.p81==1)) * !(EX(!(FALSE))))] !=...161
Reverse transition relation is NOT exact ! Due to transitions t30, t39, t96, t101, t159, t175, t186, t190, t202, t204, t226, t234, t258, t266, t278, t279, ...1049
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 203 transition count 461
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 203 transition count 461
Applied a total of 40 rules in 7 ms. Remains 203 /223 variables (removed 20) and now considering 461/498 (removed 37) transitions.
// Phase 1: matrix 461 rows 203 cols
[2024-06-03 01:12:22] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:12:22] [INFO ] Implicit Places using invariants in 140 ms returned []
[2024-06-03 01:12:22] [INFO ] Invariant cache hit.
[2024-06-03 01:12:23] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-03 01:12:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-03 01:12:30] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 3 ms to minimize.
[2024-06-03 01:12:31] [INFO ] Deduced a trap composed of 13 places in 239 ms of which 3 ms to minimize.
[2024-06-03 01:12:31] [INFO ] Deduced a trap composed of 15 places in 240 ms of which 3 ms to minimize.
[2024-06-03 01:12:31] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-06-03 01:12:31] [INFO ] Deduced a trap composed of 46 places in 311 ms of which 3 ms to minimize.
[2024-06-03 01:12:32] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 3 ms to minimize.
[2024-06-03 01:12:32] [INFO ] Deduced a trap composed of 39 places in 274 ms of which 3 ms to minimize.
[2024-06-03 01:12:32] [INFO ] Deduced a trap composed of 19 places in 277 ms of which 3 ms to minimize.
[2024-06-03 01:12:32] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 3 ms to minimize.
[2024-06-03 01:12:33] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 3 ms to minimize.
[2024-06-03 01:12:33] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 3 ms to minimize.
[2024-06-03 01:12:33] [INFO ] Deduced a trap composed of 39 places in 255 ms of which 3 ms to minimize.
[2024-06-03 01:12:33] [INFO ] Deduced a trap composed of 126 places in 202 ms of which 3 ms to minimize.
[2024-06-03 01:12:34] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 4 ms to minimize.
[2024-06-03 01:12:34] [INFO ] Deduced a trap composed of 134 places in 261 ms of which 4 ms to minimize.
[2024-06-03 01:12:34] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 3 ms to minimize.
[2024-06-03 01:12:34] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 3 ms to minimize.
[2024-06-03 01:12:35] [INFO ] Deduced a trap composed of 127 places in 258 ms of which 4 ms to minimize.
[2024-06-03 01:12:35] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 3 ms to minimize.
[2024-06-03 01:12:36] [INFO ] Deduced a trap composed of 135 places in 274 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-03 01:12:36] [INFO ] Deduced a trap composed of 126 places in 211 ms of which 4 ms to minimize.
[2024-06-03 01:12:38] [INFO ] Deduced a trap composed of 25 places in 306 ms of which 3 ms to minimize.
[2024-06-03 01:12:38] [INFO ] Deduced a trap composed of 44 places in 308 ms of which 4 ms to minimize.
[2024-06-03 01:12:39] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 4 ms to minimize.
[2024-06-03 01:12:39] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 4 ms to minimize.
[2024-06-03 01:12:39] [INFO ] Deduced a trap composed of 32 places in 290 ms of which 3 ms to minimize.
[2024-06-03 01:12:39] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 3 ms to minimize.
[2024-06-03 01:12:40] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 4 ms to minimize.
[2024-06-03 01:12:40] [INFO ] Deduced a trap composed of 25 places in 290 ms of which 3 ms to minimize.
[2024-06-03 01:12:40] [INFO ] Deduced a trap composed of 26 places in 277 ms of which 3 ms to minimize.
[2024-06-03 01:12:41] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 4 ms to minimize.
[2024-06-03 01:12:41] [INFO ] Deduced a trap composed of 24 places in 253 ms of which 3 ms to minimize.
[2024-06-03 01:12:41] [INFO ] Deduced a trap composed of 25 places in 272 ms of which 4 ms to minimize.
[2024-06-03 01:12:41] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 3 ms to minimize.
[2024-06-03 01:12:42] [INFO ] Deduced a trap composed of 131 places in 230 ms of which 3 ms to minimize.
[2024-06-03 01:12:42] [INFO ] Deduced a trap composed of 41 places in 281 ms of which 3 ms to minimize.
[2024-06-03 01:12:42] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 3 ms to minimize.
[2024-06-03 01:12:43] [INFO ] Deduced a trap composed of 22 places in 285 ms of which 4 ms to minimize.
[2024-06-03 01:12:43] [INFO ] Deduced a trap composed of 23 places in 261 ms of which 3 ms to minimize.
[2024-06-03 01:12:43] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-03 01:12:47] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 3 ms to minimize.
[2024-06-03 01:12:47] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 3 ms to minimize.
[2024-06-03 01:12:49] [INFO ] Deduced a trap composed of 22 places in 241 ms of which 6 ms to minimize.
[2024-06-03 01:12:49] [INFO ] Deduced a trap composed of 24 places in 223 ms of which 3 ms to minimize.
[2024-06-03 01:12:49] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 4 ms to minimize.
[2024-06-03 01:12:50] [INFO ] Deduced a trap composed of 28 places in 268 ms of which 3 ms to minimize.
[2024-06-03 01:12:50] [INFO ] Deduced a trap composed of 24 places in 286 ms of which 4 ms to minimize.
[2024-06-03 01:12:50] [INFO ] Deduced a trap composed of 41 places in 256 ms of which 3 ms to minimize.
[2024-06-03 01:12:51] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 3 ms to minimize.
[2024-06-03 01:12:51] [INFO ] Deduced a trap composed of 29 places in 264 ms of which 3 ms to minimize.
[2024-06-03 01:12:51] [INFO ] Deduced a trap composed of 24 places in 245 ms of which 3 ms to minimize.
[2024-06-03 01:12:51] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 3 ms to minimize.
[2024-06-03 01:12:52] [INFO ] Deduced a trap composed of 23 places in 294 ms of which 3 ms to minimize.
[2024-06-03 01:12:52] [INFO ] Deduced a trap composed of 31 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:12:52] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 3 ms to minimize.
[2024-06-03 01:12:53] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 3 ms to minimize.
[2024-06-03 01:12:53] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 2 ms to minimize.
[2024-06-03 01:12:53] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/664 variables, and 65 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 58/65 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-03 01:12:59] [INFO ] Deduced a trap composed of 142 places in 296 ms of which 3 ms to minimize.
[2024-06-03 01:12:59] [INFO ] Deduced a trap composed of 43 places in 277 ms of which 4 ms to minimize.
[2024-06-03 01:13:00] [INFO ] Deduced a trap composed of 35 places in 265 ms of which 3 ms to minimize.
[2024-06-03 01:13:00] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 3 ms to minimize.
[2024-06-03 01:13:00] [INFO ] Deduced a trap composed of 44 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:13:00] [INFO ] Deduced a trap composed of 28 places in 259 ms of which 3 ms to minimize.
[2024-06-03 01:13:01] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 3 ms to minimize.
[2024-06-03 01:13:01] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 3 ms to minimize.
[2024-06-03 01:13:01] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 3 ms to minimize.
[2024-06-03 01:13:03] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 3 ms to minimize.
[2024-06-03 01:13:03] [INFO ] Deduced a trap composed of 48 places in 203 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 11/76 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-03 01:13:06] [INFO ] Deduced a trap composed of 112 places in 284 ms of which 4 ms to minimize.
[2024-06-03 01:13:07] [INFO ] Deduced a trap composed of 107 places in 197 ms of which 3 ms to minimize.
[2024-06-03 01:13:07] [INFO ] Deduced a trap composed of 111 places in 231 ms of which 3 ms to minimize.
[2024-06-03 01:13:08] [INFO ] Deduced a trap composed of 41 places in 276 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-03 01:13:12] [INFO ] Deduced a trap composed of 39 places in 279 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
At refinement iteration 7 (OVERLAPS) 461/664 variables, 203/284 constraints. Problems are: Problem set: 50 solved, 410 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 410/694 constraints. Problems are: Problem set: 50 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 664/664 variables, and 694 constraints, problems are : Problem set: 50 solved, 410 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 410/460 constraints, Known Traps: 74/74 constraints]
After SMT, in 60359ms problems are : Problem set: 50 solved, 410 unsolved
Search for dead transitions found 50 dead transitions in 60364ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 203/223 places, 411/498 transitions.
Applied a total of 0 rules in 4 ms. Remains 203 /203 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60897 ms. Remains : 203/223 places, 411/498 transitions.
[2024-06-03 01:13:23] [INFO ] Flatten gal took : 21 ms
[2024-06-03 01:13:23] [INFO ] Flatten gal took : 22 ms
[2024-06-03 01:13:23] [INFO ] Input system was already deterministic with 411 transitions.
[2024-06-03 01:13:23] [INFO ] Flatten gal took : 21 ms
[2024-06-03 01:13:23] [INFO ] Flatten gal took : 21 ms
[2024-06-03 01:13:23] [INFO ] Time to serialize gal into /tmp/CTLFireability4947668797546509383.gal : 5 ms
[2024-06-03 01:13:23] [INFO ] Time to serialize properties into /tmp/CTLFireability4715904594587854897.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/CTLFireability4947668797546509383.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4715904594587854897.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-06-03 01:13:53] [INFO ] Flatten gal took : 13 ms
[2024-06-03 01:13:53] [INFO ] Applying decomposition
[2024-06-03 01:13:53] [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/graph8539579001956104623.txt' '-o' '/tmp/graph8539579001956104623.bin' '-w' '/tmp/graph8539579001956104623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8539579001956104623.bin' '-l' '-1' '-v' '-w' '/tmp/graph8539579001956104623.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:13:53] [INFO ] Decomposing Gal with order
[2024-06-03 01:13:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:13:54] [INFO ] Removed a total of 936 redundant transitions.
[2024-06-03 01:13:54] [INFO ] Flatten gal took : 30 ms
[2024-06-03 01:13:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 8 ms.
[2024-06-03 01:13:54] [INFO ] Time to serialize gal into /tmp/CTLFireability8962877558887514680.gal : 4 ms
[2024-06-03 01:13:54] [INFO ] Time to serialize properties into /tmp/CTLFireability11499030606796561958.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/CTLFireability8962877558887514680.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11499030606796561958.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,3.11502e+07,2.88089,86384,2322,35,149516,585,948,468989,68,1794,0


Converting to forward existential form...Done !
original formula: E(!(AX((i6.i0.u52.p192==1))) U ((i0.u8.p40==1)||((i0.u7.p31==1)&&(i3.u26.p108==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EX(!((i6.i0.u52.p192==1)))))) * ((i0.u8.p40==1)||((i0.u7.p31==1)&&(i3.u26.p108==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t35, t48, t53, t95, t97, t115, t119, t182, t198, t205, t229, t231, t237, t239, t261, t263, t2...1062
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Graph (trivial) has 227 edges and 223 vertex of which 8 / 223 are part of one of the 2 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 216 transition count 446
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 95 place count 171 transition count 442
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 97 place count 169 transition count 442
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 97 place count 169 transition count 431
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 119 place count 158 transition count 431
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 142 place count 135 transition count 388
Iterating global reduction 3 with 23 rules applied. Total rules applied 165 place count 135 transition count 388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 165 place count 135 transition count 387
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 167 place count 134 transition count 387
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 168 place count 133 transition count 371
Iterating global reduction 3 with 1 rules applied. Total rules applied 169 place count 133 transition count 371
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 209 place count 113 transition count 351
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 214 place count 108 transition count 331
Iterating global reduction 3 with 5 rules applied. Total rules applied 219 place count 108 transition count 331
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 221 place count 106 transition count 327
Iterating global reduction 3 with 2 rules applied. Total rules applied 223 place count 106 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 234 place count 106 transition count 316
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 234 place count 106 transition count 315
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 236 place count 105 transition count 315
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 248 place count 99 transition count 309
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 250 place count 97 transition count 301
Iterating global reduction 3 with 2 rules applied. Total rules applied 252 place count 97 transition count 301
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 254 place count 95 transition count 297
Iterating global reduction 3 with 2 rules applied. Total rules applied 256 place count 95 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 257 place count 94 transition count 296
Applied a total of 257 rules in 73 ms. Remains 94 /223 variables (removed 129) and now considering 296/498 (removed 202) transitions.
[2024-06-03 01:14:24] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
// Phase 1: matrix 295 rows 94 cols
[2024-06-03 01:14:24] [INFO ] Computed 7 invariants in 1 ms
[2024-06-03 01:14:24] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-03 01:14:24] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2024-06-03 01:14:24] [INFO ] Invariant cache hit.
[2024-06-03 01:14:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-03 01:14:24] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-06-03 01:14:24] [INFO ] Redundant transitions in 29 ms returned []
Running 291 sub problems to find dead transitions.
[2024-06-03 01:14:24] [INFO ] Flow matrix only has 295 transitions (discarded 1 similar events)
[2024-06-03 01:14:24] [INFO ] Invariant cache hit.
[2024-06-03 01:14:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-03 01:14:26] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 2 ms to minimize.
[2024-06-03 01:14:26] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-03 01:14:26] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 2 ms to minimize.
[2024-06-03 01:14:26] [INFO ] Deduced a trap composed of 7 places in 124 ms of which 1 ms to minimize.
[2024-06-03 01:14:27] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 2 ms to minimize.
[2024-06-03 01:14:27] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 2 ms to minimize.
[2024-06-03 01:14:27] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 2 ms to minimize.
[2024-06-03 01:14:27] [INFO ] Deduced a trap composed of 10 places in 169 ms of which 1 ms to minimize.
[2024-06-03 01:14:27] [INFO ] Deduced a trap composed of 29 places in 148 ms of which 2 ms to minimize.
[2024-06-03 01:14:27] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 1 ms to minimize.
[2024-06-03 01:14:27] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
[2024-06-03 01:14:28] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (OVERLAPS) 294/388 variables, 94/113 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (OVERLAPS) 1/389 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 0/389 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 114 constraints, problems are : Problem set: 0 solved, 291 unsolved in 18370 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 12/19 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
At refinement iteration 3 (OVERLAPS) 294/388 variables, 94/113 constraints. Problems are: Problem set: 36 solved, 255 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 255/368 constraints. Problems are: Problem set: 36 solved, 255 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 388/389 variables, and 368 constraints, problems are : Problem set: 36 solved, 255 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 94/94 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 255/291 constraints, Known Traps: 12/12 constraints]
After SMT, in 48758ms problems are : Problem set: 36 solved, 255 unsolved
Search for dead transitions found 36 dead transitions in 48764ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 94/223 places, 260/498 transitions.
Applied a total of 0 rules in 7 ms. Remains 94 /94 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-06-03 01:15:13] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 49235 ms. Remains : 94/223 places, 260/498 transitions.
[2024-06-03 01:15:13] [INFO ] Flatten gal took : 9 ms
[2024-06-03 01:15:13] [INFO ] Flatten gal took : 12 ms
[2024-06-03 01:15:13] [INFO ] Input system was already deterministic with 260 transitions.
[2024-06-03 01:15:13] [INFO ] Flatten gal took : 14 ms
[2024-06-03 01:15:13] [INFO ] Flatten gal took : 10 ms
[2024-06-03 01:15:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17230289616620918988.gal : 2 ms
[2024-06-03 01:15:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7723259305397577840.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/ReachabilityCardinality17230289616620918988.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7723259305397577840.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 18589 steps (3029 resets) in 43 ms. (422 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-18-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 203 transition count 462
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 203 transition count 462
Applied a total of 40 rules in 5 ms. Remains 203 /223 variables (removed 20) and now considering 462/498 (removed 36) transitions.
// Phase 1: matrix 462 rows 203 cols
[2024-06-03 01:15:13] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:15:13] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-03 01:15:13] [INFO ] Invariant cache hit.
[2024-06-03 01:15:13] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-03 01:15:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:15:21] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 4 ms to minimize.
[2024-06-03 01:15:21] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 2 ms to minimize.
[2024-06-03 01:15:21] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
[2024-06-03 01:15:21] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-06-03 01:15:22] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 3 ms to minimize.
[2024-06-03 01:15:22] [INFO ] Deduced a trap composed of 43 places in 241 ms of which 3 ms to minimize.
[2024-06-03 01:15:22] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 2 ms to minimize.
[2024-06-03 01:15:22] [INFO ] Deduced a trap composed of 41 places in 251 ms of which 3 ms to minimize.
[2024-06-03 01:15:23] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 3 ms to minimize.
[2024-06-03 01:15:23] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 4 ms to minimize.
[2024-06-03 01:15:23] [INFO ] Deduced a trap composed of 125 places in 264 ms of which 4 ms to minimize.
[2024-06-03 01:15:23] [INFO ] Deduced a trap composed of 113 places in 254 ms of which 4 ms to minimize.
[2024-06-03 01:15:24] [INFO ] Deduced a trap composed of 33 places in 263 ms of which 3 ms to minimize.
[2024-06-03 01:15:24] [INFO ] Deduced a trap composed of 126 places in 278 ms of which 3 ms to minimize.
[2024-06-03 01:15:24] [INFO ] Deduced a trap composed of 113 places in 260 ms of which 3 ms to minimize.
[2024-06-03 01:15:25] [INFO ] Deduced a trap composed of 112 places in 201 ms of which 3 ms to minimize.
[2024-06-03 01:15:25] [INFO ] Deduced a trap composed of 42 places in 272 ms of which 3 ms to minimize.
[2024-06-03 01:15:25] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 4 ms to minimize.
[2024-06-03 01:15:25] [INFO ] Deduced a trap composed of 124 places in 254 ms of which 3 ms to minimize.
[2024-06-03 01:15:26] [INFO ] Deduced a trap composed of 35 places in 258 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:15:26] [INFO ] Deduced a trap composed of 125 places in 177 ms of which 3 ms to minimize.
[2024-06-03 01:15:26] [INFO ] Deduced a trap composed of 125 places in 199 ms of which 3 ms to minimize.
[2024-06-03 01:15:28] [INFO ] Deduced a trap composed of 139 places in 236 ms of which 4 ms to minimize.
[2024-06-03 01:15:28] [INFO ] Deduced a trap composed of 48 places in 256 ms of which 3 ms to minimize.
[2024-06-03 01:15:28] [INFO ] Deduced a trap composed of 46 places in 263 ms of which 4 ms to minimize.
[2024-06-03 01:15:29] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 3 ms to minimize.
[2024-06-03 01:15:29] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 3 ms to minimize.
[2024-06-03 01:15:29] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 3 ms to minimize.
[2024-06-03 01:15:30] [INFO ] Deduced a trap composed of 24 places in 244 ms of which 3 ms to minimize.
[2024-06-03 01:15:30] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 3 ms to minimize.
[2024-06-03 01:15:30] [INFO ] Deduced a trap composed of 25 places in 256 ms of which 3 ms to minimize.
[2024-06-03 01:15:31] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 3 ms to minimize.
[2024-06-03 01:15:31] [INFO ] Deduced a trap composed of 27 places in 284 ms of which 3 ms to minimize.
[2024-06-03 01:15:31] [INFO ] Deduced a trap composed of 29 places in 258 ms of which 3 ms to minimize.
[2024-06-03 01:15:31] [INFO ] Deduced a trap composed of 29 places in 262 ms of which 3 ms to minimize.
[2024-06-03 01:15:32] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 3 ms to minimize.
[2024-06-03 01:15:32] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 3 ms to minimize.
[2024-06-03 01:15:32] [INFO ] Deduced a trap composed of 114 places in 279 ms of which 3 ms to minimize.
[2024-06-03 01:15:33] [INFO ] Deduced a trap composed of 46 places in 278 ms of which 3 ms to minimize.
[2024-06-03 01:15:33] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:15:36] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 2 ms to minimize.
[2024-06-03 01:15:37] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 2 ms to minimize.
[2024-06-03 01:15:37] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 2 ms to minimize.
[2024-06-03 01:15:37] [INFO ] Deduced a trap composed of 32 places in 163 ms of which 2 ms to minimize.
[2024-06-03 01:15:38] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 2 ms to minimize.
[2024-06-03 01:15:38] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 1 ms to minimize.
[2024-06-03 01:15:39] [INFO ] Deduced a trap composed of 130 places in 142 ms of which 2 ms to minimize.
[2024-06-03 01:15:39] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 2 ms to minimize.
[2024-06-03 01:15:39] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2024-06-03 01:15:39] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-06-03 01:15:40] [INFO ] Deduced a trap composed of 24 places in 160 ms of which 2 ms to minimize.
[2024-06-03 01:15:40] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 1 ms to minimize.
[2024-06-03 01:15:40] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:15:41] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 2 ms to minimize.
[2024-06-03 01:15:42] [INFO ] Deduced a trap composed of 24 places in 167 ms of which 2 ms to minimize.
[2024-06-03 01:15:42] [INFO ] Deduced a trap composed of 25 places in 159 ms of which 2 ms to minimize.
[2024-06-03 01:15:42] [INFO ] Deduced a trap composed of 22 places in 166 ms of which 2 ms to minimize.
[2024-06-03 01:15:42] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 2 ms to minimize.
[2024-06-03 01:15:43] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 2 ms to minimize.
[2024-06-03 01:15:43] [INFO ] Deduced a trap composed of 25 places in 164 ms of which 2 ms to minimize.
[2024-06-03 01:15:43] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/665 variables, and 68 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 61/68 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:15:47] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-06-03 01:15:48] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 2 ms to minimize.
[2024-06-03 01:15:48] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 2 ms to minimize.
[2024-06-03 01:15:48] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 2 ms to minimize.
[2024-06-03 01:15:48] [INFO ] Deduced a trap composed of 136 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:15:51] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 2 ms to minimize.
[2024-06-03 01:15:51] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 2 ms to minimize.
[2024-06-03 01:15:51] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2024-06-03 01:15:52] [INFO ] Deduced a trap composed of 47 places in 153 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 4/77 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:15:55] [INFO ] Deduced a trap composed of 24 places in 154 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:15:57] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 2 ms to minimize.
[2024-06-03 01:15:58] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 8 (OVERLAPS) 462/665 variables, 203/283 constraints. Problems are: Problem set: 50 solved, 411 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 411/694 constraints. Problems are: Problem set: 50 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 665/665 variables, and 694 constraints, problems are : Problem set: 50 solved, 411 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 411/461 constraints, Known Traps: 73/73 constraints]
After SMT, in 60457ms problems are : Problem set: 50 solved, 411 unsolved
Search for dead transitions found 50 dead transitions in 60464ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 203/223 places, 412/498 transitions.
Applied a total of 0 rules in 3 ms. Remains 203 /203 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60923 ms. Remains : 203/223 places, 412/498 transitions.
[2024-06-03 01:16:14] [INFO ] Flatten gal took : 24 ms
[2024-06-03 01:16:14] [INFO ] Flatten gal took : 22 ms
[2024-06-03 01:16:14] [INFO ] Input system was already deterministic with 412 transitions.
[2024-06-03 01:16:14] [INFO ] Flatten gal took : 22 ms
[2024-06-03 01:16:14] [INFO ] Flatten gal took : 22 ms
[2024-06-03 01:16:14] [INFO ] Time to serialize gal into /tmp/CTLFireability2579480303287803670.gal : 4 ms
[2024-06-03 01:16:14] [INFO ] Time to serialize properties into /tmp/CTLFireability12775054531390660009.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/CTLFireability2579480303287803670.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12775054531390660009.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-06-03 01:16:44] [INFO ] Flatten gal took : 13 ms
[2024-06-03 01:16:44] [INFO ] Applying decomposition
[2024-06-03 01:16:44] [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/graph11177881355456699617.txt' '-o' '/tmp/graph11177881355456699617.bin' '-w' '/tmp/graph11177881355456699617.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11177881355456699617.bin' '-l' '-1' '-v' '-w' '/tmp/graph11177881355456699617.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:16:44] [INFO ] Decomposing Gal with order
[2024-06-03 01:16:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:16:44] [INFO ] Removed a total of 947 redundant transitions.
[2024-06-03 01:16:44] [INFO ] Flatten gal took : 29 ms
[2024-06-03 01:16:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 6 ms.
[2024-06-03 01:16:44] [INFO ] Time to serialize gal into /tmp/CTLFireability11345760493609895415.gal : 3 ms
[2024-06-03 01:16:44] [INFO ] Time to serialize properties into /tmp/CTLFireability13319395491049974164.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/CTLFireability11345760493609895415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13319395491049974164.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,3.17448e+07,10.4802,243096,3253,30,142003,537,881,2.54603e+06,71,1459,0


Converting to forward existential form...Done !
original formula: EX((EG(EF((i0.i0.u10.p44==0))) * (AF(((((i9.u6.p24==1)&&(i1.u22.p91==1))&&((i6.i0.u67.p234==1)&&(i9.u70.p246==1)))||(i5.u4.p7==1))) + (((...412
=> equivalent forward existential formula: ([((EY(Init) * EG(E(TRUE U (i0.i0.u10.p44==0)))) * !(EG(!(((((i9.u6.p24==1)&&(i1.u22.p91==1))&&((i6.i0.u67.p234=...530
Reverse transition relation is NOT exact ! Due to transitions t35, t82, t85, t101, t105, t182, t188, t192, t197, t201, t206, t231, t239, t263, t271, t277, ...1113
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 204 transition count 463
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 204 transition count 463
Applied a total of 38 rules in 4 ms. Remains 204 /223 variables (removed 19) and now considering 463/498 (removed 35) transitions.
// Phase 1: matrix 463 rows 204 cols
[2024-06-03 01:17:14] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:17:14] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-03 01:17:14] [INFO ] Invariant cache hit.
[2024-06-03 01:17:15] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-06-03 01:17:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-03 01:17:22] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 3 ms to minimize.
[2024-06-03 01:17:23] [INFO ] Deduced a trap composed of 15 places in 284 ms of which 3 ms to minimize.
[2024-06-03 01:17:23] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 2 ms to minimize.
[2024-06-03 01:17:23] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-03 01:17:23] [INFO ] Deduced a trap composed of 38 places in 184 ms of which 2 ms to minimize.
[2024-06-03 01:17:23] [INFO ] Deduced a trap composed of 49 places in 245 ms of which 3 ms to minimize.
[2024-06-03 01:17:24] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 4 ms to minimize.
[2024-06-03 01:17:24] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 3 ms to minimize.
[2024-06-03 01:17:24] [INFO ] Deduced a trap composed of 39 places in 271 ms of which 4 ms to minimize.
[2024-06-03 01:17:24] [INFO ] Deduced a trap composed of 125 places in 214 ms of which 3 ms to minimize.
[2024-06-03 01:17:25] [INFO ] Deduced a trap composed of 40 places in 226 ms of which 3 ms to minimize.
[2024-06-03 01:17:25] [INFO ] Deduced a trap composed of 125 places in 262 ms of which 3 ms to minimize.
[2024-06-03 01:17:25] [INFO ] Deduced a trap composed of 113 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:17:25] [INFO ] Deduced a trap composed of 34 places in 257 ms of which 3 ms to minimize.
[2024-06-03 01:17:26] [INFO ] Deduced a trap composed of 125 places in 209 ms of which 3 ms to minimize.
[2024-06-03 01:17:27] [INFO ] Deduced a trap composed of 21 places in 285 ms of which 3 ms to minimize.
[2024-06-03 01:17:28] [INFO ] Deduced a trap composed of 115 places in 284 ms of which 3 ms to minimize.
[2024-06-03 01:17:28] [INFO ] Deduced a trap composed of 141 places in 277 ms of which 7 ms to minimize.
[2024-06-03 01:17:28] [INFO ] Deduced a trap composed of 47 places in 271 ms of which 3 ms to minimize.
[2024-06-03 01:17:28] [INFO ] Deduced a trap composed of 107 places in 257 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-03 01:17:29] [INFO ] Deduced a trap composed of 31 places in 141 ms of which 2 ms to minimize.
[2024-06-03 01:17:29] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 1 ms to minimize.
[2024-06-03 01:17:29] [INFO ] Deduced a trap composed of 20 places in 284 ms of which 4 ms to minimize.
[2024-06-03 01:17:31] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 4 ms to minimize.
[2024-06-03 01:17:31] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 3 ms to minimize.
[2024-06-03 01:17:32] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 4 ms to minimize.
[2024-06-03 01:17:32] [INFO ] Deduced a trap composed of 37 places in 274 ms of which 4 ms to minimize.
[2024-06-03 01:17:32] [INFO ] Deduced a trap composed of 24 places in 293 ms of which 4 ms to minimize.
[2024-06-03 01:17:33] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 3 ms to minimize.
[2024-06-03 01:17:33] [INFO ] Deduced a trap composed of 35 places in 275 ms of which 4 ms to minimize.
[2024-06-03 01:17:33] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 2 ms to minimize.
[2024-06-03 01:17:33] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 3 ms to minimize.
[2024-06-03 01:17:34] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 3 ms to minimize.
[2024-06-03 01:17:34] [INFO ] Deduced a trap composed of 25 places in 288 ms of which 4 ms to minimize.
[2024-06-03 01:17:34] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 4 ms to minimize.
[2024-06-03 01:17:35] [INFO ] Deduced a trap composed of 44 places in 282 ms of which 3 ms to minimize.
[2024-06-03 01:17:35] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 4 ms to minimize.
[2024-06-03 01:17:35] [INFO ] Deduced a trap composed of 107 places in 277 ms of which 4 ms to minimize.
[2024-06-03 01:17:36] [INFO ] Deduced a trap composed of 35 places in 253 ms of which 3 ms to minimize.
[2024-06-03 01:17:36] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-03 01:17:41] [INFO ] Deduced a trap composed of 25 places in 292 ms of which 3 ms to minimize.
[2024-06-03 01:17:42] [INFO ] Deduced a trap composed of 25 places in 271 ms of which 4 ms to minimize.
[2024-06-03 01:17:42] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 3 ms to minimize.
[2024-06-03 01:17:42] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 3 ms to minimize.
[2024-06-03 01:17:42] [INFO ] Deduced a trap composed of 23 places in 285 ms of which 4 ms to minimize.
[2024-06-03 01:17:43] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 3 ms to minimize.
[2024-06-03 01:17:43] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 3 ms to minimize.
[2024-06-03 01:17:43] [INFO ] Deduced a trap composed of 25 places in 255 ms of which 4 ms to minimize.
[2024-06-03 01:17:44] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 3 ms to minimize.
[2024-06-03 01:17:44] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 3 ms to minimize.
[2024-06-03 01:17:44] [INFO ] Deduced a trap composed of 23 places in 271 ms of which 3 ms to minimize.
[2024-06-03 01:17:44] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 3 ms to minimize.
[2024-06-03 01:17:45] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 204/667 variables, and 60 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 53/60 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-03 01:17:51] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 3 ms to minimize.
[2024-06-03 01:17:52] [INFO ] Deduced a trap composed of 22 places in 272 ms of which 3 ms to minimize.
[2024-06-03 01:17:53] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 3 ms to minimize.
[2024-06-03 01:17:53] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-03 01:17:56] [INFO ] Deduced a trap composed of 111 places in 282 ms of which 3 ms to minimize.
[2024-06-03 01:17:57] [INFO ] Deduced a trap composed of 133 places in 288 ms of which 3 ms to minimize.
[2024-06-03 01:17:57] [INFO ] Deduced a trap composed of 37 places in 229 ms of which 3 ms to minimize.
[2024-06-03 01:17:57] [INFO ] Deduced a trap composed of 36 places in 252 ms of which 3 ms to minimize.
[2024-06-03 01:17:58] [INFO ] Deduced a trap composed of 32 places in 291 ms of which 4 ms to minimize.
[2024-06-03 01:17:58] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 3 ms to minimize.
[2024-06-03 01:17:58] [INFO ] Deduced a trap composed of 24 places in 310 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-03 01:18:03] [INFO ] Deduced a trap composed of 139 places in 235 ms of which 3 ms to minimize.
[2024-06-03 01:18:03] [INFO ] Deduced a trap composed of 135 places in 261 ms of which 4 ms to minimize.
[2024-06-03 01:18:04] [INFO ] Deduced a trap composed of 26 places in 277 ms of which 4 ms to minimize.
[2024-06-03 01:18:04] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/204 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-03 01:18:09] [INFO ] Deduced a trap composed of 134 places in 255 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/204 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-06-03 01:18:13] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 3 ms to minimize.
[2024-06-03 01:18:14] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 204/667 variables, and 78 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/204 constraints, PredecessorRefiner: 0/462 constraints, Known Traps: 71/71 constraints]
After SMT, in 60345ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60350ms
Starting structural reductions in LTL mode, iteration 1 : 204/223 places, 463/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60938 ms. Remains : 204/223 places, 463/498 transitions.
[2024-06-03 01:18:15] [INFO ] Flatten gal took : 25 ms
[2024-06-03 01:18:15] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:18:15] [INFO ] Input system was already deterministic with 463 transitions.
[2024-06-03 01:18:15] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:18:15] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:18:15] [INFO ] Time to serialize gal into /tmp/CTLFireability10488113022780880004.gal : 5 ms
[2024-06-03 01:18:15] [INFO ] Time to serialize properties into /tmp/CTLFireability18085503204156982746.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/CTLFireability10488113022780880004.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18085503204156982746.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-06-03 01:18:45] [INFO ] Flatten gal took : 16 ms
[2024-06-03 01:18:45] [INFO ] Applying decomposition
[2024-06-03 01:18:45] [INFO ] Flatten gal took : 15 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/graph3356554902134537417.txt' '-o' '/tmp/graph3356554902134537417.bin' '-w' '/tmp/graph3356554902134537417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3356554902134537417.bin' '-l' '-1' '-v' '-w' '/tmp/graph3356554902134537417.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:18:46] [INFO ] Decomposing Gal with order
[2024-06-03 01:18:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:18:46] [INFO ] Removed a total of 1302 redundant transitions.
[2024-06-03 01:18:46] [INFO ] Flatten gal took : 34 ms
[2024-06-03 01:18:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 7 ms.
[2024-06-03 01:18:46] [INFO ] Time to serialize gal into /tmp/CTLFireability17462387295097191143.gal : 5 ms
[2024-06-03 01:18:46] [INFO ] Time to serialize properties into /tmp/CTLFireability12378036283925447850.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/CTLFireability17462387295097191143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12378036283925447850.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,3.22434e+07,15.9392,390116,5510,45,387218,670,1003,3.45855e+06,74,2638,0


Converting to forward existential form...Done !
original formula: AX(AF(((i2.u11.p57==1)||((i3.u4.p17==1)&&(i2.u15.p52==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((i2.u11.p57==1)||((i3.u4.p17==1)&&(i2.u15.p52==1)))))] = FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Graph (trivial) has 222 edges and 223 vertex of which 13 / 223 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 212 transition count 448
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 43 rules applied. Total rules applied 83 place count 173 transition count 444
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 89 place count 171 transition count 440
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 93 place count 167 transition count 440
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 93 place count 167 transition count 430
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 113 place count 157 transition count 430
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 135 place count 135 transition count 389
Iterating global reduction 4 with 22 rules applied. Total rules applied 157 place count 135 transition count 389
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 157 place count 135 transition count 388
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 134 transition count 388
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 160 place count 133 transition count 372
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 133 transition count 372
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 195 place count 116 transition count 355
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 200 place count 111 transition count 335
Iterating global reduction 4 with 5 rules applied. Total rules applied 205 place count 111 transition count 335
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 207 place count 109 transition count 331
Iterating global reduction 4 with 2 rules applied. Total rules applied 209 place count 109 transition count 331
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 218 place count 109 transition count 322
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 218 place count 109 transition count 321
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 220 place count 108 transition count 321
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 228 place count 104 transition count 317
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 230 place count 102 transition count 309
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 102 transition count 309
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 234 place count 100 transition count 305
Iterating global reduction 4 with 2 rules applied. Total rules applied 236 place count 100 transition count 305
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 237 place count 100 transition count 305
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 238 place count 99 transition count 304
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 99 transition count 304
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 98 transition count 303
Applied a total of 240 rules in 66 ms. Remains 98 /223 variables (removed 125) and now considering 303/498 (removed 195) transitions.
[2024-06-03 01:19:16] [INFO ] Flow matrix only has 301 transitions (discarded 2 similar events)
// Phase 1: matrix 301 rows 98 cols
[2024-06-03 01:19:16] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:19:16] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-03 01:19:16] [INFO ] Flow matrix only has 301 transitions (discarded 2 similar events)
[2024-06-03 01:19:16] [INFO ] Invariant cache hit.
[2024-06-03 01:19:16] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-03 01:19:16] [INFO ] Implicit Places using invariants and state equation in 357 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2024-06-03 01:19:16] [INFO ] Redundant transitions in 7 ms returned []
Running 298 sub problems to find dead transitions.
[2024-06-03 01:19:16] [INFO ] Flow matrix only has 301 transitions (discarded 2 similar events)
[2024-06-03 01:19:16] [INFO ] Invariant cache hit.
[2024-06-03 01:19:16] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-03 01:19:18] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-06-03 01:19:18] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 2 ms to minimize.
[2024-06-03 01:19:19] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-06-03 01:19:19] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-03 01:19:19] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (OVERLAPS) 3/98 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-03 01:19:23] [INFO ] Deduced a trap composed of 10 places in 137 ms of which 2 ms to minimize.
[2024-06-03 01:19:23] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
[2024-06-03 01:19:23] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-06-03 01:19:23] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2024-06-03 01:19:24] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 2 ms to minimize.
[2024-06-03 01:19:24] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 1 ms to minimize.
[2024-06-03 01:19:24] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-06-03 01:19:24] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2024-06-03 01:19:24] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-06-03 01:19:24] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 2 ms to minimize.
[2024-06-03 01:19:25] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 1 ms to minimize.
[2024-06-03 01:19:25] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 2 ms to minimize.
[2024-06-03 01:19:25] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 1 ms to minimize.
[2024-06-03 01:19:25] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 2 ms to minimize.
[2024-06-03 01:19:25] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 2 ms to minimize.
[2024-06-03 01:19:25] [INFO ] Deduced a trap composed of 14 places in 169 ms of which 2 ms to minimize.
[2024-06-03 01:19:25] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 17/29 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (OVERLAPS) 300/398 variables, 98/127 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 64/191 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 9 (OVERLAPS) 1/399 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 11 (OVERLAPS) 0/399 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 298 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 192 constraints, problems are : Problem set: 0 solved, 298 unsolved in 28351 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 298/298 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/95 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 3 (OVERLAPS) 3/98 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 298 unsolved
[2024-06-03 01:19:47] [INFO ] Deduced a trap composed of 32 places in 152 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 298 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 298 unsolved
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
At refinement iteration 7 (OVERLAPS) 300/398 variables, 98/128 constraints. Problems are: Problem set: 36 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 64/192 constraints. Problems are: Problem set: 36 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 262/454 constraints. Problems are: Problem set: 36 solved, 262 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/398 variables, 0/454 constraints. Problems are: Problem set: 36 solved, 262 unsolved
At refinement iteration 11 (OVERLAPS) 1/399 variables, 1/455 constraints. Problems are: Problem set: 36 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 455 constraints, problems are : Problem set: 36 solved, 262 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 98/98 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 262/298 constraints, Known Traps: 23/23 constraints]
After SMT, in 58734ms problems are : Problem set: 36 solved, 262 unsolved
Search for dead transitions found 36 dead transitions in 58741ms
Found 36 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 36 transitions
Dead transitions reduction (with SMT) removed 36 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 98/223 places, 267/498 transitions.
Applied a total of 0 rules in 9 ms. Remains 98 /98 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-06-03 01:20:15] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 59276 ms. Remains : 98/223 places, 267/498 transitions.
[2024-06-03 01:20:15] [INFO ] Flatten gal took : 7 ms
[2024-06-03 01:20:15] [INFO ] Flatten gal took : 7 ms
[2024-06-03 01:20:15] [INFO ] Input system was already deterministic with 267 transitions.
[2024-06-03 01:20:15] [INFO ] Flatten gal took : 8 ms
[2024-06-03 01:20:15] [INFO ] Flatten gal took : 9 ms
[2024-06-03 01:20:15] [INFO ] Time to serialize gal into /tmp/CTLFireability3825185978192045150.gal : 2 ms
[2024-06-03 01:20:15] [INFO ] Time to serialize properties into /tmp/CTLFireability4919247092319132734.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/CTLFireability3825185978192045150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4919247092319132734.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(((p160==1) + (((AF(((((p13==1)&&(p36==1))&&((p65==1)&&(p81==1)))&&(p251==1))) * (p25==1)) * ((p48==1)&&(p56==1))) * ((p81==1)&&(p251==...161
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p160==1))] != FALSE + [((((FwdU(Init,TRUE) * ((p81==1)&&(p251==1))) * ((p48==1)&&(p56==1))...250
(forward)formula 0,1,5.78973,134336,1,0,7,341705,8,1,662,358401,1
FORMULA MedleyA-PT-18-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 203 transition count 462
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 203 transition count 462
Applied a total of 40 rules in 4 ms. Remains 203 /223 variables (removed 20) and now considering 462/498 (removed 36) transitions.
// Phase 1: matrix 462 rows 203 cols
[2024-06-03 01:20:21] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:20:21] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-03 01:20:21] [INFO ] Invariant cache hit.
[2024-06-03 01:20:21] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-03 01:20:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:20:29] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 3 ms to minimize.
[2024-06-03 01:20:29] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 3 ms to minimize.
[2024-06-03 01:20:29] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-06-03 01:20:30] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 3 ms to minimize.
[2024-06-03 01:20:30] [INFO ] Deduced a trap composed of 41 places in 243 ms of which 3 ms to minimize.
[2024-06-03 01:20:30] [INFO ] Deduced a trap composed of 35 places in 246 ms of which 3 ms to minimize.
[2024-06-03 01:20:30] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 3 ms to minimize.
[2024-06-03 01:20:31] [INFO ] Deduced a trap composed of 30 places in 259 ms of which 3 ms to minimize.
[2024-06-03 01:20:31] [INFO ] Deduced a trap composed of 46 places in 255 ms of which 3 ms to minimize.
[2024-06-03 01:20:31] [INFO ] Deduced a trap composed of 35 places in 246 ms of which 3 ms to minimize.
[2024-06-03 01:20:31] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 3 ms to minimize.
[2024-06-03 01:20:32] [INFO ] Deduced a trap composed of 28 places in 301 ms of which 3 ms to minimize.
[2024-06-03 01:20:32] [INFO ] Deduced a trap composed of 35 places in 263 ms of which 4 ms to minimize.
[2024-06-03 01:20:32] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 3 ms to minimize.
[2024-06-03 01:20:33] [INFO ] Deduced a trap composed of 44 places in 329 ms of which 4 ms to minimize.
[2024-06-03 01:20:34] [INFO ] Deduced a trap composed of 25 places in 296 ms of which 4 ms to minimize.
[2024-06-03 01:20:34] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 4 ms to minimize.
[2024-06-03 01:20:35] [INFO ] Deduced a trap composed of 28 places in 284 ms of which 4 ms to minimize.
[2024-06-03 01:20:35] [INFO ] Deduced a trap composed of 34 places in 267 ms of which 3 ms to minimize.
[2024-06-03 01:20:35] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:20:36] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 1 ms to minimize.
[2024-06-03 01:20:36] [INFO ] Deduced a trap composed of 125 places in 179 ms of which 3 ms to minimize.
[2024-06-03 01:20:36] [INFO ] Deduced a trap composed of 125 places in 258 ms of which 3 ms to minimize.
[2024-06-03 01:20:36] [INFO ] Deduced a trap composed of 125 places in 268 ms of which 3 ms to minimize.
[2024-06-03 01:20:37] [INFO ] Deduced a trap composed of 125 places in 204 ms of which 3 ms to minimize.
[2024-06-03 01:20:37] [INFO ] Deduced a trap composed of 126 places in 212 ms of which 3 ms to minimize.
[2024-06-03 01:20:38] [INFO ] Deduced a trap composed of 138 places in 260 ms of which 3 ms to minimize.
[2024-06-03 01:20:39] [INFO ] Deduced a trap composed of 24 places in 260 ms of which 5 ms to minimize.
[2024-06-03 01:20:39] [INFO ] Deduced a trap composed of 35 places in 255 ms of which 4 ms to minimize.
[2024-06-03 01:20:39] [INFO ] Deduced a trap composed of 137 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:20:40] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 3 ms to minimize.
[2024-06-03 01:20:40] [INFO ] Deduced a trap composed of 23 places in 188 ms of which 4 ms to minimize.
[2024-06-03 01:20:40] [INFO ] Deduced a trap composed of 25 places in 192 ms of which 2 ms to minimize.
[2024-06-03 01:20:40] [INFO ] Deduced a trap composed of 22 places in 180 ms of which 3 ms to minimize.
[2024-06-03 01:20:40] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 2 ms to minimize.
[2024-06-03 01:20:41] [INFO ] Deduced a trap composed of 22 places in 265 ms of which 3 ms to minimize.
[2024-06-03 01:20:41] [INFO ] Deduced a trap composed of 24 places in 292 ms of which 3 ms to minimize.
[2024-06-03 01:20:41] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 3 ms to minimize.
[2024-06-03 01:20:42] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 4 ms to minimize.
[2024-06-03 01:20:42] [INFO ] Deduced a trap composed of 41 places in 274 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:20:47] [INFO ] Deduced a trap composed of 39 places in 237 ms of which 4 ms to minimize.
[2024-06-03 01:20:47] [INFO ] Deduced a trap composed of 40 places in 269 ms of which 3 ms to minimize.
[2024-06-03 01:20:48] [INFO ] Deduced a trap composed of 24 places in 268 ms of which 3 ms to minimize.
[2024-06-03 01:20:48] [INFO ] Deduced a trap composed of 126 places in 260 ms of which 3 ms to minimize.
[2024-06-03 01:20:48] [INFO ] Deduced a trap composed of 41 places in 267 ms of which 3 ms to minimize.
[2024-06-03 01:20:49] [INFO ] Deduced a trap composed of 23 places in 237 ms of which 3 ms to minimize.
[2024-06-03 01:20:49] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 3 ms to minimize.
[2024-06-03 01:20:49] [INFO ] Deduced a trap composed of 22 places in 255 ms of which 3 ms to minimize.
[2024-06-03 01:20:50] [INFO ] Deduced a trap composed of 140 places in 278 ms of which 4 ms to minimize.
[2024-06-03 01:20:50] [INFO ] Deduced a trap composed of 27 places in 247 ms of which 4 ms to minimize.
[2024-06-03 01:20:50] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 3 ms to minimize.
[2024-06-03 01:20:50] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 4 ms to minimize.
[2024-06-03 01:20:51] [INFO ] Deduced a trap composed of 22 places in 254 ms of which 3 ms to minimize.
[2024-06-03 01:20:51] [INFO ] Deduced a trap composed of 37 places in 243 ms of which 3 ms to minimize.
[2024-06-03 01:20:51] [INFO ] Deduced a trap composed of 113 places in 269 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/665 variables, and 62 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 55/62 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:20:56] [INFO ] Deduced a trap composed of 23 places in 247 ms of which 4 ms to minimize.
[2024-06-03 01:20:57] [INFO ] Deduced a trap composed of 25 places in 263 ms of which 4 ms to minimize.
[2024-06-03 01:20:57] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 4 ms to minimize.
[2024-06-03 01:20:58] [INFO ] Deduced a trap composed of 138 places in 237 ms of which 3 ms to minimize.
[2024-06-03 01:20:59] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 3 ms to minimize.
[2024-06-03 01:20:59] [INFO ] Deduced a trap composed of 29 places in 241 ms of which 3 ms to minimize.
[2024-06-03 01:21:01] [INFO ] Deduced a trap composed of 48 places in 229 ms of which 3 ms to minimize.
[2024-06-03 01:21:01] [INFO ] Deduced a trap composed of 50 places in 219 ms of which 3 ms to minimize.
[2024-06-03 01:21:01] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 9/71 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:21:04] [INFO ] Deduced a trap composed of 30 places in 278 ms of which 4 ms to minimize.
[2024-06-03 01:21:05] [INFO ] Deduced a trap composed of 23 places in 273 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-03 01:21:10] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 2 ms to minimize.
[2024-06-03 01:21:10] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 3 ms to minimize.
[2024-06-03 01:21:10] [INFO ] Deduced a trap composed of 28 places in 255 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 7 (OVERLAPS) 462/665 variables, 203/279 constraints. Problems are: Problem set: 50 solved, 411 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 411/690 constraints. Problems are: Problem set: 50 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 665/665 variables, and 690 constraints, problems are : Problem set: 50 solved, 411 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 411/461 constraints, Known Traps: 69/69 constraints]
After SMT, in 60533ms problems are : Problem set: 50 solved, 411 unsolved
Search for dead transitions found 50 dead transitions in 60539ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in LTL mode, iteration 1 : 203/223 places, 412/498 transitions.
Applied a total of 0 rules in 2 ms. Remains 203 /203 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60988 ms. Remains : 203/223 places, 412/498 transitions.
[2024-06-03 01:21:22] [INFO ] Flatten gal took : 12 ms
[2024-06-03 01:21:22] [INFO ] Flatten gal took : 13 ms
[2024-06-03 01:21:22] [INFO ] Input system was already deterministic with 412 transitions.
[2024-06-03 01:21:22] [INFO ] Flatten gal took : 13 ms
[2024-06-03 01:21:22] [INFO ] Flatten gal took : 12 ms
[2024-06-03 01:21:22] [INFO ] Time to serialize gal into /tmp/CTLFireability15456512132250066116.gal : 2 ms
[2024-06-03 01:21:22] [INFO ] Time to serialize properties into /tmp/CTLFireability11712121748776084581.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/CTLFireability15456512132250066116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11712121748776084581.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-06-03 01:21:52] [INFO ] Flatten gal took : 12 ms
[2024-06-03 01:21:52] [INFO ] Applying decomposition
[2024-06-03 01:21:52] [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/graph9323428632254973553.txt' '-o' '/tmp/graph9323428632254973553.bin' '-w' '/tmp/graph9323428632254973553.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9323428632254973553.bin' '-l' '-1' '-v' '-w' '/tmp/graph9323428632254973553.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:21:52] [INFO ] Decomposing Gal with order
[2024-06-03 01:21:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:21:52] [INFO ] Removed a total of 941 redundant transitions.
[2024-06-03 01:21:52] [INFO ] Flatten gal took : 28 ms
[2024-06-03 01:21:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 6 ms.
[2024-06-03 01:21:52] [INFO ] Time to serialize gal into /tmp/CTLFireability18267911067634807845.gal : 4 ms
[2024-06-03 01:21:52] [INFO ] Time to serialize properties into /tmp/CTLFireability3075772728634435369.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/CTLFireability18267911067634807845.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3075772728634435369.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,3.19751e+07,16.4321,298284,2471,33,306877,429,1051,2.38839e+06,75,1301,0


Converting to forward existential form...Done !
original formula: AF(((EG(AX(AG((i10.i1.u23.p96==1)))) + AX(((E((i10.i0.u9.p48==1) U ((i0.u12.p56==1)&&(i4.i2.u31.p164==1))) * (i4.i2.u31.p166==1)) * ((i2....294
=> equivalent forward existential formula: [FwdG(Init,!(((EG(!(EX(!(!(E(TRUE U !((i10.i1.u23.p96==1)))))))) + !(EX(!(((E((i10.i0.u9.p48==1) U ((i0.u12.p56=...387
Reverse transition relation is NOT exact ! Due to transitions t28, t35, t39, t56, t101, t114, t118, t183, t188, t190, t197, t230, t232, t238, t240, t262, t...1158
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 201 transition count 458
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 201 transition count 458
Applied a total of 44 rules in 3 ms. Remains 201 /223 variables (removed 22) and now considering 458/498 (removed 40) transitions.
// Phase 1: matrix 458 rows 201 cols
[2024-06-03 01:22:22] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 01:22:22] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-03 01:22:22] [INFO ] Invariant cache hit.
[2024-06-03 01:22:23] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Running 457 sub problems to find dead transitions.
[2024-06-03 01:22:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 457 unsolved
At refinement iteration 1 (OVERLAPS) 1/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:22:30] [INFO ] Deduced a trap composed of 15 places in 236 ms of which 3 ms to minimize.
[2024-06-03 01:22:30] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 3 ms to minimize.
[2024-06-03 01:22:30] [INFO ] Deduced a trap composed of 15 places in 106 ms of which 2 ms to minimize.
[2024-06-03 01:22:31] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 3 ms to minimize.
[2024-06-03 01:22:31] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 3 ms to minimize.
[2024-06-03 01:22:31] [INFO ] Deduced a trap composed of 46 places in 259 ms of which 3 ms to minimize.
[2024-06-03 01:22:31] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 3 ms to minimize.
[2024-06-03 01:22:32] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 3 ms to minimize.
[2024-06-03 01:22:32] [INFO ] Deduced a trap composed of 35 places in 227 ms of which 3 ms to minimize.
[2024-06-03 01:22:32] [INFO ] Deduced a trap composed of 40 places in 268 ms of which 4 ms to minimize.
[2024-06-03 01:22:32] [INFO ] Deduced a trap composed of 125 places in 237 ms of which 3 ms to minimize.
[2024-06-03 01:22:33] [INFO ] Deduced a trap composed of 20 places in 290 ms of which 3 ms to minimize.
[2024-06-03 01:22:33] [INFO ] Deduced a trap composed of 125 places in 170 ms of which 3 ms to minimize.
[2024-06-03 01:22:33] [INFO ] Deduced a trap composed of 125 places in 212 ms of which 3 ms to minimize.
[2024-06-03 01:22:33] [INFO ] Deduced a trap composed of 125 places in 299 ms of which 3 ms to minimize.
[2024-06-03 01:22:34] [INFO ] Deduced a trap composed of 36 places in 287 ms of which 4 ms to minimize.
[2024-06-03 01:22:34] [INFO ] Deduced a trap composed of 36 places in 282 ms of which 3 ms to minimize.
[2024-06-03 01:22:35] [INFO ] Deduced a trap composed of 27 places in 222 ms of which 2 ms to minimize.
[2024-06-03 01:22:36] [INFO ] Deduced a trap composed of 24 places in 298 ms of which 4 ms to minimize.
[2024-06-03 01:22:36] [INFO ] Deduced a trap composed of 28 places in 293 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:22:37] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 2 ms to minimize.
[2024-06-03 01:22:37] [INFO ] Deduced a trap composed of 32 places in 142 ms of which 1 ms to minimize.
[2024-06-03 01:22:37] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2024-06-03 01:22:38] [INFO ] Deduced a trap composed of 26 places in 271 ms of which 4 ms to minimize.
[2024-06-03 01:22:39] [INFO ] Deduced a trap composed of 22 places in 298 ms of which 4 ms to minimize.
[2024-06-03 01:22:39] [INFO ] Deduced a trap composed of 24 places in 300 ms of which 4 ms to minimize.
[2024-06-03 01:22:39] [INFO ] Deduced a trap composed of 22 places in 281 ms of which 3 ms to minimize.
[2024-06-03 01:22:40] [INFO ] Deduced a trap composed of 28 places in 262 ms of which 3 ms to minimize.
[2024-06-03 01:22:40] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 3 ms to minimize.
[2024-06-03 01:22:40] [INFO ] Deduced a trap composed of 24 places in 299 ms of which 4 ms to minimize.
[2024-06-03 01:22:41] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 3 ms to minimize.
[2024-06-03 01:22:41] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 3 ms to minimize.
[2024-06-03 01:22:41] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 4 ms to minimize.
[2024-06-03 01:22:42] [INFO ] Deduced a trap composed of 38 places in 284 ms of which 4 ms to minimize.
[2024-06-03 01:22:42] [INFO ] Deduced a trap composed of 38 places in 275 ms of which 4 ms to minimize.
[2024-06-03 01:22:42] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 3 ms to minimize.
[2024-06-03 01:22:42] [INFO ] Deduced a trap composed of 24 places in 246 ms of which 3 ms to minimize.
[2024-06-03 01:22:43] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 3 ms to minimize.
[2024-06-03 01:22:43] [INFO ] Deduced a trap composed of 37 places in 274 ms of which 4 ms to minimize.
[2024-06-03 01:22:43] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 457 unsolved
[2024-06-03 01:22:47] [INFO ] Deduced a trap composed of 32 places in 317 ms of which 4 ms to minimize.
[2024-06-03 01:22:47] [INFO ] Deduced a trap composed of 31 places in 289 ms of which 3 ms to minimize.
[2024-06-03 01:22:48] [INFO ] Deduced a trap composed of 29 places in 276 ms of which 4 ms to minimize.
[2024-06-03 01:22:48] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 4 ms to minimize.
[2024-06-03 01:22:48] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 3 ms to minimize.
[2024-06-03 01:22:49] [INFO ] Deduced a trap composed of 25 places in 279 ms of which 3 ms to minimize.
[2024-06-03 01:22:49] [INFO ] Deduced a trap composed of 31 places in 297 ms of which 4 ms to minimize.
[2024-06-03 01:22:49] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 3 ms to minimize.
[2024-06-03 01:22:49] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 3 ms to minimize.
[2024-06-03 01:22:50] [INFO ] Deduced a trap composed of 25 places in 270 ms of which 4 ms to minimize.
[2024-06-03 01:22:50] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 4 ms to minimize.
[2024-06-03 01:22:50] [INFO ] Deduced a trap composed of 23 places in 275 ms of which 4 ms to minimize.
[2024-06-03 01:22:51] [INFO ] Deduced a trap composed of 23 places in 289 ms of which 3 ms to minimize.
[2024-06-03 01:22:52] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 4 ms to minimize.
[2024-06-03 01:22:52] [INFO ] Deduced a trap composed of 29 places in 273 ms of which 3 ms to minimize.
[2024-06-03 01:22:52] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 3 ms to minimize.
[2024-06-03 01:22:53] [INFO ] Deduced a trap composed of 41 places in 266 ms of which 3 ms to minimize.
[2024-06-03 01:22:53] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 3 ms to minimize.
SMT process timed out in 30714ms, After SMT, problems are : Problem set: 0 solved, 457 unsolved
Search for dead transitions found 0 dead transitions in 30722ms
Starting structural reductions in LTL mode, iteration 1 : 201/223 places, 458/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31285 ms. Remains : 201/223 places, 458/498 transitions.
[2024-06-03 01:22:53] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:22:53] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:22:53] [INFO ] Input system was already deterministic with 458 transitions.
[2024-06-03 01:22:53] [INFO ] Flatten gal took : 26 ms
[2024-06-03 01:22:54] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:22:54] [INFO ] Time to serialize gal into /tmp/CTLFireability11837474009992156566.gal : 4 ms
[2024-06-03 01:22:54] [INFO ] Time to serialize properties into /tmp/CTLFireability881993810990514739.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/CTLFireability11837474009992156566.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability881993810990514739.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-06-03 01:23:24] [INFO ] Flatten gal took : 17 ms
[2024-06-03 01:23:24] [INFO ] Applying decomposition
[2024-06-03 01:23:24] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4018015779647197437.txt' '-o' '/tmp/graph4018015779647197437.bin' '-w' '/tmp/graph4018015779647197437.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4018015779647197437.bin' '-l' '-1' '-v' '-w' '/tmp/graph4018015779647197437.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:23:24] [INFO ] Decomposing Gal with order
[2024-06-03 01:23:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:23:24] [INFO ] Removed a total of 1318 redundant transitions.
[2024-06-03 01:23:24] [INFO ] Flatten gal took : 33 ms
[2024-06-03 01:23:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 5 ms.
[2024-06-03 01:23:24] [INFO ] Time to serialize gal into /tmp/CTLFireability1567772819966087622.gal : 5 ms
[2024-06-03 01:23:24] [INFO ] Time to serialize properties into /tmp/CTLFireability16677742540899755990.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/CTLFireability1567772819966087622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16677742540899755990.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.94267e+07,18.0921,458804,4901,24,270085,457,982,4.95833e+06,57,1439,0


Converting to forward existential form...Done !
original formula: AG(AX(AF(AX((((i7.u18.p90==1)&&(i5.u69.p233==1))||((((i0.u4.p18==1)&&(i7.u9.p48==1))&&((i7.u15.p69==1)&&(i7.u20.p83==1)))&&(i7.u72.p248==...163
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!(!(EX(!((((i7.u18.p90==1)&&(i5.u69.p233==1))||((((i0.u4.p18==1)&&(i7.u9.p48==1))&&((i...221
Reverse transition relation is NOT exact ! Due to transitions t30, t94, t105, t159, t175, t186, t190, t202, t204, t226, t234, t258, t266, t278, t279, t296,...941
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 204 transition count 464
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 204 transition count 464
Applied a total of 38 rules in 4 ms. Remains 204 /223 variables (removed 19) and now considering 464/498 (removed 34) transitions.
// Phase 1: matrix 464 rows 204 cols
[2024-06-03 01:23:54] [INFO ] Computed 7 invariants in 3 ms
[2024-06-03 01:23:54] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-03 01:23:54] [INFO ] Invariant cache hit.
[2024-06-03 01:23:54] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Running 463 sub problems to find dead transitions.
[2024-06-03 01:23:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/203 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 463 unsolved
At refinement iteration 1 (OVERLAPS) 1/204 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:24:02] [INFO ] Deduced a trap composed of 12 places in 233 ms of which 3 ms to minimize.
[2024-06-03 01:24:02] [INFO ] Deduced a trap composed of 15 places in 219 ms of which 3 ms to minimize.
[2024-06-03 01:24:03] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 3 ms to minimize.
[2024-06-03 01:24:03] [INFO ] Deduced a trap composed of 15 places in 215 ms of which 3 ms to minimize.
[2024-06-03 01:24:03] [INFO ] Deduced a trap composed of 19 places in 252 ms of which 3 ms to minimize.
[2024-06-03 01:24:03] [INFO ] Deduced a trap composed of 33 places in 270 ms of which 3 ms to minimize.
[2024-06-03 01:24:04] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 3 ms to minimize.
[2024-06-03 01:24:04] [INFO ] Deduced a trap composed of 127 places in 205 ms of which 3 ms to minimize.
[2024-06-03 01:24:04] [INFO ] Deduced a trap composed of 41 places in 221 ms of which 3 ms to minimize.
[2024-06-03 01:24:04] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 3 ms to minimize.
[2024-06-03 01:24:06] [INFO ] Deduced a trap composed of 45 places in 269 ms of which 3 ms to minimize.
[2024-06-03 01:24:06] [INFO ] Deduced a trap composed of 24 places in 279 ms of which 4 ms to minimize.
[2024-06-03 01:24:07] [INFO ] Deduced a trap composed of 30 places in 293 ms of which 4 ms to minimize.
[2024-06-03 01:24:07] [INFO ] Deduced a trap composed of 25 places in 300 ms of which 3 ms to minimize.
[2024-06-03 01:24:07] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:24:08] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 3 ms to minimize.
[2024-06-03 01:24:08] [INFO ] Deduced a trap composed of 127 places in 276 ms of which 3 ms to minimize.
[2024-06-03 01:24:08] [INFO ] Deduced a trap composed of 45 places in 237 ms of which 3 ms to minimize.
[2024-06-03 01:24:08] [INFO ] Deduced a trap composed of 28 places in 268 ms of which 3 ms to minimize.
[2024-06-03 01:24:09] [INFO ] Deduced a trap composed of 23 places in 256 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:24:09] [INFO ] Deduced a trap composed of 39 places in 290 ms of which 4 ms to minimize.
[2024-06-03 01:24:10] [INFO ] Deduced a trap composed of 45 places in 285 ms of which 4 ms to minimize.
[2024-06-03 01:24:10] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 3 ms to minimize.
[2024-06-03 01:24:11] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 3 ms to minimize.
[2024-06-03 01:24:11] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 3 ms to minimize.
[2024-06-03 01:24:11] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 2 ms to minimize.
[2024-06-03 01:24:12] [INFO ] Deduced a trap composed of 139 places in 268 ms of which 4 ms to minimize.
[2024-06-03 01:24:12] [INFO ] Deduced a trap composed of 47 places in 277 ms of which 3 ms to minimize.
[2024-06-03 01:24:13] [INFO ] Deduced a trap composed of 22 places in 288 ms of which 3 ms to minimize.
[2024-06-03 01:24:13] [INFO ] Deduced a trap composed of 37 places in 240 ms of which 3 ms to minimize.
[2024-06-03 01:24:13] [INFO ] Deduced a trap composed of 108 places in 208 ms of which 3 ms to minimize.
[2024-06-03 01:24:14] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 3 ms to minimize.
[2024-06-03 01:24:14] [INFO ] Deduced a trap composed of 24 places in 273 ms of which 4 ms to minimize.
[2024-06-03 01:24:14] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 3 ms to minimize.
[2024-06-03 01:24:14] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 4 ms to minimize.
[2024-06-03 01:24:15] [INFO ] Deduced a trap composed of 24 places in 266 ms of which 3 ms to minimize.
[2024-06-03 01:24:15] [INFO ] Deduced a trap composed of 35 places in 277 ms of which 3 ms to minimize.
[2024-06-03 01:24:15] [INFO ] Deduced a trap composed of 136 places in 264 ms of which 4 ms to minimize.
[2024-06-03 01:24:16] [INFO ] Deduced a trap composed of 29 places in 271 ms of which 3 ms to minimize.
[2024-06-03 01:24:16] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 463 unsolved
[2024-06-03 01:24:21] [INFO ] Deduced a trap composed of 33 places in 286 ms of which 4 ms to minimize.
[2024-06-03 01:24:21] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 3 ms to minimize.
[2024-06-03 01:24:22] [INFO ] Deduced a trap composed of 29 places in 246 ms of which 3 ms to minimize.
[2024-06-03 01:24:22] [INFO ] Deduced a trap composed of 37 places in 273 ms of which 4 ms to minimize.
[2024-06-03 01:24:22] [INFO ] Deduced a trap composed of 23 places in 286 ms of which 3 ms to minimize.
[2024-06-03 01:24:23] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 4 ms to minimize.
[2024-06-03 01:24:23] [INFO ] Deduced a trap composed of 35 places in 242 ms of which 3 ms to minimize.
[2024-06-03 01:24:23] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 3 ms to minimize.
[2024-06-03 01:24:24] [INFO ] Deduced a trap composed of 22 places in 255 ms of which 3 ms to minimize.
[2024-06-03 01:24:25] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 3 ms to minimize.
[2024-06-03 01:24:25] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 3 ms to minimize.
SMT process timed out in 30731ms, After SMT, problems are : Problem set: 0 solved, 463 unsolved
Search for dead transitions found 0 dead transitions in 30738ms
Starting structural reductions in LTL mode, iteration 1 : 204/223 places, 464/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31343 ms. Remains : 204/223 places, 464/498 transitions.
[2024-06-03 01:24:25] [INFO ] Flatten gal took : 28 ms
[2024-06-03 01:24:25] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:24:25] [INFO ] Input system was already deterministic with 464 transitions.
[2024-06-03 01:24:25] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:24:25] [INFO ] Flatten gal took : 27 ms
[2024-06-03 01:24:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1674607052817858592.gal : 5 ms
[2024-06-03 01:24:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6135300115581421254.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/CTLFireability1674607052817858592.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6135300115581421254.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-06-03 01:24:55] [INFO ] Flatten gal took : 15 ms
[2024-06-03 01:24:55] [INFO ] Applying decomposition
[2024-06-03 01:24:55] [INFO ] Flatten gal took : 15 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/graph17731761413985752504.txt' '-o' '/tmp/graph17731761413985752504.bin' '-w' '/tmp/graph17731761413985752504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17731761413985752504.bin' '-l' '-1' '-v' '-w' '/tmp/graph17731761413985752504.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:24:55] [INFO ] Decomposing Gal with order
[2024-06-03 01:24:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:24:55] [INFO ] Removed a total of 1331 redundant transitions.
[2024-06-03 01:24:55] [INFO ] Flatten gal took : 34 ms
[2024-06-03 01:24:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 8 ms.
[2024-06-03 01:24:55] [INFO ] Time to serialize gal into /tmp/CTLFireability4716070324057194518.gal : 5 ms
[2024-06-03 01:24:55] [INFO ] Time to serialize properties into /tmp/CTLFireability3976951191001609271.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/CTLFireability4716070324057194518.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3976951191001609271.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,3.28287e+07,3.8361,75232,2494,25,84824,314,1202,425181,62,857,0


Converting to forward existential form...Done !
original formula: EX(A((AF(((i1.i0.u12.p65==1)&&(i2.i2.u49.p164==1))) * (!(((i0.u7.p29==1)&&(i4.u25.p102==1))) + (EG((i4.u72.p239==1)) * EF((i6.i2.u61.p221...372
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(((EX((i2.i1.u43.p149==1)) + (i2.i1.u40.p143==1)) + (((i2.i0.u32.p121==1)&&(i6.i2.u61.p204==...869
Reverse transition relation is NOT exact ! Due to transitions t16, t39, t48, t81, t107, t127, t130, t163, t179, t196, t206, t210, t232, t234, t240, t242, t...1234
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Graph (trivial) has 238 edges and 223 vertex of which 13 / 223 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 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 45 place count 212 transition count 443
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 93 place count 168 transition count 439
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 166 transition count 439
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 95 place count 166 transition count 430
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 113 place count 157 transition count 430
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 134 place count 136 transition count 391
Iterating global reduction 3 with 21 rules applied. Total rules applied 155 place count 136 transition count 391
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 155 place count 136 transition count 390
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 135 transition count 390
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 195 place count 116 transition count 371
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 200 place count 111 transition count 347
Iterating global reduction 3 with 5 rules applied. Total rules applied 205 place count 111 transition count 347
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 207 place count 109 transition count 343
Iterating global reduction 3 with 2 rules applied. Total rules applied 209 place count 109 transition count 343
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 221 place count 109 transition count 331
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 221 place count 109 transition count 329
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 225 place count 107 transition count 329
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 237 place count 101 transition count 323
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 239 place count 99 transition count 315
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 99 transition count 315
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 243 place count 97 transition count 311
Iterating global reduction 3 with 2 rules applied. Total rules applied 245 place count 97 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 246 place count 96 transition count 310
Applied a total of 246 rules in 52 ms. Remains 96 /223 variables (removed 127) and now considering 310/498 (removed 188) transitions.
[2024-06-03 01:25:26] [INFO ] Flow matrix only has 308 transitions (discarded 2 similar events)
// Phase 1: matrix 308 rows 96 cols
[2024-06-03 01:25:26] [INFO ] Computed 7 invariants in 1 ms
[2024-06-03 01:25:26] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-03 01:25:26] [INFO ] Flow matrix only has 308 transitions (discarded 2 similar events)
[2024-06-03 01:25:26] [INFO ] Invariant cache hit.
[2024-06-03 01:25:26] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-03 01:25:26] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-06-03 01:25:26] [INFO ] Redundant transitions in 2 ms returned []
Running 305 sub problems to find dead transitions.
[2024-06-03 01:25:26] [INFO ] Flow matrix only has 308 transitions (discarded 2 similar events)
[2024-06-03 01:25:26] [INFO ] Invariant cache hit.
[2024-06-03 01:25:26] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-03 01:25:28] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2024-06-03 01:25:28] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 2 ms to minimize.
[2024-06-03 01:25:28] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 2 ms to minimize.
[2024-06-03 01:25:29] [INFO ] Deduced a trap composed of 29 places in 158 ms of which 2 ms to minimize.
[2024-06-03 01:25:29] [INFO ] Deduced a trap composed of 7 places in 129 ms of which 2 ms to minimize.
[2024-06-03 01:25:29] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 2 ms to minimize.
[2024-06-03 01:25:29] [INFO ] Deduced a trap composed of 18 places in 137 ms of which 1 ms to minimize.
[2024-06-03 01:25:29] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 2 ms to minimize.
[2024-06-03 01:25:29] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 2 ms to minimize.
[2024-06-03 01:25:29] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-06-03 01:25:29] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-03 01:25:30] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-03 01:25:30] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-06-03 01:25:30] [INFO ] Deduced a trap composed of 27 places in 125 ms of which 2 ms to minimize.
[2024-06-03 01:25:31] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 2 ms to minimize.
[2024-06-03 01:25:31] [INFO ] Deduced a trap composed of 29 places in 145 ms of which 2 ms to minimize.
[2024-06-03 01:25:31] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 2 ms to minimize.
[2024-06-03 01:25:31] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 307/403 variables, 96/121 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 64/185 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-03 01:25:39] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 187 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
At refinement iteration 3 (OVERLAPS) 307/403 variables, 96/122 constraints. Problems are: Problem set: 42 solved, 263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 64/186 constraints. Problems are: Problem set: 42 solved, 263 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 263/449 constraints. Problems are: Problem set: 42 solved, 263 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 0/449 constraints. Problems are: Problem set: 42 solved, 263 unsolved
At refinement iteration 7 (OVERLAPS) 1/404 variables, 1/450 constraints. Problems are: Problem set: 42 solved, 263 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/450 constraints. Problems are: Problem set: 42 solved, 263 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 450 constraints, problems are : Problem set: 42 solved, 263 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 96/96 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 263/305 constraints, Known Traps: 19/19 constraints]
After SMT, in 60401ms problems are : Problem set: 42 solved, 263 unsolved
Search for dead transitions found 42 dead transitions in 60405ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) removed 42 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 96/223 places, 268/498 transitions.
Applied a total of 0 rules in 8 ms. Remains 96 /96 variables (removed 0) and now considering 268/268 (removed 0) transitions.
[2024-06-03 01:26:26] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 60824 ms. Remains : 96/223 places, 268/498 transitions.
[2024-06-03 01:26:26] [INFO ] Flatten gal took : 11 ms
[2024-06-03 01:26:26] [INFO ] Flatten gal took : 12 ms
[2024-06-03 01:26:26] [INFO ] Input system was already deterministic with 268 transitions.
[2024-06-03 01:26:26] [INFO ] Flatten gal took : 12 ms
[2024-06-03 01:26:26] [INFO ] Flatten gal took : 12 ms
[2024-06-03 01:26:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10614429590902287623.gal : 3 ms
[2024-06-03 01:26:26] [INFO ] Time to serialize properties into /tmp/CTLFireability3671482582281476518.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/CTLFireability10614429590902287623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3671482582281476518.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,1.07318e+06,8.01365,167268,2,19518,5,383441,6,0,652,468166,0


Converting to forward existential form...Done !
original formula: (EF(((p57==1) * AF((p212==0)))) + (EG(EF(((p16==0)||(p129==0)))) * AF((p92==1))))
=> equivalent forward existential formula: ([((Init * !(E(TRUE U ((p57==1) * !(EG(!((p212==0)))))))) * !(EG(E(TRUE U ((p16==0)||(p129==0))))))] = FALSE * [...237
Reverse transition relation is NOT exact ! Due to transitions t5, t6, t8, t10, t11, t18, t24, t25, t27, t29, t30, t38, t42, t43, t44, t47, t49, t50, t51, t...595
Detected timeout of ITS tools.
[2024-06-03 01:26:57] [INFO ] Flatten gal took : 7 ms
[2024-06-03 01:26:57] [INFO ] Applying decomposition
[2024-06-03 01:26:57] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4531948924197444504.txt' '-o' '/tmp/graph4531948924197444504.bin' '-w' '/tmp/graph4531948924197444504.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4531948924197444504.bin' '-l' '-1' '-v' '-w' '/tmp/graph4531948924197444504.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:26:57] [INFO ] Decomposing Gal with order
[2024-06-03 01:26:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:26:57] [INFO ] Removed a total of 528 redundant transitions.
[2024-06-03 01:26:57] [INFO ] Flatten gal took : 18 ms
[2024-06-03 01:26:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 4 ms.
[2024-06-03 01:26:57] [INFO ] Time to serialize gal into /tmp/CTLFireability14126569860379818827.gal : 2 ms
[2024-06-03 01:26:57] [INFO ] Time to serialize properties into /tmp/CTLFireability10193672526674063152.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/CTLFireability14126569860379818827.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10193672526674063152.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07318e+06,1.26537,28840,748,307,40517,11483,541,71745,99,49653,0


Converting to forward existential form...Done !
original formula: (EF(((i0.u4.p57==1) * AF((i7.i0.u28.p212==0)))) + (EG(EF(((i2.u0.p16==0)||(i4.u17.p129==0)))) * AF((i1.u12.p92==1))))
=> equivalent forward existential formula: ([((Init * !(E(TRUE U ((i0.u4.p57==1) * !(EG(!((i7.i0.u28.p212==0)))))))) * !(EG(E(TRUE U ((i2.u0.p16==0)||(i4.u...289
Reverse transition relation is NOT exact ! Due to transitions t18, t29, t38, t54, t69, t71, t77, t81, t82, t83, t85, t86, t88, t111, t115, t116, t117, t118...657
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
(forward)formula 0,1,10.5131,223568,1,0,269059,30033,3218,1.35193e+06,495,103344,611561
FORMULA MedleyA-PT-18-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 223/223 places, 498/498 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 203 transition count 461
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 203 transition count 461
Applied a total of 40 rules in 4 ms. Remains 203 /223 variables (removed 20) and now considering 461/498 (removed 37) transitions.
// Phase 1: matrix 461 rows 203 cols
[2024-06-03 01:27:07] [INFO ] Computed 7 invariants in 2 ms
[2024-06-03 01:27:07] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-03 01:27:07] [INFO ] Invariant cache hit.
[2024-06-03 01:27:08] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-06-03 01:27:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-03 01:27:15] [INFO ] Deduced a trap composed of 15 places in 224 ms of which 2 ms to minimize.
[2024-06-03 01:27:15] [INFO ] Deduced a trap composed of 20 places in 236 ms of which 3 ms to minimize.
[2024-06-03 01:27:15] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 3 ms to minimize.
[2024-06-03 01:27:16] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 3 ms to minimize.
[2024-06-03 01:27:16] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2024-06-03 01:27:16] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 2 ms to minimize.
[2024-06-03 01:27:16] [INFO ] Deduced a trap composed of 35 places in 243 ms of which 3 ms to minimize.
[2024-06-03 01:27:17] [INFO ] Deduced a trap composed of 19 places in 211 ms of which 2 ms to minimize.
[2024-06-03 01:27:17] [INFO ] Deduced a trap composed of 33 places in 245 ms of which 4 ms to minimize.
[2024-06-03 01:27:17] [INFO ] Deduced a trap composed of 35 places in 254 ms of which 4 ms to minimize.
[2024-06-03 01:27:17] [INFO ] Deduced a trap composed of 15 places in 247 ms of which 4 ms to minimize.
[2024-06-03 01:27:18] [INFO ] Deduced a trap composed of 126 places in 184 ms of which 3 ms to minimize.
[2024-06-03 01:27:18] [INFO ] Deduced a trap composed of 126 places in 198 ms of which 3 ms to minimize.
[2024-06-03 01:27:18] [INFO ] Deduced a trap composed of 126 places in 202 ms of which 3 ms to minimize.
[2024-06-03 01:27:18] [INFO ] Deduced a trap composed of 39 places in 229 ms of which 3 ms to minimize.
[2024-06-03 01:27:20] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 3 ms to minimize.
[2024-06-03 01:27:20] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 4 ms to minimize.
[2024-06-03 01:27:20] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 3 ms to minimize.
[2024-06-03 01:27:21] [INFO ] Deduced a trap composed of 31 places in 299 ms of which 4 ms to minimize.
[2024-06-03 01:27:21] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-03 01:27:22] [INFO ] Deduced a trap composed of 46 places in 280 ms of which 4 ms to minimize.
[2024-06-03 01:27:22] [INFO ] Deduced a trap composed of 27 places in 189 ms of which 2 ms to minimize.
[2024-06-03 01:27:23] [INFO ] Deduced a trap composed of 35 places in 274 ms of which 3 ms to minimize.
[2024-06-03 01:27:24] [INFO ] Deduced a trap composed of 35 places in 283 ms of which 3 ms to minimize.
[2024-06-03 01:27:24] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 3 ms to minimize.
[2024-06-03 01:27:24] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 3 ms to minimize.
[2024-06-03 01:27:24] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 3 ms to minimize.
[2024-06-03 01:27:25] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 2 ms to minimize.
[2024-06-03 01:27:25] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 3 ms to minimize.
[2024-06-03 01:27:25] [INFO ] Deduced a trap composed of 23 places in 212 ms of which 3 ms to minimize.
[2024-06-03 01:27:25] [INFO ] Deduced a trap composed of 22 places in 283 ms of which 3 ms to minimize.
[2024-06-03 01:27:26] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 3 ms to minimize.
[2024-06-03 01:27:26] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 3 ms to minimize.
[2024-06-03 01:27:26] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 3 ms to minimize.
[2024-06-03 01:27:27] [INFO ] Deduced a trap composed of 24 places in 285 ms of which 4 ms to minimize.
[2024-06-03 01:27:27] [INFO ] Deduced a trap composed of 37 places in 260 ms of which 3 ms to minimize.
[2024-06-03 01:27:27] [INFO ] Deduced a trap composed of 39 places in 259 ms of which 3 ms to minimize.
[2024-06-03 01:27:27] [INFO ] Deduced a trap composed of 37 places in 287 ms of which 3 ms to minimize.
[2024-06-03 01:27:28] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 4 ms to minimize.
[2024-06-03 01:27:28] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-03 01:27:32] [INFO ] Deduced a trap composed of 27 places in 287 ms of which 3 ms to minimize.
[2024-06-03 01:27:33] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 4 ms to minimize.
[2024-06-03 01:27:33] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 4 ms to minimize.
[2024-06-03 01:27:34] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 3 ms to minimize.
[2024-06-03 01:27:35] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 2 ms to minimize.
[2024-06-03 01:27:35] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 3 ms to minimize.
[2024-06-03 01:27:35] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 2 ms to minimize.
[2024-06-03 01:27:36] [INFO ] Deduced a trap composed of 25 places in 284 ms of which 3 ms to minimize.
[2024-06-03 01:27:36] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 3 ms to minimize.
[2024-06-03 01:27:37] [INFO ] Deduced a trap composed of 45 places in 239 ms of which 3 ms to minimize.
[2024-06-03 01:27:37] [INFO ] Deduced a trap composed of 42 places in 243 ms of which 4 ms to minimize.
[2024-06-03 01:27:38] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 203/664 variables, and 59 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/203 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/203 variables, 52/59 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-03 01:27:44] [INFO ] Deduced a trap composed of 131 places in 250 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-03 01:27:48] [INFO ] Deduced a trap composed of 44 places in 280 ms of which 3 ms to minimize.
[2024-06-03 01:27:49] [INFO ] Deduced a trap composed of 139 places in 244 ms of which 4 ms to minimize.
[2024-06-03 01:27:49] [INFO ] Deduced a trap composed of 40 places in 292 ms of which 4 ms to minimize.
[2024-06-03 01:27:50] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 2 ms to minimize.
[2024-06-03 01:27:50] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 3 ms to minimize.
[2024-06-03 01:27:50] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 3 ms to minimize.
[2024-06-03 01:27:51] [INFO ] Deduced a trap composed of 25 places in 264 ms of which 3 ms to minimize.
[2024-06-03 01:27:51] [INFO ] Deduced a trap composed of 22 places in 258 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 8/68 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-03 01:27:55] [INFO ] Deduced a trap composed of 30 places in 264 ms of which 3 ms to minimize.
[2024-06-03 01:27:55] [INFO ] Deduced a trap composed of 24 places in 296 ms of which 3 ms to minimize.
[2024-06-03 01:27:56] [INFO ] Deduced a trap composed of 24 places in 311 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/203 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-03 01:28:00] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 3 ms to minimize.
[2024-06-03 01:28:00] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 3 ms to minimize.
[2024-06-03 01:28:01] [INFO ] Deduced a trap composed of 37 places in 264 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 3/74 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-06-03 01:28:05] [INFO ] Deduced a trap composed of 111 places in 175 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 203/664 variables, and 75 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/203 constraints, PredecessorRefiner: 0/460 constraints, Known Traps: 68/68 constraints]
After SMT, in 60630ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60639ms
Starting structural reductions in LTL mode, iteration 1 : 203/223 places, 461/498 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61196 ms. Remains : 203/223 places, 461/498 transitions.
[2024-06-03 01:28:08] [INFO ] Flatten gal took : 15 ms
[2024-06-03 01:28:08] [INFO ] Flatten gal took : 16 ms
[2024-06-03 01:28:08] [INFO ] Input system was already deterministic with 461 transitions.
[2024-06-03 01:28:08] [INFO ] Flatten gal took : 16 ms
[2024-06-03 01:28:08] [INFO ] Flatten gal took : 16 ms
[2024-06-03 01:28:08] [INFO ] Time to serialize gal into /tmp/CTLFireability11657080838826030391.gal : 3 ms
[2024-06-03 01:28:08] [INFO ] Time to serialize properties into /tmp/CTLFireability1625821280995134672.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/CTLFireability11657080838826030391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1625821280995134672.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-06-03 01:28:38] [INFO ] Flatten gal took : 16 ms
[2024-06-03 01:28:38] [INFO ] Applying decomposition
[2024-06-03 01:28:39] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15410352943953735684.txt' '-o' '/tmp/graph15410352943953735684.bin' '-w' '/tmp/graph15410352943953735684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15410352943953735684.bin' '-l' '-1' '-v' '-w' '/tmp/graph15410352943953735684.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:28:39] [INFO ] Decomposing Gal with order
[2024-06-03 01:28:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:28:39] [INFO ] Removed a total of 1273 redundant transitions.
[2024-06-03 01:28:39] [INFO ] Flatten gal took : 30 ms
[2024-06-03 01:28:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 6 ms.
[2024-06-03 01:28:39] [INFO ] Time to serialize gal into /tmp/CTLFireability4709100057177734150.gal : 3 ms
[2024-06-03 01:28:39] [INFO ] Time to serialize properties into /tmp/CTLFireability17329335806462773986.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/CTLFireability4709100057177734150.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17329335806462773986.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.98225e+07,11.6002,250700,4775,57,167713,737,1021,2.46557e+06,88,2359,0


Converting to forward existential form...Done !
original formula: (AF(((((AG((i2.u10.p75==0)) + (((i0.u5.p24==1)&&(i0.u22.p98==1))&&((i2.u70.p237==1)&&(i2.u73.p246==1)))) + EG(((((i3.u3.p18==0)||(i0.u9.p...717
=> equivalent forward existential formula: [FwdG((Init * !(!(EG(!(((((!(E(TRUE U !((i2.u10.p75==0)))) + (((i0.u5.p24==1)&&(i0.u22.p98==1))&&((i2.u70.p237==...813
Reverse transition relation is NOT exact ! Due to transitions t57, t107, t116, t161, t174, t189, t193, t203, t207, t229, t261, t269, t281, t282, t299, t303...956
Detected timeout of ITS tools.
[2024-06-03 01:29:09] [INFO ] Flatten gal took : 17 ms
[2024-06-03 01:29:09] [INFO ] Flatten gal took : 17 ms
[2024-06-03 01:29:09] [INFO ] Applying decomposition
[2024-06-03 01:29:09] [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/graph3379252586917926114.txt' '-o' '/tmp/graph3379252586917926114.bin' '-w' '/tmp/graph3379252586917926114.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3379252586917926114.bin' '-l' '-1' '-v' '-w' '/tmp/graph3379252586917926114.weights' '-q' '0' '-e' '0.001'
[2024-06-03 01:29:09] [INFO ] Decomposing Gal with order
[2024-06-03 01:29:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:29:09] [INFO ] Removed a total of 953 redundant transitions.
[2024-06-03 01:29:09] [INFO ] Flatten gal took : 49 ms
[2024-06-03 01:29:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 81 labels/synchronizations in 10 ms.
[2024-06-03 01:29:09] [INFO ] Time to serialize gal into /tmp/CTLFireability7345318703191475136.gal : 6 ms
[2024-06-03 01:29:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2376065557690520431.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/CTLFireability7345318703191475136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2376065557690520431.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 10 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.68636e+07,378.503,4293420,10078,3757,1.69255e+06,687206,1258,3.7819e+07,224,1.51059e+07,0


Converting to forward existential form...Done !
original formula: E((!(EX(EG(EF(((i5.u10.p31==1)&&(i2.i1.u27.p113==1)))))) + (A(!(((((((i8.u8.p25==1)&&(i5.u11.p36==1))&&((i8.u68.p65==1)&&(i8.u22.p99==1))...414
=> equivalent forward existential formula: [(FwdU(Init,(!(EX(EG(E(TRUE U ((i5.u10.p31==1)&&(i2.i1.u27.p113==1)))))) + (!((E(!(!(E(TRUE U !(!(((((i8.u8.p25=...733
Reverse transition relation is NOT exact ! Due to transitions t16, t41, t82, t88, t122, t131, t175, t208, t209, t211, t217, t221, t228, t231, t232, t237, t...1650
Detected timeout of ITS tools.
[2024-06-03 01:57:08] [INFO ] Applying decomposition
[2024-06-03 01:57:08] [INFO ] Flatten gal took : 18 ms
[2024-06-03 01:57:08] [INFO ] Decomposing Gal with order
[2024-06-03 01:57:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-03 01:57:08] [INFO ] Removed a total of 839 redundant transitions.
[2024-06-03 01:57:08] [INFO ] Flatten gal took : 31 ms
[2024-06-03 01:57:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 194 labels/synchronizations in 5 ms.
[2024-06-03 01:57:08] [INFO ] Time to serialize gal into /tmp/CTLFireability2760165068480397848.gal : 2 ms
[2024-06-03 01:57:08] [INFO ] Time to serialize properties into /tmp/CTLFireability9755167837178695100.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/CTLFireability2760165068480397848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9755167837178695100.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 10 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.68636e+07,3.36681,91072,1597,3108,69886,76229,276,336598,538,767915,0


Converting to forward existential form...Done !
original formula: E((!(EX(EG(EF(((i0.i0.i0.u5.p31==1)&&(i0.i1.u10.p113==1)))))) + (A(!(((((((i0.i0.i0.u4.p25==1)&&(i0.i0.i0.u5.p36==1))&&((i0.i0.i1.u7.p65=...470
=> equivalent forward existential formula: [(FwdU(Init,(!(EX(EG(E(TRUE U ((i0.i0.i0.u5.p31==1)&&(i0.i1.u10.p113==1)))))) + (!((E(!(!(E(TRUE U !(!(((((i0.i0...825
Reverse transition relation is NOT exact ! Due to transitions t263, t349, t350, t351, t352, u12.t4, i0.t458, i0.t451, i0.t420, i0.i0.i0.u4.t223, i0.i0.i0.u...2225
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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