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.r092-tall-171624189700626.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 DES-PT-01b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189700626
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 08:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Apr 12 08:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 12 08:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 08:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 68K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716335708170

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:55: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-05-21 23:55:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:55:09] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-21 23:55:09] [INFO ] Transformed 284 places.
[2024-05-21 23:55:09] [INFO ] Transformed 235 transitions.
[2024-05-21 23:55:09] [INFO ] Found NUPN structural information;
[2024-05-21 23:55:09] [INFO ] Parsed PT model containing 284 places and 235 transitions and 683 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 137 out of 284 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 284/284 places, 235/235 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 281 transition count 235
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 271 transition count 225
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 271 transition count 225
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 268 transition count 222
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 268 transition count 222
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 268 transition count 220
Applied a total of 31 rules in 57 ms. Remains 268 /284 variables (removed 16) and now considering 220/235 (removed 15) transitions.
// Phase 1: matrix 220 rows 268 cols
[2024-05-21 23:55:09] [INFO ] Computed 62 invariants in 19 ms
[2024-05-21 23:55:10] [INFO ] Implicit Places using invariants in 279 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 317 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 266/284 places, 220/235 transitions.
Applied a total of 0 rules in 7 ms. Remains 266 /266 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 397 ms. Remains : 266/284 places, 220/235 transitions.
Support contains 137 out of 266 places after structural reductions.
[2024-05-21 23:55:10] [INFO ] Flatten gal took : 42 ms
[2024-05-21 23:55:10] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:55:10] [INFO ] Input system was already deterministic with 220 transitions.
Reduction of identical properties reduced properties to check from 90 to 88
RANDOM walk for 40000 steps (404 resets) in 2279 ms. (17 steps per ms) remains 7/88 properties
BEST_FIRST walk for 40003 steps (57 resets) in 245 ms. (162 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (51 resets) in 109 ms. (363 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (73 resets) in 114 ms. (347 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (54 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (42 resets) in 112 ms. (354 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (63 resets) in 171 ms. (232 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (52 resets) in 114 ms. (347 steps per ms) remains 5/5 properties
// Phase 1: matrix 220 rows 266 cols
[2024-05-21 23:55:11] [INFO ] Computed 60 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp82 is UNSAT
At refinement iteration 1 (OVERLAPS) 99/119 variables, 17/17 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 54/173 variables, 15/32 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/32 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 71/244 variables, 25/57 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/57 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 6/250 variables, 3/60 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/60 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 209/459 variables, 250/310 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/310 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 21/480 variables, 13/323 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 0/323 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 4/484 variables, 2/325 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/484 variables, 0/325 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 2/486 variables, 1/326 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/486 variables, 0/326 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/486 variables, 0/326 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 326 constraints, problems are : Problem set: 2 solved, 3 unsolved in 488 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 48/60 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 112/172 variables, 27/32 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 11 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 1/33 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem AtomicPropp86 is UNSAT
At refinement iteration 6 (OVERLAPS) 72/244 variables, 25/58 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 2/60 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 0/60 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 6/250 variables, 3/63 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/63 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 209/459 variables, 250/313 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/313 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem AtomicPropp23 is UNSAT
At refinement iteration 13 (OVERLAPS) 21/480 variables, 13/326 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/480 variables, 1/327 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/480 variables, 0/327 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/484 variables, 2/329 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/484 variables, 0/329 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/486 variables, 1/330 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/486 variables, 0/330 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/486 variables, 0/330 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 486/486 variables, and 330 constraints, problems are : Problem set: 4 solved, 1 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 266/266 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 1107ms problems are : Problem set: 4 solved, 1 unsolved
Finished Parikh walk after 8730 steps, including 108 resets, run visited all 1 properties in 24 ms. (steps per millisecond=363 )
Parikh walk visited 1 properties in 31 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2024-05-21 23:55:12] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:55:12] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:55:12] [INFO ] Input system was already deterministic with 220 transitions.
Support contains 124 out of 266 places (down from 126) after GAL structural reductions.
Computed a total of 54 stabilizing places and 50 stable transitions
Graph (complete) has 480 edges and 266 vertex of which 260 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.17 ms
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 220/220 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 248 transition count 202
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 248 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 248 transition count 200
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 47 place count 239 transition count 191
Iterating global reduction 1 with 9 rules applied. Total rules applied 56 place count 239 transition count 191
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 65 place count 239 transition count 182
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 66 place count 238 transition count 181
Iterating global reduction 2 with 1 rules applied. Total rules applied 67 place count 238 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 238 transition count 180
Applied a total of 68 rules in 27 ms. Remains 238 /266 variables (removed 28) and now considering 180/220 (removed 40) transitions.
// Phase 1: matrix 180 rows 238 cols
[2024-05-21 23:55:12] [INFO ] Computed 60 invariants in 12 ms
[2024-05-21 23:55:12] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-21 23:55:12] [INFO ] Invariant cache hit.
[2024-05-21 23:55:13] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 179 sub problems to find dead transitions.
[2024-05-21 23:55:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:55:15] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 2 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:55:16] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:55:17] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 5/88 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:55:19] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:55:21] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 11 (OVERLAPS) 180/418 variables, 238/334 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:55:24] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 6/340 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:55:26] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:55:27] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 3/343 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 15 (OVERLAPS) 0/418 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 179 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 343 constraints, problems are : Problem set: 0 solved, 179 unsolved in 18535 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 179 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 45/105 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 6 (OVERLAPS) 180/418 variables, 238/343 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/418 variables, 179/522 constraints. Problems are: Problem set: 0 solved, 179 unsolved
[2024-05-21 23:55:34] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:55:35] [INFO ] Deduced a trap composed of 40 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/418 variables, 6/528 constraints. Problems are: Problem set: 0 solved, 179 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/418 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 179 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 418/418 variables, and 528 constraints, problems are : Problem set: 0 solved, 179 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 179/179 constraints, Known Traps: 51/51 constraints]
After SMT, in 48595ms problems are : Problem set: 0 solved, 179 unsolved
Search for dead transitions found 0 dead transitions in 48598ms
Starting structural reductions in LTL mode, iteration 1 : 238/266 places, 180/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48949 ms. Remains : 238/266 places, 180/220 transitions.
[2024-05-21 23:56:01] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:56:01] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:56:01] [INFO ] Input system was already deterministic with 180 transitions.
[2024-05-21 23:56:01] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:56:01] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:56:01] [INFO ] Time to serialize gal into /tmp/CTLFireability8815236332841067726.gal : 9 ms
[2024-05-21 23:56:01] [INFO ] Time to serialize properties into /tmp/CTLFireability16131916893487386583.ctl : 8 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/CTLFireability8815236332841067726.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16131916893487386583.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,3.73565e+15,22.8585,668164,2,417208,5,2.58464e+06,6,0,1133,2.72982e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:56:31] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:56:31] [INFO ] Applying decomposition
[2024-05-21 23:56:31] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16398403406539207425.txt' '-o' '/tmp/graph16398403406539207425.bin' '-w' '/tmp/graph16398403406539207425.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16398403406539207425.bin' '-l' '-1' '-v' '-w' '/tmp/graph16398403406539207425.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:56:31] [INFO ] Decomposing Gal with order
[2024-05-21 23:56:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:56:31] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-21 23:56:32] [INFO ] Flatten gal took : 56 ms
[2024-05-21 23:56:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 7 ms.
[2024-05-21 23:56:32] [INFO ] Time to serialize gal into /tmp/CTLFireability1996448853809221674.gal : 6 ms
[2024-05-21 23:56:32] [INFO ] Time to serialize properties into /tmp/CTLFireability3122061224496697664.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/CTLFireability1996448853809221674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3122061224496697664.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.73565e+15,0.382694,21576,2293,82,36054,703,619,90588,93,2050,0


Converting to forward existential form...Done !
original formula: (AG((i5.u20.p84==0)) + EG(!(E(AX((i8.u58.p211!=1)) U (i6.u26.p92==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG(!(E(!(EX(!((i8.u58.p211!=1)))) U (i6.u26.p92==1)))))),TRUE) * !((i5.u20.p84==0)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t87, t93, t133, t174, i0.u31.t79, i0.u75.t17, i1.u13.t111, i2.t121, i2.u6.t126, i2.u...709
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 220/220 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 247 transition count 201
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 247 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 247 transition count 199
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 49 place count 238 transition count 190
Iterating global reduction 1 with 9 rules applied. Total rules applied 58 place count 238 transition count 190
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 66 place count 238 transition count 182
Applied a total of 66 rules in 21 ms. Remains 238 /266 variables (removed 28) and now considering 182/220 (removed 38) transitions.
// Phase 1: matrix 182 rows 238 cols
[2024-05-21 23:57:02] [INFO ] Computed 60 invariants in 3 ms
[2024-05-21 23:57:02] [INFO ] Implicit Places using invariants in 262 ms returned []
[2024-05-21 23:57:02] [INFO ] Invariant cache hit.
[2024-05-21 23:57:02] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-21 23:57:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:57:04] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 34 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:57:05] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 17/77 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:57:06] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:57:07] [INFO ] Deduced a trap composed of 11 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:57:08] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:57:09] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (OVERLAPS) 182/420 variables, 238/334 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:57:12] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:57:13] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 8/342 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:57:14] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 1/343 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:57:15] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/420 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:57:19] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/420 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/420 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:57:23] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/420 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/420 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/420 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 347 constraints, problems are : Problem set: 0 solved, 181 unsolved in 25574 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 49/109 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:57:29] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:57:29] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:57:29] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:57:30] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/420 variables, 238/351 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/420 variables, 181/532 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:57:33] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:57:33] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:57:33] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/420 variables, 3/535 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/420 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:57:51] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 536 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 57/57 constraints]
After SMT, in 55621ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 55626ms
Starting structural reductions in LTL mode, iteration 1 : 238/266 places, 182/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56106 ms. Remains : 238/266 places, 182/220 transitions.
[2024-05-21 23:57:58] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:57:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:57:58] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-21 23:57:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:57:58] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:57:58] [INFO ] Time to serialize gal into /tmp/CTLFireability17948777370899365298.gal : 2 ms
[2024-05-21 23:57:58] [INFO ] Time to serialize properties into /tmp/CTLFireability13380096501387083773.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/CTLFireability17948777370899365298.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13380096501387083773.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.00137e+15,23.1689,668428,2,416108,5,2.57895e+06,6,0,1135,2.72406e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 23:58:28] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:58:28] [INFO ] Applying decomposition
[2024-05-21 23:58:28] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14992309034777966907.txt' '-o' '/tmp/graph14992309034777966907.bin' '-w' '/tmp/graph14992309034777966907.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14992309034777966907.bin' '-l' '-1' '-v' '-w' '/tmp/graph14992309034777966907.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:58:28] [INFO ] Decomposing Gal with order
[2024-05-21 23:58:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:58:28] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-21 23:58:28] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:58:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-21 23:58:28] [INFO ] Time to serialize gal into /tmp/CTLFireability10363034755536222581.gal : 4 ms
[2024-05-21 23:58:28] [INFO ] Time to serialize properties into /tmp/CTLFireability7410229641686754816.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/CTLFireability10363034755536222581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7410229641686754816.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.00137e+15,0.853974,32632,4430,72,63391,436,670,119744,79,1266,0


Converting to forward existential form...Done !
original formula: ((AF(EX(AX(((i3.i0.u17.p78==1)&&(i0.i1.u2.p4==1))))) + EF(!(A(EF(((i7.i2.u42.p164==1)&&(i7.i1.u50.p190==1))) U A((i7.i2.u49.p186==1) U (i...459
=> equivalent forward existential formula: ([(EY((FwdU(FwdU((Init * !((!(EG(!(EX(!(EX(!(((i3.i0.u17.p78==1)&&(i0.i1.u2.p4==1))))))))) + E(TRUE U !(!((E(!(!...1666
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t58, t87, t134, t176, i0.i0.u14.t109, i0.i1.u31.t79, i1.u10.t115, i2.t122, i2.u6.t12...744
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 : 266/266 places, 220/220 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 246 transition count 200
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 246 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 246 transition count 198
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 237 transition count 189
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 237 transition count 189
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 69 place count 237 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 236 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 236 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 236 transition count 178
Applied a total of 72 rules in 28 ms. Remains 236 /266 variables (removed 30) and now considering 178/220 (removed 42) transitions.
// Phase 1: matrix 178 rows 236 cols
[2024-05-21 23:58:58] [INFO ] Computed 60 invariants in 4 ms
[2024-05-21 23:58:58] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-05-21 23:58:58] [INFO ] Invariant cache hit.
[2024-05-21 23:58:58] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-21 23:58:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:59:01] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:59:01] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:59:01] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:59:01] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:59:01] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:59:01] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:59:01] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:59:01] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:59:01] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:59:01] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:59:01] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:59:01] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:59:02] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:59:03] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:59:03] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:59:03] [INFO ] Deduced a trap composed of 34 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:59:03] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:59:03] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:59:05] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:59:05] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:59:05] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:59:05] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 178/414 variables, 236/332 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:59:08] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:59:08] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:59:08] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:59:09] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:59:09] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:59:09] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:59:10] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:59:10] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:59:10] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:59:11] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:59:11] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:59:11] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:59:11] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:59:12] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 5/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 14 (OVERLAPS) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 346 constraints, problems are : Problem set: 0 solved, 177 unsolved in 17171 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 50/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:59:17] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:59:17] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:59:17] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:59:17] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 178/414 variables, 236/350 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 177/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 527 constraints, problems are : Problem set: 0 solved, 177 unsolved in 27383 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 54/54 constraints]
After SMT, in 44573ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 44576ms
Starting structural reductions in LTL mode, iteration 1 : 236/266 places, 178/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44985 ms. Remains : 236/266 places, 178/220 transitions.
[2024-05-21 23:59:43] [INFO ] Flatten gal took : 21 ms
[2024-05-21 23:59:43] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:59:43] [INFO ] Input system was already deterministic with 178 transitions.
[2024-05-21 23:59:43] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:59:43] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:59:43] [INFO ] Time to serialize gal into /tmp/CTLFireability7385526934682830452.gal : 1 ms
[2024-05-21 23:59:43] [INFO ] Time to serialize properties into /tmp/CTLFireability2154755499409749885.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/CTLFireability7385526934682830452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2154755499409749885.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,3.71666e+15,22.9541,668696,2,415900,5,2.57807e+06,6,0,1123,2.72328e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 00:00:13] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:00:13] [INFO ] Applying decomposition
[2024-05-22 00:00:13] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5200425063309604771.txt' '-o' '/tmp/graph5200425063309604771.bin' '-w' '/tmp/graph5200425063309604771.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5200425063309604771.bin' '-l' '-1' '-v' '-w' '/tmp/graph5200425063309604771.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:00:13] [INFO ] Decomposing Gal with order
[2024-05-22 00:00:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:00:13] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-22 00:00:13] [INFO ] Flatten gal took : 24 ms
[2024-05-22 00:00:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-22 00:00:13] [INFO ] Time to serialize gal into /tmp/CTLFireability5337089272204237461.gal : 5 ms
[2024-05-22 00:00:13] [INFO ] Time to serialize properties into /tmp/CTLFireability2970867053784289618.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/CTLFireability5337089272204237461.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2970867053784289618.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.71666e+15,0.216648,13280,1774,70,21482,709,654,31348,80,1685,0


Converting to forward existential form...Done !
original formula: EG(AX(EX(!(E((i10.i3.u61.p218==1) U ((i13.i0.u69.p257==1)&&(i13.i1.u73.p269==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EX(!(E((i10.i3.u61.p218==1) U ((i13.i0.u69.p257==1)&&(i13.i1.u73.p269==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t52, t58, t131, t170, t172, i0.u10.t115, i1.t0, i1.i0.u31.t79, i1.i1.u33.t76, i2.u75.t17, i3....732
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
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 220/220 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 247 transition count 201
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 247 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 247 transition count 199
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 239 transition count 191
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 239 transition count 191
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 64 place count 239 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 238 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 238 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 238 transition count 181
Applied a total of 67 rules in 25 ms. Remains 238 /266 variables (removed 28) and now considering 181/220 (removed 39) transitions.
// Phase 1: matrix 181 rows 238 cols
[2024-05-22 00:00:43] [INFO ] Computed 60 invariants in 4 ms
[2024-05-22 00:00:43] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-22 00:00:43] [INFO ] Invariant cache hit.
[2024-05-22 00:00:44] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-22 00:00:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:00:46] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:00:47] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:00:48] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:00:49] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:00:50] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 9 (OVERLAPS) 181/419 variables, 238/326 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 8 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:00:53] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 8/334 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:00:54] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:00:55] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:00:56] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 13/347 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (OVERLAPS) 0/419 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 347 constraints, problems are : Problem set: 0 solved, 180 unsolved in 16465 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 49/109 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 181/419 variables, 238/347 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/419 variables, 180/527 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:01:05] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:01:16] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:01:20] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:01:20] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:01:20] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:01:20] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:01:22] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 7/535 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/419 variables, and 535 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 57/57 constraints]
After SMT, in 46491ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 46493ms
Starting structural reductions in LTL mode, iteration 1 : 238/266 places, 181/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46841 ms. Remains : 238/266 places, 181/220 transitions.
[2024-05-22 00:01:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:01:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:01:30] [INFO ] Input system was already deterministic with 181 transitions.
[2024-05-22 00:01:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:01:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:01:30] [INFO ] Time to serialize gal into /tmp/CTLFireability9859809358838976528.gal : 1 ms
[2024-05-22 00:01:30] [INFO ] Time to serialize properties into /tmp/CTLFireability12874253827655447103.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/CTLFireability9859809358838976528.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12874253827655447103.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,4.58412e+15,22.8853,668808,2,416588,5,2.58159e+06,6,0,1134,2.72697e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 00:02:00] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:02:00] [INFO ] Applying decomposition
[2024-05-22 00:02:00] [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/graph8266812025711364035.txt' '-o' '/tmp/graph8266812025711364035.bin' '-w' '/tmp/graph8266812025711364035.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8266812025711364035.bin' '-l' '-1' '-v' '-w' '/tmp/graph8266812025711364035.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:02:00] [INFO ] Decomposing Gal with order
[2024-05-22 00:02:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:02:00] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 00:02:00] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:02:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 00:02:00] [INFO ] Time to serialize gal into /tmp/CTLFireability13333648457766629472.gal : 2 ms
[2024-05-22 00:02:00] [INFO ] Time to serialize properties into /tmp/CTLFireability17565792530304736780.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/CTLFireability13333648457766629472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17565792530304736780.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.58412e+15,3.59479,75552,9289,64,185114,474,662,239170,81,1519,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 220/220 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 249 transition count 203
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 249 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 249 transition count 202
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 43 place count 241 transition count 194
Iterating global reduction 1 with 8 rules applied. Total rules applied 51 place count 241 transition count 194
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 59 place count 241 transition count 186
Applied a total of 59 rules in 18 ms. Remains 241 /266 variables (removed 25) and now considering 186/220 (removed 34) transitions.
// Phase 1: matrix 186 rows 241 cols
[2024-05-22 00:02:30] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:02:30] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-22 00:02:30] [INFO ] Invariant cache hit.
[2024-05-22 00:02:31] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
Running 185 sub problems to find dead transitions.
[2024-05-22 00:02:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:02:33] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:02:34] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:02:35] [INFO ] Deduced a trap composed of 32 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 11/91 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:02:36] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:02:36] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 3 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:02:37] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:02:38] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:02:39] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 4/100 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 32 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 24 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:02:40] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 7/107 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 11 (OVERLAPS) 186/427 variables, 241/348 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:02:42] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:02:43] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/427 variables, 9/357 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/427 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:02:46] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:02:46] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/427 variables, 2/359 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:02:48] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/427 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/427 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 17 (OVERLAPS) 0/427 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 185 unsolved
No progress, stopping.
After SMT solving in domain Real declared 427/427 variables, and 361 constraints, problems are : Problem set: 0 solved, 185 unsolved in 22465 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/240 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 2 (OVERLAPS) 1/241 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 60/120 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:02:54] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:02:54] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:02:55] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 7 (OVERLAPS) 186/427 variables, 241/364 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/427 variables, 185/549 constraints. Problems are: Problem set: 0 solved, 185 unsolved
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:02:57] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:03:00] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/427 variables, 7/556 constraints. Problems are: Problem set: 0 solved, 185 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/427 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 185 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 427/427 variables, and 556 constraints, problems are : Problem set: 0 solved, 185 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 185/185 constraints, Known Traps: 70/70 constraints]
After SMT, in 52520ms problems are : Problem set: 0 solved, 185 unsolved
Search for dead transitions found 0 dead transitions in 52522ms
Starting structural reductions in LTL mode, iteration 1 : 241/266 places, 186/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52826 ms. Remains : 241/266 places, 186/220 transitions.
[2024-05-22 00:03:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:03:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:03:23] [INFO ] Input system was already deterministic with 186 transitions.
[2024-05-22 00:03:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:03:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:03:23] [INFO ] Time to serialize gal into /tmp/CTLFireability5273604543362454869.gal : 1 ms
[2024-05-22 00:03:23] [INFO ] Time to serialize properties into /tmp/CTLFireability15622793499707738487.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/CTLFireability5273604543362454869.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15622793499707738487.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:03:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:03:53] [INFO ] Applying decomposition
[2024-05-22 00:03:53] [INFO ] Flatten gal took : 5 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/graph239629705376651520.txt' '-o' '/tmp/graph239629705376651520.bin' '-w' '/tmp/graph239629705376651520.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph239629705376651520.bin' '-l' '-1' '-v' '-w' '/tmp/graph239629705376651520.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:03:53] [INFO ] Decomposing Gal with order
[2024-05-22 00:03:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:03:53] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-22 00:03:53] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:03:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 00:03:53] [INFO ] Time to serialize gal into /tmp/CTLFireability3572364224934900822.gal : 3 ms
[2024-05-22 00:03:53] [INFO ] Time to serialize properties into /tmp/CTLFireability13210023872595068915.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/CTLFireability3572364224934900822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13210023872595068915.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,8.4827e+15,0.330133,18068,2924,68,32056,550,700,53097,76,1420,0


Converting to forward existential form...Done !
original formula: ((AG(((AX(((i7.i0.u57.p200==0)||(i9.i0.u67.p229==0))) + AG((i1.u17.p66==0))) + ((i7.i0.u57.p200==0)||(i9.i0.u67.p229==0)))) + AX((EG((i6....485
=> equivalent forward existential formula: ([(FwdU(FwdU((Init * !((!(E(TRUE U !(((!(EX(!(((i7.i0.u57.p200==0)||(i9.i0.u67.p229==0))))) + !(E(TRUE U !((i1.u...865
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t87, t122, t136, t158, t180, i0.i1.u36.t76, i0.i2.t155, i0.i2.u39.t74, i0.i2.u7...751
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 220/220 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 247 transition count 201
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 247 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 247 transition count 199
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 239 transition count 191
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 239 transition count 191
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 64 place count 239 transition count 183
Applied a total of 64 rules in 14 ms. Remains 239 /266 variables (removed 27) and now considering 183/220 (removed 37) transitions.
// Phase 1: matrix 183 rows 239 cols
[2024-05-22 00:04:23] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:04:23] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-22 00:04:23] [INFO ] Invariant cache hit.
[2024-05-22 00:04:24] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-22 00:04:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:04:26] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:04:27] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:04:28] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:04:29] [INFO ] Deduced a trap composed of 34 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:04:30] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:04:31] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:04:31] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:04:31] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:04:31] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:04:31] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:04:31] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 7/99 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (OVERLAPS) 183/422 variables, 239/338 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:04:34] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
[2024-05-22 00:04:35] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 10/348 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:04:37] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/422 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:04:41] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/422 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/422 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 16 (OVERLAPS) 0/422 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 350 constraints, problems are : Problem set: 0 solved, 182 unsolved in 22071 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:04:47] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 183/422 variables, 239/351 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 182/533 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:04:50] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:04:58] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:05:09] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 538 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 57/57 constraints]
After SMT, in 52101ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 52103ms
Starting structural reductions in LTL mode, iteration 1 : 239/266 places, 183/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52393 ms. Remains : 239/266 places, 183/220 transitions.
[2024-05-22 00:05:16] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:05:16] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:05:16] [INFO ] Input system was already deterministic with 183 transitions.
[2024-05-22 00:05:16] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:05:16] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:05:16] [INFO ] Time to serialize gal into /tmp/CTLFireability13490246048354464758.gal : 1 ms
[2024-05-22 00:05:16] [INFO ] Time to serialize properties into /tmp/CTLFireability15632848614114864102.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/CTLFireability13490246048354464758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15632848614114864102.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.25382e+15,22.6797,668536,2,416212,5,2.59114e+06,6,0,1140,2.72604e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 00:05:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:05:46] [INFO ] Applying decomposition
[2024-05-22 00:05:46] [INFO ] Flatten gal took : 4 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/graph16663471329616427780.txt' '-o' '/tmp/graph16663471329616427780.bin' '-w' '/tmp/graph16663471329616427780.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16663471329616427780.bin' '-l' '-1' '-v' '-w' '/tmp/graph16663471329616427780.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:05:46] [INFO ] Decomposing Gal with order
[2024-05-22 00:05:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:05:46] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 00:05:46] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:05:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 00:05:46] [INFO ] Time to serialize gal into /tmp/CTLFireability15242582142251782175.gal : 2 ms
[2024-05-22 00:05:46] [INFO ] Time to serialize properties into /tmp/CTLFireability4215051988582175657.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/CTLFireability15242582142251782175.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4215051988582175657.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.25382e+15,0.237752,14564,2050,71,26548,586,661,34454,79,1601,0


Converting to forward existential form...Done !
original formula: AF(((EX((EX((i2.u12.p39==1)) * (i4.i0.u23.p98==0))) * (i5.i0.u36.p138==1)) * (i11.u76.p265==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((EX((EX((i2.u12.p39==1)) * (i4.i0.u23.p98==0))) * (i5.i0.u36.p138==1)) * (i11.u76.p265==1))))] = F...159
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t58, t87, t135, t177, i0.i1.u34.t79, i0.i3.u78.t17, i1.t123, i1.u8.t128, i1.u8....742
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 220/220 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 246 transition count 200
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 246 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 246 transition count 198
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 237 transition count 189
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 237 transition count 189
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 69 place count 237 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 236 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 236 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 236 transition count 178
Applied a total of 72 rules in 9 ms. Remains 236 /266 variables (removed 30) and now considering 178/220 (removed 42) transitions.
// Phase 1: matrix 178 rows 236 cols
[2024-05-22 00:06:16] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 00:06:16] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-22 00:06:16] [INFO ] Invariant cache hit.
[2024-05-22 00:06:16] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-22 00:06:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:06:18] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:06:19] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:06:20] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 34 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 0 ms to minimize.
[2024-05-22 00:06:21] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:06:23] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 178/414 variables, 236/332 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:06:26] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:06:27] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:06:28] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:06:29] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 5/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 14 (OVERLAPS) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 346 constraints, problems are : Problem set: 0 solved, 177 unsolved in 17316 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 50/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:06:34] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:06:35] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:06:35] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:06:35] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 178/414 variables, 236/350 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 177/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 527 constraints, problems are : Problem set: 0 solved, 177 unsolved in 27490 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 54/54 constraints]
After SMT, in 44820ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 44822ms
Starting structural reductions in LTL mode, iteration 1 : 236/266 places, 178/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45129 ms. Remains : 236/266 places, 178/220 transitions.
[2024-05-22 00:07:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:07:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:07:01] [INFO ] Input system was already deterministic with 178 transitions.
[2024-05-22 00:07:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:07:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:07:01] [INFO ] Time to serialize gal into /tmp/CTLFireability10922652257871739786.gal : 1 ms
[2024-05-22 00:07:01] [INFO ] Time to serialize properties into /tmp/CTLFireability2296458407539030729.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/CTLFireability10922652257871739786.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2296458407539030729.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,3.71666e+15,23.5474,667884,2,415900,5,2.57807e+06,6,0,1123,2.72328e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 00:07:31] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:07:31] [INFO ] Applying decomposition
[2024-05-22 00:07:31] [INFO ] Flatten gal took : 4 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/graph9900359939878995107.txt' '-o' '/tmp/graph9900359939878995107.bin' '-w' '/tmp/graph9900359939878995107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9900359939878995107.bin' '-l' '-1' '-v' '-w' '/tmp/graph9900359939878995107.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:07:31] [INFO ] Decomposing Gal with order
[2024-05-22 00:07:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:07:31] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-22 00:07:31] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:07:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 7 ms.
[2024-05-22 00:07:31] [INFO ] Time to serialize gal into /tmp/CTLFireability17941748773533200460.gal : 2 ms
[2024-05-22 00:07:31] [INFO ] Time to serialize properties into /tmp/CTLFireability8874016751321475034.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/CTLFireability17941748773533200460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8874016751321475034.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.71666e+15,0.208151,13032,1679,72,22426,619,661,31100,82,1652,0


Converting to forward existential form...Done !
original formula: EF(EX(AG((i7.i0.u53.p201==0))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(E(TRUE U !((i7.i0.u53.p201==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t54, t56, t87, t131, t172, i0.u12.t112, i0.u14.t109, i1.t119, i1.u7.t124, i1.u7.t125...721
(forward)formula 0,1,1.92236,80616,1,0,159886,943,3340,341771,409,2697,243872
FORMULA DES-PT-01b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 220/220 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 247 transition count 201
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 247 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 247 transition count 199
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 48 place count 239 transition count 191
Iterating global reduction 1 with 8 rules applied. Total rules applied 56 place count 239 transition count 191
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 64 place count 239 transition count 183
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 238 transition count 182
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 238 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 238 transition count 181
Applied a total of 67 rules in 11 ms. Remains 238 /266 variables (removed 28) and now considering 181/220 (removed 39) transitions.
// Phase 1: matrix 181 rows 238 cols
[2024-05-22 00:07:33] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:07:33] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-22 00:07:33] [INFO ] Invariant cache hit.
[2024-05-22 00:07:33] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-22 00:07:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:07:36] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 10 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 1 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:07:37] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:07:38] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:07:38] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 181/419 variables, 238/323 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:07:40] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:07:41] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 15/338 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:07:42] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:07:46] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/419 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/419 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (OVERLAPS) 0/419 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 419/419 variables, and 340 constraints, problems are : Problem set: 0 solved, 180 unsolved in 16990 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 42/102 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:07:51] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:07:51] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:07:52] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (OVERLAPS) 181/419 variables, 238/344 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/419 variables, 180/524 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:07:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:07:54] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:07:55] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:07:55] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:07:55] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:07:56] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/419 variables, 6/530 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-22 00:08:02] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/419 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/419 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 419/419 variables, and 531 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 53/53 constraints]
After SMT, in 47030ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 47032ms
Starting structural reductions in LTL mode, iteration 1 : 238/266 places, 181/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47294 ms. Remains : 238/266 places, 181/220 transitions.
[2024-05-22 00:08:20] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:08:20] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:08:20] [INFO ] Input system was already deterministic with 181 transitions.
[2024-05-22 00:08:20] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:08:20] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:08:20] [INFO ] Time to serialize gal into /tmp/CTLFireability7235053226584863575.gal : 1 ms
[2024-05-22 00:08:20] [INFO ] Time to serialize properties into /tmp/CTLFireability16129851746469609128.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/CTLFireability7235053226584863575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16129851746469609128.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,5.57499e+15,23.8814,698456,2,416524,5,2.92305e+06,6,0,1134,2.87736e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 00:08:50] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:08:50] [INFO ] Applying decomposition
[2024-05-22 00:08:50] [INFO ] Flatten gal took : 4 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/graph2359859773817271226.txt' '-o' '/tmp/graph2359859773817271226.bin' '-w' '/tmp/graph2359859773817271226.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2359859773817271226.bin' '-l' '-1' '-v' '-w' '/tmp/graph2359859773817271226.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:08:50] [INFO ] Decomposing Gal with order
[2024-05-22 00:08:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:08:50] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 00:08:50] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:08:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 6 ms.
[2024-05-22 00:08:51] [INFO ] Time to serialize gal into /tmp/CTLFireability466401557989775353.gal : 2 ms
[2024-05-22 00:08:51] [INFO ] Time to serialize properties into /tmp/CTLFireability17430280696470526309.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/CTLFireability466401557989775353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17430280696470526309.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,5.57499e+15,0.422893,22772,2477,72,39854,598,704,87390,84,1881,0


Converting to forward existential form...Done !
original formula: EG(EX(((i2.i1.u14.p64==0) * !(A((i3.i1.u28.p121==1) U ((i4.i1.u23.p89==1)&&(i5.i0.u30.p130==1)))))))
=> equivalent forward existential formula: [FwdG(Init,EX(((i2.i1.u14.p64==0) * !(!((E(!(((i4.i1.u23.p89==1)&&(i5.i0.u30.p130==1))) U (!((i3.i1.u28.p121==1)...272
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t87, t133, t175, i0.u9.t117, i1.t121, i1.u7.t126, i1.u7.t127, i1.u8.t123, i1.u8...750
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 220/220 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 252 transition count 206
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 252 transition count 206
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 30 place count 252 transition count 204
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 247 transition count 199
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 247 transition count 199
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 45 place count 247 transition count 194
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 246 transition count 193
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 246 transition count 193
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 246 transition count 192
Applied a total of 48 rules in 8 ms. Remains 246 /266 variables (removed 20) and now considering 192/220 (removed 28) transitions.
// Phase 1: matrix 192 rows 246 cols
[2024-05-22 00:09:21] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 00:09:21] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-22 00:09:21] [INFO ] Invariant cache hit.
[2024-05-22 00:09:21] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 191 sub problems to find dead transitions.
[2024-05-22 00:09:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/246 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:09:23] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 35 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 2 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:09:24] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:09:25] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 34 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:09:26] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 192/438 variables, 246/341 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 00:09:29] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:09:29] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:09:30] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:09:30] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:09:30] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:09:30] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:09:30] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:09:30] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:09:30] [INFO ] Deduced a trap composed of 9 places in 18 ms of which 1 ms to minimize.
[2024-05-22 00:09:30] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 10/351 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:09:33] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 00:09:34] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:09:35] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:09:36] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 4/358 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/438 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 14 (OVERLAPS) 0/438 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 191 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 358 constraints, problems are : Problem set: 0 solved, 191 unsolved in 19724 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 191 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 2 (OVERLAPS) 1/246 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/246 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 52/112 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 00:09:42] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 00:09:43] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:09:43] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:09:43] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 8 (OVERLAPS) 192/438 variables, 246/362 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 191/553 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:09:46] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 3/556 constraints. Problems are: Problem set: 0 solved, 191 unsolved
[2024-05-22 00:09:53] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 191 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/438 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 191 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 557 constraints, problems are : Problem set: 0 solved, 191 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 246/246 constraints, PredecessorRefiner: 191/191 constraints, Known Traps: 60/60 constraints]
After SMT, in 49755ms problems are : Problem set: 0 solved, 191 unsolved
Search for dead transitions found 0 dead transitions in 49757ms
Starting structural reductions in LTL mode, iteration 1 : 246/266 places, 192/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50052 ms. Remains : 246/266 places, 192/220 transitions.
[2024-05-22 00:10:11] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:10:11] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:10:11] [INFO ] Input system was already deterministic with 192 transitions.
[2024-05-22 00:10:11] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:10:11] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:10:11] [INFO ] Time to serialize gal into /tmp/CTLFireability15656255169000006049.gal : 1 ms
[2024-05-22 00:10:11] [INFO ] Time to serialize properties into /tmp/CTLFireability12723716694316783223.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/CTLFireability15656255169000006049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12723716694316783223.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11219e+16,25.8648,750056,2,420312,5,2.9397e+06,6,0,1177,3.07557e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 00:10:41] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:10:41] [INFO ] Applying decomposition
[2024-05-22 00:10:41] [INFO ] Flatten gal took : 4 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/graph15312166848252380625.txt' '-o' '/tmp/graph15312166848252380625.bin' '-w' '/tmp/graph15312166848252380625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15312166848252380625.bin' '-l' '-1' '-v' '-w' '/tmp/graph15312166848252380625.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:10:41] [INFO ] Decomposing Gal with order
[2024-05-22 00:10:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:10:41] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 00:10:41] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:10:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 00:10:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11218084075434597663.gal : 2 ms
[2024-05-22 00:10:41] [INFO ] Time to serialize properties into /tmp/CTLFireability14595402081999057055.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/CTLFireability11218084075434597663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14595402081999057055.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.11219e+16,1.91347,59528,7133,74,134439,678,699,140787,89,1982,0


Converting to forward existential form...Done !
original formula: !(E((((AF((i5.u30.p117==1)) * !(EG((i4.i2.u20.p88==1)))) + (!(((i5.u30.p119==1)||(i2.u7.p31==1))) * EX((i11.u74.p247==1)))) + (!(EX((i5.u...573
=> equivalent forward existential formula: [(FwdU(FwdU(Init,(((!(EG(!((i5.u30.p117==1)))) * !(EG((i4.i2.u20.p88==1)))) + (!(((i5.u30.p119==1)||(i2.u7.p31==...709
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t58, t126, i0.i1.u78.t17, i1.i0.u12.t119, i1.i0.u14.t116, i1.i1.u6.t134, i1.i1.u6.t1...830
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 220/220 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 247 transition count 201
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 247 transition count 201
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 40 place count 247 transition count 199
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 240 transition count 192
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 240 transition count 192
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 61 place count 240 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 239 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 239 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 239 transition count 183
Applied a total of 64 rules in 8 ms. Remains 239 /266 variables (removed 27) and now considering 183/220 (removed 37) transitions.
// Phase 1: matrix 183 rows 239 cols
[2024-05-22 00:11:11] [INFO ] Computed 60 invariants in 2 ms
[2024-05-22 00:11:11] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-22 00:11:11] [INFO ] Invariant cache hit.
[2024-05-22 00:11:11] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 182 sub problems to find dead transitions.
[2024-05-22 00:11:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:11:13] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:11:14] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:11:15] [INFO ] Deduced a trap composed of 16 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 3/83 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:11:16] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 9/92 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:11:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:11:19] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:11:19] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:11:19] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 10 (OVERLAPS) 183/422 variables, 239/335 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:11:22] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/422 variables, 4/339 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:11:23] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/422 variables, 1/340 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:11:26] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/422 variables, 4/344 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/422 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:11:29] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-22 00:11:29] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:11:29] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/422 variables, 3/347 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:11:31] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:11:32] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/422 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/422 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 18 (OVERLAPS) 0/422 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 182 unsolved
No progress, stopping.
After SMT solving in domain Real declared 422/422 variables, and 350 constraints, problems are : Problem set: 0 solved, 182 unsolved in 24716 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 182 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 51/111 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:11:37] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 7 (OVERLAPS) 183/422 variables, 239/353 constraints. Problems are: Problem set: 0 solved, 182 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/422 variables, 182/535 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:11:40] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:11:41] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/422 variables, 2/537 constraints. Problems are: Problem set: 0 solved, 182 unsolved
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 2 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:11:51] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:11:54] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/422 variables, 5/542 constraints. Problems are: Problem set: 0 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 422/422 variables, and 542 constraints, problems are : Problem set: 0 solved, 182 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 182/182 constraints, Known Traps: 61/61 constraints]
After SMT, in 54743ms problems are : Problem set: 0 solved, 182 unsolved
Search for dead transitions found 0 dead transitions in 54744ms
Starting structural reductions in LTL mode, iteration 1 : 239/266 places, 183/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55039 ms. Remains : 239/266 places, 183/220 transitions.
[2024-05-22 00:12:06] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:12:06] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:12:06] [INFO ] Input system was already deterministic with 183 transitions.
[2024-05-22 00:12:06] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:12:06] [INFO ] Flatten gal took : 16 ms
[2024-05-22 00:12:06] [INFO ] Time to serialize gal into /tmp/CTLFireability9791560832130851681.gal : 3 ms
[2024-05-22 00:12:06] [INFO ] Time to serialize properties into /tmp/CTLFireability7151880059378647735.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/CTLFireability9791560832130851681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7151880059378647735.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:12:36] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:12:36] [INFO ] Applying decomposition
[2024-05-22 00:12:36] [INFO ] Flatten gal took : 4 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/graph15435091697031141030.txt' '-o' '/tmp/graph15435091697031141030.bin' '-w' '/tmp/graph15435091697031141030.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15435091697031141030.bin' '-l' '-1' '-v' '-w' '/tmp/graph15435091697031141030.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:12:36] [INFO ] Decomposing Gal with order
[2024-05-22 00:12:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:12:36] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 00:12:36] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:12:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 00:12:36] [INFO ] Time to serialize gal into /tmp/CTLFireability5982262417190338779.gal : 3 ms
[2024-05-22 00:12:36] [INFO ] Time to serialize properties into /tmp/CTLFireability6136711579225162373.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/CTLFireability5982262417190338779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6136711579225162373.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,5.71977e+15,0.220031,13572,2185,67,23324,470,719,30977,86,1272,0


Converting to forward existential form...Done !
original formula: (AF((E((i7.i2.u58.p210==1) U AG(((i0.i0.u0.p11==1)&&(i0.i2.u12.p34==1)))) + ((i10.i1.u68.p261==1)&&(i10.i1.u74.p266==1)))) + AX((AX((i8.i...428
=> equivalent forward existential formula: ([(EY(EY((Init * !(!(EG(!((E((i7.i2.u58.p210==1) U !(E(TRUE U !(((i0.i0.u0.p11==1)&&(i0.i2.u12.p34==1)))))) + ((...681
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t88, t100, t120, t176, i0.t134, i0.i1.u33.t79, i0.i2.u12.t116, i1.i0.u15.t110, ...768
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 220/220 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 248 transition count 202
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 248 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 248 transition count 200
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 240 transition count 192
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 240 transition count 192
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 62 place count 240 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 239 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 239 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 239 transition count 182
Applied a total of 65 rules in 8 ms. Remains 239 /266 variables (removed 27) and now considering 182/220 (removed 38) transitions.
// Phase 1: matrix 182 rows 239 cols
[2024-05-22 00:13:06] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 00:13:06] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-22 00:13:06] [INFO ] Invariant cache hit.
[2024-05-22 00:13:06] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-22 00:13:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:13:09] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:13:10] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:13:11] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:13:13] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 10/101 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:13:14] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 4/105 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:16] [INFO ] Deduced a trap composed of 35 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:17] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (OVERLAPS) 182/421 variables, 239/346 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:20] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:13:20] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:13:20] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:13:20] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/421 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:13:21] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:13:22] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:13:22] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:13:22] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:13:22] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/421 variables, 7/357 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:13:23] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/421 variables, 3/360 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:26] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/421 variables, 1/361 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/421 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 18 (OVERLAPS) 0/421 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 421/421 variables, and 361 constraints, problems are : Problem set: 0 solved, 181 unsolved in 24014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/239 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 13/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 62/122 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:32] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:33] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (OVERLAPS) 182/421 variables, 239/363 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 181/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:36] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:13:37] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:13:55] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 547 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 67/67 constraints]
After SMT, in 54039ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 54042ms
Starting structural reductions in LTL mode, iteration 1 : 239/266 places, 182/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54298 ms. Remains : 239/266 places, 182/220 transitions.
[2024-05-22 00:14:00] [INFO ] Flatten gal took : 6 ms
[2024-05-22 00:14:00] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:14:00] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-22 00:14:00] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:14:00] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:14:00] [INFO ] Time to serialize gal into /tmp/CTLFireability5373955989424153552.gal : 1 ms
[2024-05-22 00:14:00] [INFO ] Time to serialize properties into /tmp/CTLFireability1941636544679560564.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/CTLFireability5373955989424153552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1941636544679560564.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:14:30] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:14:30] [INFO ] Applying decomposition
[2024-05-22 00:14:30] [INFO ] Flatten gal took : 4 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/graph15740132719723021906.txt' '-o' '/tmp/graph15740132719723021906.bin' '-w' '/tmp/graph15740132719723021906.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15740132719723021906.bin' '-l' '-1' '-v' '-w' '/tmp/graph15740132719723021906.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:14:30] [INFO ] Decomposing Gal with order
[2024-05-22 00:14:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:14:31] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 00:14:31] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:14:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 00:14:31] [INFO ] Time to serialize gal into /tmp/CTLFireability2339680528737277904.gal : 3 ms
[2024-05-22 00:14:31] [INFO ] Time to serialize properties into /tmp/CTLFireability9230642842570221720.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/CTLFireability2339680528737277904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9230642842570221720.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,5.68614e+15,0.393351,18288,2616,71,32791,480,685,56109,82,1213,0


Converting to forward existential form...Done !
original formula: A(((i2.u7.p24==1) * EG(((((i4.i0.u20.p77==1)||((i9.i0.u45.p162==1)&&(i9.i0.u52.p187==1)))||((i8.u47.p158==1)||(!((i3.i0.u27.p93==1)&&(i10...386
=> equivalent forward existential formula: [((Init * !(EG(!((EG(!(((i6.i2.u77.p273==1)||(i2.u7.p22==1)))) + (!(E(TRUE U !((i2.u8.p26!=1)))) * !(EX(((((i2.u...869
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t58, t87, t119, t176, i0.t134, i0.i1.u11.t115, i1.u9.t121, i1.u9.t122, i1.u13.t112, ...750
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 220/220 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 248 transition count 202
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 248 transition count 202
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 248 transition count 200
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 242 transition count 194
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 242 transition count 194
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 242 transition count 188
Applied a total of 56 rules in 13 ms. Remains 242 /266 variables (removed 24) and now considering 188/220 (removed 32) transitions.
// Phase 1: matrix 188 rows 242 cols
[2024-05-22 00:15:01] [INFO ] Computed 60 invariants in 1 ms
[2024-05-22 00:15:01] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-22 00:15:01] [INFO ] Invariant cache hit.
[2024-05-22 00:15:01] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 187 sub problems to find dead transitions.
[2024-05-22 00:15:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:03] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:15:03] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:15:03] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:15:03] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:15:04] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:15:05] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:15:05] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:05] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:15:05] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:15:05] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:15:05] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:15:05] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:15:05] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:15:05] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 27 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 13/93 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:15:06] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 00:15:07] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:15:08] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:15:09] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:15:10] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:12] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/242 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (OVERLAPS) 188/430 variables, 242/347 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:15] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:15:15] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-22 00:15:15] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:15:16] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:15:16] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:15:16] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:15:16] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 7/354 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:17] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:15:17] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 2/356 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:18] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:15:19] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/430 variables, 2/358 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/430 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:15:23] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/430 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/430 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:27] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/430 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/430 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:30] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/430 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 430/430 variables, and 363 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 187 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/241 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/241 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 2 (OVERLAPS) 1/242 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 61/121 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:32] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-22 00:15:33] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 8 (OVERLAPS) 188/430 variables, 242/366 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/430 variables, 187/553 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:15:36] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 3/556 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:15:42] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:15:43] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:15:43] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:15:43] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:15:43] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 6/562 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 430/430 variables, and 562 constraints, problems are : Problem set: 0 solved, 187 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 242/242 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 73/73 constraints]
After SMT, in 60040ms problems are : Problem set: 0 solved, 187 unsolved
Search for dead transitions found 0 dead transitions in 60042ms
Starting structural reductions in LTL mode, iteration 1 : 242/266 places, 188/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60317 ms. Remains : 242/266 places, 188/220 transitions.
[2024-05-22 00:16:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:16:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:16:01] [INFO ] Input system was already deterministic with 188 transitions.
[2024-05-22 00:16:01] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:16:01] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:16:01] [INFO ] Time to serialize gal into /tmp/CTLFireability14635955499868240935.gal : 1 ms
[2024-05-22 00:16:01] [INFO ] Time to serialize properties into /tmp/CTLFireability9281809224404589795.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14635955499868240935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9281809224404589795.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,5.76433e+15,23.4969,670992,2,416913,5,2.59723e+06,6,0,1157,2.73392e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 00:16:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:16:31] [INFO ] Applying decomposition
[2024-05-22 00:16:31] [INFO ] Flatten gal took : 4 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/graph16395601211627746679.txt' '-o' '/tmp/graph16395601211627746679.bin' '-w' '/tmp/graph16395601211627746679.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16395601211627746679.bin' '-l' '-1' '-v' '-w' '/tmp/graph16395601211627746679.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:16:31] [INFO ] Decomposing Gal with order
[2024-05-22 00:16:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:16:31] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-22 00:16:31] [INFO ] Flatten gal took : 17 ms
[2024-05-22 00:16:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 7 labels/synchronizations in 4 ms.
[2024-05-22 00:16:31] [INFO ] Time to serialize gal into /tmp/CTLFireability4628138565923652285.gal : 3 ms
[2024-05-22 00:16:31] [INFO ] Time to serialize properties into /tmp/CTLFireability1296061037474645253.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/CTLFireability4628138565923652285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1296061037474645253.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,5.76433e+15,0.385445,18820,2782,69,35012,425,663,55517,81,1260,0


Converting to forward existential form...Done !
original formula: (AF(AG(E(E(((i10.i0.u44.p164==1)&&(i10.i0.u51.p190==1)) U (i1.u35.p134==1)) U (E(((i6.u28.p106==1)&&(i6.u30.p118==1)) U (i11.i1.u69.p252=...451
=> equivalent forward existential formula: [FwdG((Init * !((!((E(!((i3.u12.p42==1)) U (!(E(TRUE U (i10.i1.u53.p195!=1))) * !((i3.u12.p42==1)))) + EG(!((i3....735
Reverse transition relation is NOT exact ! Due to transitions t0, t53, t57, t138, t180, i0.i1.u33.t80, i0.i2.u77.t17, i1.u35.t77, i2.u13.t115, i2.u15.t112,...770
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
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 : 266/266 places, 220/220 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 247 transition count 201
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 247 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 247 transition count 200
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 238 transition count 191
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 238 transition count 191
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 66 place count 238 transition count 182
Applied a total of 66 rules in 7 ms. Remains 238 /266 variables (removed 28) and now considering 182/220 (removed 38) transitions.
// Phase 1: matrix 182 rows 238 cols
[2024-05-22 00:17:01] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 00:17:01] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-22 00:17:01] [INFO ] Invariant cache hit.
[2024-05-22 00:17:01] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-22 00:17:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:17:04] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:17:04] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:17:04] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:17:04] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:17:04] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:17:04] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:17:04] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:17:04] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:17:04] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:17:04] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:17:04] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:17:04] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-22 00:17:04] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:17:05] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:17:05] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:17:05] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:17:05] [INFO ] Deduced a trap composed of 10 places in 19 ms of which 1 ms to minimize.
[2024-05-22 00:17:05] [INFO ] Deduced a trap composed of 11 places in 20 ms of which 0 ms to minimize.
[2024-05-22 00:17:05] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 19/79 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:17:05] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:17:05] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-22 00:17:05] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:17:05] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:17:05] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 24 places in 18 ms of which 1 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:17:06] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 17/96 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:17:07] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:17:07] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:17:08] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/238 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:17:10] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:17:11] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 182/420 variables, 238/339 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 2 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:17:13] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:17:14] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/420 variables, 9/348 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 34 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:17:16] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:17:17] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/420 variables, 13/361 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/420 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 15 (OVERLAPS) 0/420 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 420/420 variables, and 361 constraints, problems are : Problem set: 0 solved, 181 unsolved in 19863 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/237 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/238 variables, 32/44 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 63/123 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/420 variables, 238/361 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/420 variables, 181/542 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/420 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:17:34] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:17:34] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/420 variables, 2/544 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-22 00:17:51] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 420/420 variables, and 545 constraints, problems are : Problem set: 0 solved, 181 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 66/66 constraints]
After SMT, in 49892ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 49894ms
Starting structural reductions in LTL mode, iteration 1 : 238/266 places, 182/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50149 ms. Remains : 238/266 places, 182/220 transitions.
[2024-05-22 00:17:51] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:17:51] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:17:51] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-22 00:17:51] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:17:51] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:17:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6132439562773511167.gal : 2 ms
[2024-05-22 00:17:51] [INFO ] Time to serialize properties into /tmp/CTLFireability6605193775216176931.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/CTLFireability6132439562773511167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6605193775216176931.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,6.0935e+15,23.9648,675820,2,416172,5,2.57929e+06,6,0,1135,2.72436e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 00:18:21] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:18:21] [INFO ] Applying decomposition
[2024-05-22 00:18:21] [INFO ] Flatten gal took : 4 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/graph13646025600005592423.txt' '-o' '/tmp/graph13646025600005592423.bin' '-w' '/tmp/graph13646025600005592423.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13646025600005592423.bin' '-l' '-1' '-v' '-w' '/tmp/graph13646025600005592423.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:18:21] [INFO ] Decomposing Gal with order
[2024-05-22 00:18:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:18:21] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 00:18:21] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:18:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-22 00:18:21] [INFO ] Time to serialize gal into /tmp/CTLFireability5736191719267898223.gal : 3 ms
[2024-05-22 00:18:21] [INFO ] Time to serialize properties into /tmp/CTLFireability15992073120133578220.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/CTLFireability5736191719267898223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15992073120133578220.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,6.0935e+15,0.538597,25936,2937,68,56271,603,668,66432,80,2082,0


Converting to forward existential form...Done !
original formula: EF((EX(((i4.u15.p53==0)||(i12.i1.u69.p242==0))) * EX(EG(((i1.i0.u4.p3==0)||(i3.u11.p41==0))))))
=> equivalent forward existential formula: [FwdG(EY((FwdU(Init,TRUE) * EX(((i4.u15.p53==0)||(i12.i1.u69.p242==0))))),((i1.i0.u4.p3==0)||(i3.u11.p41==0)))] ...163
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t58, t87, t134, t176, i0.u37.t76, i1.i0.u34.t79, i2.t122, i2.u8.t127, i2.u8.t128, i2...734
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 220/220 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 246 transition count 200
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 246 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 246 transition count 198
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 237 transition count 189
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 237 transition count 189
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 69 place count 237 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 236 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 236 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 236 transition count 178
Applied a total of 72 rules in 14 ms. Remains 236 /266 variables (removed 30) and now considering 178/220 (removed 42) transitions.
// Phase 1: matrix 178 rows 236 cols
[2024-05-22 00:18:51] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 00:18:51] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-22 00:18:51] [INFO ] Invariant cache hit.
[2024-05-22 00:18:52] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-22 00:18:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:18:54] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 4 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 0 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:18:55] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 34 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:18:56] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:18:57] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:18:58] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 178/414 variables, 236/332 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:19:01] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:19:02] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-22 00:19:03] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:19:04] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:19:05] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 5/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 14 (OVERLAPS) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 346 constraints, problems are : Problem set: 0 solved, 177 unsolved in 16943 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 50/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:19:10] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 178/414 variables, 236/350 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 177/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 527 constraints, problems are : Problem set: 0 solved, 177 unsolved in 27360 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 54/54 constraints]
After SMT, in 44321ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 44323ms
Starting structural reductions in LTL mode, iteration 1 : 236/266 places, 178/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44610 ms. Remains : 236/266 places, 178/220 transitions.
[2024-05-22 00:19:36] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:19:36] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:19:36] [INFO ] Input system was already deterministic with 178 transitions.
[2024-05-22 00:19:36] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:19:36] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:19:36] [INFO ] Time to serialize gal into /tmp/CTLFireability10142245313231254455.gal : 1 ms
[2024-05-22 00:19:36] [INFO ] Time to serialize properties into /tmp/CTLFireability13041844161155243580.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/CTLFireability10142245313231254455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13041844161155243580.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71666e+15,23.2665,666696,2,415900,5,2.57807e+06,6,0,1123,2.72328e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 00:20:06] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:20:06] [INFO ] Applying decomposition
[2024-05-22 00:20:06] [INFO ] Flatten gal took : 5 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/graph7493670210804032144.txt' '-o' '/tmp/graph7493670210804032144.bin' '-w' '/tmp/graph7493670210804032144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7493670210804032144.bin' '-l' '-1' '-v' '-w' '/tmp/graph7493670210804032144.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:20:06] [INFO ] Decomposing Gal with order
[2024-05-22 00:20:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:20:06] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 00:20:06] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:20:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 00:20:06] [INFO ] Time to serialize gal into /tmp/CTLFireability8255902357399467198.gal : 3 ms
[2024-05-22 00:20:06] [INFO ] Time to serialize properties into /tmp/CTLFireability15094332307725246673.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/CTLFireability8255902357399467198.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15094332307725246673.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.71666e+15,0.630919,28896,3450,78,62508,572,657,77949,82,1705,0


Converting to forward existential form...Done !
original formula: EF(AX(((i9.i0.u43.p164==1)&&(i9.i0.u51.p190==1))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(((i9.i0.u43.p164==1)&&(i9.i0.u51.p190==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t58, t87, t131, t172, i0.i2.u32.t79, i0.i3.u77.t17, i1.t119, i1.u8.t124, i1.u8.t125,...730
(forward)formula 0,1,2.20315,79848,1,0,160481,683,2617,327965,364,2108,279544
FORMULA DES-PT-01b-CTLFireability-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 266/266 places, 220/220 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 246 transition count 200
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 246 transition count 200
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 246 transition count 198
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 51 place count 237 transition count 189
Iterating global reduction 1 with 9 rules applied. Total rules applied 60 place count 237 transition count 189
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 69 place count 237 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 70 place count 236 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 71 place count 236 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 236 transition count 178
Applied a total of 72 rules in 12 ms. Remains 236 /266 variables (removed 30) and now considering 178/220 (removed 42) transitions.
[2024-05-22 00:20:08] [INFO ] Invariant cache hit.
[2024-05-22 00:20:08] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 00:20:08] [INFO ] Invariant cache hit.
[2024-05-22 00:20:09] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-22 00:20:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:20:11] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:20:12] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 34 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:20:13] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
[2024-05-22 00:20:14] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:20:15] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 178/414 variables, 236/332 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:20:18] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:20:19] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:20:20] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/414 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-22 00:20:21] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-05-22 00:20:22] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 10 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/414 variables, 5/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 14 (OVERLAPS) 0/414 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 346 constraints, problems are : Problem set: 0 solved, 177 unsolved in 17451 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/236 variables, 33/46 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 14/60 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 50/110 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-22 00:20:27] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:20:27] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:20:27] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:20:28] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (OVERLAPS) 178/414 variables, 236/350 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 177/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 527 constraints, problems are : Problem set: 0 solved, 177 unsolved in 27432 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 54/54 constraints]
After SMT, in 44899ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 44901ms
Starting structural reductions in LTL mode, iteration 1 : 236/266 places, 178/220 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45165 ms. Remains : 236/266 places, 178/220 transitions.
[2024-05-22 00:20:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:20:54] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:20:54] [INFO ] Input system was already deterministic with 178 transitions.
[2024-05-22 00:20:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:20:54] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:20:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15711779473989422474.gal : 1 ms
[2024-05-22 00:20:54] [INFO ] Time to serialize properties into /tmp/CTLFireability13801982798468642206.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/CTLFireability15711779473989422474.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13801982798468642206.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.71666e+15,23.7251,667420,2,415900,5,2.57807e+06,6,0,1123,2.72328e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 00:21:24] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:21:24] [INFO ] Applying decomposition
[2024-05-22 00:21:24] [INFO ] Flatten gal took : 3 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/graph9331743582334658663.txt' '-o' '/tmp/graph9331743582334658663.bin' '-w' '/tmp/graph9331743582334658663.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9331743582334658663.bin' '-l' '-1' '-v' '-w' '/tmp/graph9331743582334658663.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:21:24] [INFO ] Decomposing Gal with order
[2024-05-22 00:21:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:21:24] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 00:21:24] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:21:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 00:21:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5922120751409363171.gal : 2 ms
[2024-05-22 00:21:24] [INFO ] Time to serialize properties into /tmp/CTLFireability1952489312681004379.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/CTLFireability5922120751409363171.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1952489312681004379.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.71666e+15,0.339314,18280,2666,74,34829,557,686,48178,85,1543,0


Converting to forward existential form...Done !
original formula: (AX(AG(!(A(E((i8.i0.u39.p156==1) U ((i9.i1.u43.p164==1)&&(i9.i1.u49.p190==1))) U EF(((i9.i1.u43.p164==1)&&(i9.i1.u49.p190==1))))))) + AF(...230
=> equivalent forward existential formula: [FwdG((Init * !(!(EX(!(!(E(TRUE U !(!(!((E(!(E(TRUE U ((i9.i1.u43.p164==1)&&(i9.i1.u49.p190==1)))) U (!(E((i8.i0...435
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t56, t131, t172, i0.i0.u30.t79, i0.i2.u74.t17, i1.u14.t109, i2.t119, i2.u7.t124, i2....735
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 266/266 places, 220/220 transitions.
Graph (complete) has 480 edges and 266 vertex of which 260 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 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 259 transition count 196
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 240 transition count 196
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 39 place count 240 transition count 185
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 61 place count 229 transition count 185
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 73 place count 217 transition count 173
Iterating global reduction 2 with 12 rules applied. Total rules applied 85 place count 217 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 217 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 87 place count 217 transition count 170
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 89 place count 216 transition count 170
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 97 place count 208 transition count 162
Iterating global reduction 3 with 8 rules applied. Total rules applied 105 place count 208 transition count 162
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 8 rules applied. Total rules applied 113 place count 208 transition count 154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 207 transition count 154
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 114 place count 207 transition count 153
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 116 place count 206 transition count 153
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 244 place count 142 transition count 89
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 245 place count 142 transition count 88
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 248 place count 142 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 250 place count 140 transition count 86
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 252 place count 138 transition count 86
Applied a total of 252 rules in 72 ms. Remains 138 /266 variables (removed 128) and now considering 86/220 (removed 134) transitions.
// Phase 1: matrix 86 rows 138 cols
[2024-05-22 00:21:54] [INFO ] Computed 56 invariants in 1 ms
[2024-05-22 00:21:54] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 00:21:54] [INFO ] Invariant cache hit.
[2024-05-22 00:21:54] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [10, 47, 51, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 78, 80, 82, 84, 86, 110, 133]
Discarding 20 places :
Implicit Place search using SMT with State Equation took 185 ms to find 20 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 118/266 places, 86/220 transitions.
Graph (complete) has 243 edges and 118 vertex of which 116 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 2 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 1 place count 114 transition count 74
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 105 transition count 74
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 0 with 28 rules applied. Total rules applied 47 place count 87 transition count 64
Applied a total of 47 rules in 7 ms. Remains 87 /118 variables (removed 31) and now considering 64/86 (removed 22) transitions.
// Phase 1: matrix 64 rows 87 cols
[2024-05-22 00:21:54] [INFO ] Computed 27 invariants in 1 ms
[2024-05-22 00:21:54] [INFO ] Implicit Places using invariants in 48 ms returned [50, 54, 55, 58, 61, 62, 65, 72, 75]
[2024-05-22 00:21:54] [INFO ] Actually due to overlaps returned [50, 58, 65, 72, 75]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 49 ms to find 5 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 82/266 places, 64/220 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 81 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 81 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 80 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 80 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 79 transition count 60
Applied a total of 6 rules in 6 ms. Remains 79 /82 variables (removed 3) and now considering 60/64 (removed 4) transitions.
// Phase 1: matrix 60 rows 79 cols
[2024-05-22 00:21:54] [INFO ] Computed 22 invariants in 0 ms
[2024-05-22 00:21:54] [INFO ] Implicit Places using invariants in 58 ms returned [53, 54, 59, 60]
[2024-05-22 00:21:54] [INFO ] Actually due to overlaps returned [53, 59]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 59 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 77/266 places, 60/220 transitions.
Applied a total of 0 rules in 3 ms. Remains 77 /77 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 4 iterations and 382 ms. Remains : 77/266 places, 60/220 transitions.
[2024-05-22 00:21:54] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:21:54] [INFO ] Flatten gal took : 3 ms
[2024-05-22 00:21:54] [INFO ] Input system was already deterministic with 60 transitions.
[2024-05-22 00:21:54] [INFO ] Flatten gal took : 2 ms
[2024-05-22 00:21:54] [INFO ] Flatten gal took : 1 ms
[2024-05-22 00:21:54] [INFO ] Time to serialize gal into /tmp/CTLFireability887766086995929101.gal : 0 ms
[2024-05-22 00:21:54] [INFO ] Time to serialize properties into /tmp/CTLFireability1614170263145340639.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/CTLFireability887766086995929101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1614170263145340639.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.93486e+07,0.075449,6812,2,4768,5,15102,6,0,365,13351,0


Converting to forward existential form...Done !
original formula: EF(((AF(((p81==1)&&(p102==1))) * ((p21!=1)||((p45==1)&&(p126==1)))) + (((p217==1)&&(p192==0))&&(p113==0))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((p21!=1)||((p45==1)&&(p126==1)))) * !(EG(!(((p81==1)&&(p102==1))))))] != FALSE + [(FwdU(I...214
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t9, t13, t15, t41, t42, t44, t45, t46, t51, t56, t57, t58, t59, Intersection wit...236
Detected timeout of ITS tools.
[2024-05-22 00:22:24] [INFO ] Flatten gal took : 1 ms
[2024-05-22 00:22:24] [INFO ] Applying decomposition
[2024-05-22 00:22:24] [INFO ] Flatten gal took : 1 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/graph16619903768593917256.txt' '-o' '/tmp/graph16619903768593917256.bin' '-w' '/tmp/graph16619903768593917256.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16619903768593917256.bin' '-l' '-1' '-v' '-w' '/tmp/graph16619903768593917256.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:22:24] [INFO ] Decomposing Gal with order
[2024-05-22 00:22:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:22:24] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 00:22:24] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:22:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 1 ms.
[2024-05-22 00:22:24] [INFO ] Time to serialize gal into /tmp/CTLFireability4879728196309009940.gal : 1 ms
[2024-05-22 00:22:24] [INFO ] Time to serialize properties into /tmp/CTLFireability3810969212216036211.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/CTLFireability4879728196309009940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3810969212216036211.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.93486e+07,0.028999,4628,407,77,1916,232,243,2575,75,586,0


Converting to forward existential form...Done !
original formula: EF(((AF(((i3.u9.p81==1)&&(i4.u11.p102==1))) * ((u1.p21!=1)||((i5.i0.u5.p45==1)&&(i5.i1.u3.p126==1)))) + (((i2.u20.p217==1)&&(i2.u19.p192=...183
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * ((u1.p21!=1)||((i5.i0.u5.p45==1)&&(i5.i1.u3.p126==1)))) * !(EG(!(((i3.u9.p81==1)&&(i4.u11....272
Reverse transition relation is NOT exact ! Due to transitions t41, t56, t59, u1.t15, u2.t13, i2.u19.t0, i2.u21.t46, i3.t44, i3.u10.t51, i4.t42, i4.u11.t3, ...300
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,2.0735,84356,1,0,153399,822,1163,205305,353,2963,155762
FORMULA DES-PT-01b-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

[2024-05-22 00:22:26] [INFO ] Flatten gal took : 7 ms
[2024-05-22 00:22:26] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:22:26] [INFO ] Applying decomposition
[2024-05-22 00:22:26] [INFO ] Flatten gal took : 5 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/graph9213073878750911759.txt' '-o' '/tmp/graph9213073878750911759.bin' '-w' '/tmp/graph9213073878750911759.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9213073878750911759.bin' '-l' '-1' '-v' '-w' '/tmp/graph9213073878750911759.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:22:26] [INFO ] Decomposing Gal with order
[2024-05-22 00:22:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:22:26] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-22 00:22:26] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:22:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2024-05-22 00:22:26] [INFO ] Time to serialize gal into /tmp/CTLFireability2222811661327038007.gal : 2 ms
[2024-05-22 00:22:26] [INFO ] Time to serialize properties into /tmp/CTLFireability8651204505713923149.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/CTLFireability2222811661327038007.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8651204505713923149.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 13 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,9.36675e+16,1.20015,55112,4970,87,89645,558,684,340628,94,1448,0


Converting to forward existential form...Done !
original formula: (AG((i6.u25.p84==0)) + EG(!(E(AX((i10.u67.p211!=1)) U (i6.u28.p92==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG(!(E(!(EX(!((i10.u67.p211!=1)))) U (i6.u28.p92==1)))))),TRUE) * !((i6.u25.p84==0)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t142, t160, i0.u41.t78, i1.t148, i1.u9.t144, i1.u9.t146, i2.u15.t128, i3.t188, i3.t1...845
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-22 00:37:28] [INFO ] Applying decomposition
[2024-05-22 00:37:28] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:37:28] [INFO ] Decomposing Gal with order
[2024-05-22 00:37:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:37:28] [INFO ] Removed a total of 20 redundant transitions.
[2024-05-22 00:37:28] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:37:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 97 labels/synchronizations in 5 ms.
[2024-05-22 00:37:28] [INFO ] Time to serialize gal into /tmp/CTLFireability10784922718574027481.gal : 3 ms
[2024-05-22 00:37:28] [INFO ] Time to serialize properties into /tmp/CTLFireability2255884091764639444.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/CTLFireability10784922718574027481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2255884091764639444.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 13 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,9.36675e+16,17.3567,545672,57811,307,617975,2079,654,5.33206e+06,155,6829,0


Converting to forward existential form...Done !
original formula: (AG((i1.i0.i1.i0.i1.i0.u26.p84==0)) + EG(!(E(AX((i1.i1.i0.i1.i0.i0.i1.i0.i1.u109.p211!=1)) U (i1.i0.i1.i0.i1.i0.i1.u133.p92==1)))))
=> equivalent forward existential formula: [(FwdU((Init * !(EG(!(E(!(EX(!((i1.i1.i0.i1.i0.i0.i1.i0.i1.u109.p211!=1)))) U (i1.i0.i1.i0.i1.i0.i1.u133.p92==1)...212
Reverse transition relation is NOT exact ! Due to transitions t160, i0.t0, i1.i0.i0.i0.u19.t122, i1.i0.i0.i0.u19.t124, i1.i0.i0.i0.i0.u18.t128, i1.i0.i0.i0...1976

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="DES-PT-01b"
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 DES-PT-01b, 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 r092-tall-171624189700626"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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