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.r356-tall-171683760600234.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 ShieldIIPt-PT-004B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683760600234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Apr 12 20:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 12 20:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 12 20:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 67K May 18 16:43 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 ShieldIIPt-PT-004B-CTLFireability-2024-00
FORMULA_NAME ShieldIIPt-PT-004B-CTLFireability-2024-01
FORMULA_NAME ShieldIIPt-PT-004B-CTLFireability-2024-02
FORMULA_NAME ShieldIIPt-PT-004B-CTLFireability-2024-03
FORMULA_NAME ShieldIIPt-PT-004B-CTLFireability-2024-04
FORMULA_NAME ShieldIIPt-PT-004B-CTLFireability-2024-05
FORMULA_NAME ShieldIIPt-PT-004B-CTLFireability-2024-06
FORMULA_NAME ShieldIIPt-PT-004B-CTLFireability-2024-07
FORMULA_NAME ShieldIIPt-PT-004B-CTLFireability-2024-08
FORMULA_NAME ShieldIIPt-PT-004B-CTLFireability-2024-09
FORMULA_NAME ShieldIIPt-PT-004B-CTLFireability-2024-10
FORMULA_NAME ShieldIIPt-PT-004B-CTLFireability-2024-11
FORMULA_NAME ShieldIIPt-PT-004B-CTLFireability-2023-12
FORMULA_NAME ShieldIIPt-PT-004B-CTLFireability-2023-13
FORMULA_NAME ShieldIIPt-PT-004B-CTLFireability-2023-14
FORMULA_NAME ShieldIIPt-PT-004B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716926930200

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-004B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-28 20:08:51] [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-28 20:08:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 20:08:51] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-28 20:08:51] [INFO ] Transformed 283 places.
[2024-05-28 20:08:51] [INFO ] Transformed 263 transitions.
[2024-05-28 20:08:51] [INFO ] Found NUPN structural information;
[2024-05-28 20:08:51] [INFO ] Parsed PT model containing 283 places and 263 transitions and 654 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 86 out of 283 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 283/283 places, 263/263 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 258 transition count 238
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 258 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 257 transition count 237
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 257 transition count 237
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 256 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 256 transition count 236
Applied a total of 54 rules in 57 ms. Remains 256 /283 variables (removed 27) and now considering 236/263 (removed 27) transitions.
// Phase 1: matrix 236 rows 256 cols
[2024-05-28 20:08:51] [INFO ] Computed 37 invariants in 19 ms
[2024-05-28 20:08:51] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-05-28 20:08:51] [INFO ] Invariant cache hit.
[2024-05-28 20:08:52] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 483 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-05-28 20:08:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/256 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:08:54] [INFO ] Deduced a trap composed of 17 places in 179 ms of which 75 ms to minimize.
[2024-05-28 20:08:54] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:08:54] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:08:54] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2024-05-28 20:08:54] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-05-28 20:08:55] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:08:55] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-28 20:08:55] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:08:55] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-28 20:08:55] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-28 20:08:55] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:08:55] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-28 20:08:55] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-28 20:08:55] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2024-05-28 20:08:56] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 0 ms to minimize.
[2024-05-28 20:08:56] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 18 ms to minimize.
[2024-05-28 20:08:56] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 2 ms to minimize.
[2024-05-28 20:08:56] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2024-05-28 20:08:56] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:08:56] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:08:56] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 2 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 3 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:08:57] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:08:58] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:08:59] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:08:59] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:09:00] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:09:00] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 4/81 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:09:01] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 236/492 variables, 256/338 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:09:04] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:09:04] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:09:04] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:09:04] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 4/342 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:09:06] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:09:06] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-28 20:09:06] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:09:06] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:09:06] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:09:06] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 6/348 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:09:09] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:09:09] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 4 ms to minimize.
[2024-05-28 20:09:10] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:09:10] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 4/352 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:09:11] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:09:13] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 1/354 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:09:16] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/492 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 15 (OVERLAPS) 0/492 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/492 variables, and 355 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/256 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 62/99 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:09:23] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:09:24] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:09:26] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:09:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 7 (OVERLAPS) 236/492 variables, 256/359 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 235/594 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:09:29] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:09:29] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:09:30] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:09:30] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:09:31] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:09:31] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:09:31] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 7/601 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:09:34] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:09:38] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
[2024-05-28 20:09:39] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 2/604 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:09:43] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 2 ms to minimize.
[2024-05-28 20:09:44] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/492 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 235 unsolved
[2024-05-28 20:09:48] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:09:50] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:09:50] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/492 variables, 3/609 constraints. Problems are: Problem set: 0 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 492/492 variables, and 609 constraints, problems are : Problem set: 0 solved, 235 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 81/81 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 256/283 places, 236/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60675 ms. Remains : 256/283 places, 236/263 transitions.
Support contains 86 out of 256 places after structural reductions.
[2024-05-28 20:09:52] [INFO ] Flatten gal took : 44 ms
[2024-05-28 20:09:52] [INFO ] Flatten gal took : 18 ms
[2024-05-28 20:09:52] [INFO ] Input system was already deterministic with 236 transitions.
Support contains 81 out of 256 places (down from 86) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1505 ms. (26 steps per ms) remains 3/66 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/2 properties
BEST_FIRST walk for 31581 steps (7 resets) in 48 ms. (644 steps per ms) remains 0/1 properties
[2024-05-28 20:09:53] [INFO ] Flatten gal took : 12 ms
[2024-05-28 20:09:53] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:09:53] [INFO ] Input system was already deterministic with 236 transitions.
Computed a total of 66 stabilizing places and 66 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 238 transition count 218
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 238 transition count 218
Applied a total of 36 rules in 7 ms. Remains 238 /256 variables (removed 18) and now considering 218/236 (removed 18) transitions.
// Phase 1: matrix 218 rows 238 cols
[2024-05-28 20:09:53] [INFO ] Computed 37 invariants in 3 ms
[2024-05-28 20:09:53] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-28 20:09:53] [INFO ] Invariant cache hit.
[2024-05-28 20:09:53] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-28 20:09:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:09:55] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:09:55] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:09:55] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:09:55] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:09:55] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-28 20:09:55] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:09:55] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:09:55] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:09:55] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:09:55] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:09:55] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:09:56] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:09:56] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:09:56] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:09:56] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
[2024-05-28 20:09:56] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:09:56] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:09:56] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
[2024-05-28 20:09:56] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:09:56] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:09:56] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:09:56] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:09:57] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-28 20:09:57] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:09:57] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:09:57] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:09:57] [INFO ] Deduced a trap composed of 18 places in 17 ms of which 0 ms to minimize.
[2024-05-28 20:09:57] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:09:57] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:09:57] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:09:57] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:09:57] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:09:57] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:09:57] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:09:57] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:09:59] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/456 variables, 238/311 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 8 (OVERLAPS) 0/456 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 311 constraints, problems are : Problem set: 0 solved, 217 unsolved in 11015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 36/73 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/456 variables, 238/311 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 217/528 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:10:07] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:10:07] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:10:07] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-28 20:10:07] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-28 20:10:07] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-28 20:10:07] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-28 20:10:08] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
[2024-05-28 20:10:08] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:10:08] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-28 20:10:08] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:10:09] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 2 ms to minimize.
[2024-05-28 20:10:09] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:10:09] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:10:09] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:10:09] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 15/543 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:10:11] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-28 20:10:11] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-28 20:10:12] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 3/546 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:10:16] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-28 20:10:17] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 2/548 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:10:20] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:10:21] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:10:21] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 3/551 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:10:28] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:10:28] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-28 20:10:29] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/456 variables, 3/554 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 554 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 62/62 constraints]
After SMT, in 41050ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 41053ms
Starting structural reductions in LTL mode, iteration 1 : 238/256 places, 218/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41299 ms. Remains : 238/256 places, 218/236 transitions.
[2024-05-28 20:10:34] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:10:34] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:10:34] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-28 20:10:34] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:10:34] [INFO ] Flatten gal took : 21 ms
[2024-05-28 20:10:34] [INFO ] Time to serialize gal into /tmp/CTLFireability11404827848550321119.gal : 5 ms
[2024-05-28 20:10:34] [INFO ] Time to serialize properties into /tmp/CTLFireability2752830480449177662.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/CTLFireability11404827848550321119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2752830480449177662.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12466e+23,9.40567,280636,2,3971,5,783912,6,0,1172,2.04193e+06,0


Converting to forward existential form...Done !
original formula: EF((((p91==1)&&(p93==1)) * (((p31==1) + EX((p193==1))) + ((p23==1)&&(p62==1)))))
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * ((p91==1)&&(p93==1))) * (p31==1))] != FALSE + [(EY((FwdU(Init,TRUE) * ((p91==1)&&(p93==1)...262
(forward)formula 0,1,9.41146,280636,1,0,9,783912,9,2,1180,2.04193e+06,2
FORMULA ShieldIIPt-PT-004B-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 238 transition count 218
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 238 transition count 218
Applied a total of 36 rules in 12 ms. Remains 238 /256 variables (removed 18) and now considering 218/236 (removed 18) transitions.
// Phase 1: matrix 218 rows 238 cols
[2024-05-28 20:10:44] [INFO ] Computed 37 invariants in 4 ms
[2024-05-28 20:10:44] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-28 20:10:44] [INFO ] Invariant cache hit.
[2024-05-28 20:10:44] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-28 20:10:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:10:46] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:10:46] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:10:46] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:10:46] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:10:46] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:10:46] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:10:46] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:10:46] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-05-28 20:10:46] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:10:46] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:10:46] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-28 20:10:46] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:10:47] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:10:47] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:10:47] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:10:47] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:10:47] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:10:47] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-28 20:10:47] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:10:47] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:10:47] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:10:47] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:10:48] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:10:48] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:10:48] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:10:48] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:10:48] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:10:48] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:10:48] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:10:48] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:10:48] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/456 variables, 238/306 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:10:50] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:10:51] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:10:51] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:10:53] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:10:54] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:10:54] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:10:54] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:10:55] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:10:59] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:10:59] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/456 variables, 2/316 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:11:01] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:11:01] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 2/318 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:11:05] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/456 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 15 (OVERLAPS) 0/456 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 319 constraints, problems are : Problem set: 0 solved, 217 unsolved in 25197 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 44/81 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:11:11] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/456 variables, 238/320 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 217/537 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:11:13] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-28 20:11:13] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:11:13] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:11:13] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:11:13] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:11:14] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 2 ms to minimize.
[2024-05-28 20:11:14] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:11:14] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:11:14] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:11:15] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 10/547 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:11:18] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 1 ms to minimize.
[2024-05-28 20:11:18] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:11:19] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:11:19] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:11:19] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 5/552 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:11:21] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:11:21] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 5 ms to minimize.
[2024-05-28 20:11:22] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-28 20:11:23] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:11:24] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 5/557 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:11:26] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-28 20:11:26] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:11:29] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 1/560 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:11:35] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:11:35] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 2/562 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:11:39] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 563 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 71/71 constraints]
After SMT, in 55238ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 55241ms
Starting structural reductions in LTL mode, iteration 1 : 238/256 places, 218/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55606 ms. Remains : 238/256 places, 218/236 transitions.
[2024-05-28 20:11:39] [INFO ] Flatten gal took : 12 ms
[2024-05-28 20:11:39] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:11:39] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-28 20:11:39] [INFO ] Flatten gal took : 12 ms
[2024-05-28 20:11:39] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:11:39] [INFO ] Time to serialize gal into /tmp/CTLFireability10995460868575256650.gal : 14 ms
[2024-05-28 20:11:39] [INFO ] Time to serialize properties into /tmp/CTLFireability2679034305692125033.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/CTLFireability10995460868575256650.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2679034305692125033.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11042e+23,8.63746,251592,2,3524,5,708223,6,0,1172,1.81429e+06,0


Converting to forward existential form...Done !
original formula: AX(AG((AF(((p161==1)&&(p200==1))) * ((EX((p277==0)) + EF((p209==0))) + ((p246==0)&&(p198==0))))))
=> equivalent forward existential formula: ([FwdG(FwdU(EY(Init),TRUE),!(((p161==1)&&(p200==1))))] = FALSE * [(((FwdU(EY(Init),TRUE) * !(((p246==0)&&(p198==...216
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t16, t20, t25, t29, t33, t35, t36, t38, t39, t40, t41, t42, t43, t45, t46, t50, t54,...505
Hit Full ! (commute/partial/dont) 214/0/4
(forward)formula 0,0,17.2823,388576,1,0,548,1.38658e+06,470,227,7211,2.5716e+06,540
FORMULA ShieldIIPt-PT-004B-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 239 transition count 219
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 239 transition count 219
Applied a total of 34 rules in 6 ms. Remains 239 /256 variables (removed 17) and now considering 219/236 (removed 17) transitions.
// Phase 1: matrix 219 rows 239 cols
[2024-05-28 20:11:57] [INFO ] Computed 37 invariants in 3 ms
[2024-05-28 20:11:57] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-28 20:11:57] [INFO ] Invariant cache hit.
[2024-05-28 20:11:57] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-28 20:11:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:11:59] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 2 ms to minimize.
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:12:00] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:12:01] [INFO ] Deduced a trap composed of 24 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/458 variables, 239/306 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:12:04] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:12:04] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:12:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:12:07] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:12:09] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/458 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:12:14] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:12:14] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/458 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:12:17] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:12:17] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/458 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:12:20] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-28 20:12:20] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/458 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:12:23] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 6 ms to minimize.
[2024-05-28 20:12:23] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/458 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/458 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 18 (OVERLAPS) 0/458 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 319 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:12:28] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:12:28] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/458 variables, 239/321 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 218/539 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:12:31] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:12:31] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:12:31] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:12:32] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:12:32] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:12:32] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:12:32] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:12:32] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:12:32] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:12:32] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
[2024-05-28 20:12:33] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:12:33] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:12:33] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:12:34] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 14/553 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:12:36] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-28 20:12:37] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:12:37] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 3/556 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:12:39] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:12:41] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-28 20:12:41] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:12:41] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 4/560 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:12:45] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 12 (OVERLAPS) 0/458 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 561 constraints, problems are : Problem set: 0 solved, 218 unsolved in 28082 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 67/67 constraints]
After SMT, in 58106ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 58109ms
Starting structural reductions in LTL mode, iteration 1 : 239/256 places, 219/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58339 ms. Remains : 239/256 places, 219/236 transitions.
[2024-05-28 20:12:55] [INFO ] Flatten gal took : 13 ms
[2024-05-28 20:12:55] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:12:55] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-28 20:12:55] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:12:55] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:12:55] [INFO ] Time to serialize gal into /tmp/CTLFireability11338757682667331812.gal : 2 ms
[2024-05-28 20:12:55] [INFO ] Time to serialize properties into /tmp/CTLFireability17459221753075692968.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/CTLFireability11338757682667331812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17459221753075692968.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.28556e+23,8.48823,249464,2,3519,5,708394,6,0,1177,1.77134e+06,0


Converting to forward existential form...Done !
original formula: ((E((p134==1) U (!(A((p128==1) U (p208==1))) + !(A(((p6==1)&&(p25==1)) U (p2==1))))) * AF((AX((p251==1)) * AF((p12==1))))) * EG(A(AX((p12...174
=> equivalent forward existential formula: (([(Init * !(E((p134==1) U (!(!((E(!((p208==1)) U (!((p128==1)) * !((p208==1)))) + EG(!((p208==1)))))) + !(!((E(...416
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t16, t20, t25, t31, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59, t63,...501
Detected timeout of ITS tools.
[2024-05-28 20:13:25] [INFO ] Flatten gal took : 12 ms
[2024-05-28 20:13:25] [INFO ] Applying decomposition
[2024-05-28 20:13:25] [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/graph4102539874971790665.txt' '-o' '/tmp/graph4102539874971790665.bin' '-w' '/tmp/graph4102539874971790665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4102539874971790665.bin' '-l' '-1' '-v' '-w' '/tmp/graph4102539874971790665.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:13:25] [INFO ] Decomposing Gal with order
[2024-05-28 20:13:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:13:25] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-28 20:13:25] [INFO ] Flatten gal took : 40 ms
[2024-05-28 20:13:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-28 20:13:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16160578580574812920.gal : 7 ms
[2024-05-28 20:13:25] [INFO ] Time to serialize properties into /tmp/CTLFireability5685793396235937785.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/CTLFireability16160578580574812920.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5685793396235937785.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.28556e+23,1.5074,51520,626,29,75956,340,536,300998,49,864,0


Converting to forward existential form...Done !
original formula: ((E((i8.i2.u43.p134==1) U (!(A((i7.u42.p128==1) U (i9.i2.u66.p208==1))) + !(A(((i2.i0.u2.p6==1)&&(i2.i0.u10.p25==1)) U (i2.i1.u1.p2==1)))...265
=> equivalent forward existential formula: (([(Init * !(E((i8.i2.u43.p134==1) U (!(!((E(!((i9.i2.u66.p208==1)) U (!((i7.u42.p128==1)) * !((i9.i2.u66.p208==...559
Reverse transition relation is NOT exact ! Due to transitions t39, t43, t87, t131, t176, i0.i1.t16, i0.i1.u84.t20, i1.t147, i1.u20.t151, i2.t174, i2.i0.u2....940
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 238 transition count 218
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 238 transition count 218
Applied a total of 36 rules in 11 ms. Remains 238 /256 variables (removed 18) and now considering 218/236 (removed 18) transitions.
// Phase 1: matrix 218 rows 238 cols
[2024-05-28 20:13:55] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:13:56] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-28 20:13:56] [INFO ] Invariant cache hit.
[2024-05-28 20:13:56] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-28 20:13:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:13:57] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:13:58] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:13:59] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:13:59] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:13:59] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:13:59] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:13:59] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:13:59] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:13:59] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:13:59] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:13:59] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:14:00] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:14:00] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:14:00] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:14:01] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:14:01] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/456 variables, 238/306 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:14:06] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-28 20:14:06] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:14:06] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/456 variables, 3/309 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (OVERLAPS) 0/456 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 309 constraints, problems are : Problem set: 0 solved, 217 unsolved in 15100 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 34/71 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:14:12] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-28 20:14:12] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 218/456 variables, 238/311 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 217/528 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:14:15] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:14:15] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-28 20:14:15] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-28 20:14:15] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:14:15] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:14:16] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-05-28 20:14:16] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:14:16] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-28 20:14:16] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:14:17] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:14:17] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:14:17] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:14:17] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 13/541 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:14:19] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-28 20:14:19] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-28 20:14:19] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-28 20:14:20] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:14:21] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 5/546 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:14:26] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-28 20:14:28] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/456 variables, 2/548 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:14:31] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/456 variables, and 549 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 57/57 constraints]
After SMT, in 45129ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 45131ms
Starting structural reductions in LTL mode, iteration 1 : 238/256 places, 218/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45387 ms. Remains : 238/256 places, 218/236 transitions.
[2024-05-28 20:14:41] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:14:41] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:14:41] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-28 20:14:41] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:14:41] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:14:41] [INFO ] Time to serialize gal into /tmp/CTLFireability15891760090960517856.gal : 1 ms
[2024-05-28 20:14:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13281502718656948706.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/CTLFireability15891760090960517856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13281502718656948706.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.12466e+23,10.9056,259256,2,3731,5,727858,6,0,1172,1.87703e+06,0


Converting to forward existential form...Done !
original formula: AF(EX(EG((EG((p263==1)) * AF((p186==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EG((EG((p263==1)) * !(EG(!((p186==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t16, t20, t21, t26, t30, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59,...500
Detected timeout of ITS tools.
[2024-05-28 20:15:11] [INFO ] Flatten gal took : 12 ms
[2024-05-28 20:15:11] [INFO ] Applying decomposition
[2024-05-28 20:15:11] [INFO ] Flatten gal took : 6 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/graph17836383556409989371.txt' '-o' '/tmp/graph17836383556409989371.bin' '-w' '/tmp/graph17836383556409989371.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17836383556409989371.bin' '-l' '-1' '-v' '-w' '/tmp/graph17836383556409989371.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:15:11] [INFO ] Decomposing Gal with order
[2024-05-28 20:15:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:15:11] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-28 20:15:11] [INFO ] Flatten gal took : 12 ms
[2024-05-28 20:15:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 20:15:11] [INFO ] Time to serialize gal into /tmp/CTLFireability983374272885849071.gal : 15 ms
[2024-05-28 20:15:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8477009388776194960.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/CTLFireability983374272885849071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8477009388776194960.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12466e+23,1.35239,48360,595,43,79569,534,553,247316,56,1355,0


Converting to forward existential form...Done !
original formula: AF(EX(EG((EG((i15.i1.u86.p263==1)) * AF((i14.i2.u60.p186==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(EG((EG((i15.i1.u86.p263==1)) * !(EG(!((i14.i2.u60.p186==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t39, t83, t127, t173, t175, i0.u88.t7, i0.u88.t11, i1.t147, i1.u18.t151, i2.i0.u7.t177, i2.i1...916
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 255 transition count 190
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 92 place count 210 transition count 188
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 94 place count 208 transition count 188
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 94 place count 208 transition count 161
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 148 place count 181 transition count 161
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 163 place count 166 transition count 146
Iterating global reduction 3 with 15 rules applied. Total rules applied 178 place count 166 transition count 146
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 178 place count 166 transition count 137
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 196 place count 157 transition count 137
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 320 place count 95 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 321 place count 95 transition count 74
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 4 with 2 rules applied. Total rules applied 323 place count 94 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 325 place count 92 transition count 71
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 327 place count 90 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 327 place count 90 transition count 70
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 329 place count 89 transition count 70
Applied a total of 329 rules in 55 ms. Remains 89 /256 variables (removed 167) and now considering 70/236 (removed 166) transitions.
// Phase 1: matrix 70 rows 89 cols
[2024-05-28 20:15:41] [INFO ] Computed 35 invariants in 0 ms
[2024-05-28 20:15:41] [INFO ] Implicit Places using invariants in 55 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 88/256 places, 70/236 transitions.
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 2 place count 87 transition count 69
Applied a total of 2 rules in 4 ms. Remains 87 /88 variables (removed 1) and now considering 69/70 (removed 1) transitions.
// Phase 1: matrix 69 rows 87 cols
[2024-05-28 20:15:41] [INFO ] Computed 34 invariants in 1 ms
[2024-05-28 20:15:41] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-28 20:15:41] [INFO ] Invariant cache hit.
[2024-05-28 20:15:41] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 87/256 places, 69/236 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 232 ms. Remains : 87/256 places, 69/236 transitions.
[2024-05-28 20:15:41] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:15:41] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:15:41] [INFO ] Input system was already deterministic with 69 transitions.
RANDOM walk for 46 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
FORMULA ShieldIIPt-PT-004B-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-28 20:15:41] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:15:41] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:15:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5386665042252029614.gal : 1 ms
[2024-05-28 20:15:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality624465273996721046.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5386665042252029614.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality624465273996721046.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 237 transition count 217
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 237 transition count 217
Applied a total of 38 rules in 7 ms. Remains 237 /256 variables (removed 19) and now considering 217/236 (removed 19) transitions.
// Phase 1: matrix 217 rows 237 cols
[2024-05-28 20:15:41] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 20:15:41] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-28 20:15:41] [INFO ] Invariant cache hit.
[2024-05-28 20:15:42] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-28 20:15:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:15:43] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:15:43] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:15:43] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:15:43] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:15:43] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:15:43] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:15:44] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:15:44] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
[2024-05-28 20:15:44] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:15:44] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:15:44] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:15:44] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:15:44] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-28 20:15:44] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:15:44] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:15:44] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-28 20:15:44] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:15:44] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:15:44] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:15:44] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:15:45] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:15:45] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:15:45] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:15:45] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:15:45] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:15:45] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:15:45] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:15:45] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:15:46] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:15:47] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/454 variables, 237/304 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:15:50] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:15:50] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:15:51] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 307 constraints, problems are : Problem set: 0 solved, 216 unsolved in 14455 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 33/70 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:15:57] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:15:57] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:15:58] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/454 variables, 237/310 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 216/526 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:16:00] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 4 ms to minimize.
[2024-05-28 20:16:00] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 2 ms to minimize.
[2024-05-28 20:16:00] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-05-28 20:16:00] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-28 20:16:00] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-28 20:16:00] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:16:01] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-28 20:16:01] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 20:16:01] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-05-28 20:16:01] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-28 20:16:01] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:16:01] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 2 ms to minimize.
[2024-05-28 20:16:02] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-28 20:16:02] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-28 20:16:02] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2024-05-28 20:16:02] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:16:03] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:16:03] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 18/544 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:16:06] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:16:06] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:16:09] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:16:09] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 2/548 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:16:12] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 20:16:12] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:16:12] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:16:12] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (OVERLAPS) 0/454 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 552 constraints, problems are : Problem set: 0 solved, 216 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 62/62 constraints]
After SMT, in 44491ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 44497ms
Starting structural reductions in LTL mode, iteration 1 : 237/256 places, 217/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44709 ms. Remains : 237/256 places, 217/236 transitions.
[2024-05-28 20:16:26] [INFO ] Flatten gal took : 15 ms
[2024-05-28 20:16:26] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:16:26] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-28 20:16:26] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:16:26] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:16:26] [INFO ] Time to serialize gal into /tmp/CTLFireability13399615503175201836.gal : 2 ms
[2024-05-28 20:16:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6735267238722170532.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/CTLFireability13399615503175201836.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6735267238722170532.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,9.84081e+22,9.22415,237968,2,3480,5,675767,6,0,1167,1.69148e+06,0


Converting to forward existential form...Done !
original formula: AG((EG(EX(AX(((p173==0)||(p232==0))))) + !(A(AG((((p165==1)&&(p178==1))&&((p212==1)&&(p48==1)))) U (((((p84==1)&&(p138==1))&&((p180==1)&&...192
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(!(!((E(!((((((p84==1)&&(p138==1))&&((p180==1)&&(p76==1)))&&(p79==1))||(p278!=1))) U (!(!(...438
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t16, t20, t25, t29, t34, t35, t38, t39, t40, t41, t42, t44, t45, t49, t53, t58, t62,...495
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-28 20:16:56] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:16:56] [INFO ] Applying decomposition
[2024-05-28 20:16:56] [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/graph331783762270075244.txt' '-o' '/tmp/graph331783762270075244.bin' '-w' '/tmp/graph331783762270075244.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph331783762270075244.bin' '-l' '-1' '-v' '-w' '/tmp/graph331783762270075244.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:16:56] [INFO ] Decomposing Gal with order
[2024-05-28 20:16:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:16:56] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-28 20:16:56] [INFO ] Flatten gal took : 18 ms
[2024-05-28 20:16:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-28 20:16:56] [INFO ] Time to serialize gal into /tmp/CTLFireability9363890898051827201.gal : 3 ms
[2024-05-28 20:16:56] [INFO ] Time to serialize properties into /tmp/CTLFireability612620119779761714.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/CTLFireability9363890898051827201.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability612620119779761714.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.84081e+22,1.01745,38844,692,43,58484,537,528,218772,54,1162,0


Converting to forward existential form...Done !
original formula: AG((EG(EX(AX(((i9.u56.p173==0)||(i15.i2.u75.p232==0))))) + !(A(AG((((i12.i1.u53.p165==1)&&(i9.u56.p178==1))&&((i12.i2.u65.p212==1)&&(i1.i...304
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(!(!((E(!((((((i6.i0.u29.p84==1)&&(i8.u45.p138==1))&&((i9.u55.p180==1)&&(i2.i0.u25.p76==1)...660
Reverse transition relation is NOT exact ! Due to transitions t42, t86, t126, t174, i0.t16, i0.u85.t20, i1.i0.u8.t176, i1.i1.t155, i1.i1.t159, i2.t172, i2....917
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Using 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 SI_CTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 255 transition count 189
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 209 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 208 transition count 188
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 94 place count 208 transition count 161
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 148 place count 181 transition count 161
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 163 place count 166 transition count 146
Iterating global reduction 3 with 15 rules applied. Total rules applied 178 place count 166 transition count 146
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 178 place count 166 transition count 137
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 196 place count 157 transition count 137
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 318 place count 96 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 319 place count 96 transition count 75
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 4 with 2 rules applied. Total rules applied 321 place count 95 transition count 74
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 323 place count 93 transition count 72
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 325 place count 91 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 325 place count 91 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 327 place count 90 transition count 71
Applied a total of 327 rules in 26 ms. Remains 90 /256 variables (removed 166) and now considering 71/236 (removed 165) transitions.
// Phase 1: matrix 71 rows 90 cols
[2024-05-28 20:17:26] [INFO ] Computed 35 invariants in 1 ms
[2024-05-28 20:17:26] [INFO ] Implicit Places using invariants in 53 ms returned [75]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 89/256 places, 71/236 transitions.
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 2 place count 88 transition count 70
Applied a total of 2 rules in 4 ms. Remains 88 /89 variables (removed 1) and now considering 70/71 (removed 1) transitions.
// Phase 1: matrix 70 rows 88 cols
[2024-05-28 20:17:26] [INFO ] Computed 34 invariants in 0 ms
[2024-05-28 20:17:26] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-28 20:17:26] [INFO ] Invariant cache hit.
[2024-05-28 20:17:26] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 88/256 places, 70/236 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 217 ms. Remains : 88/256 places, 70/236 transitions.
[2024-05-28 20:17:26] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:17:26] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:17:26] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-28 20:17:26] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:17:26] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:17:26] [INFO ] Time to serialize gal into /tmp/CTLFireability10339222555661784397.gal : 1 ms
[2024-05-28 20:17:26] [INFO ] Time to serialize properties into /tmp/CTLFireability12170310753651977514.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/CTLFireability10339222555661784397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12170310753651977514.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,2.93866e+13,0.071461,6552,2,331,5,14091,6,0,425,17924,0


Converting to forward existential form...Done !
original formula: A(EG(!(EF((p278==1)))) U (p154==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p154==1))))) * !(E(!((p154==1)) U (!(EG(!(E(TRUE U (p278==1))))) * !((p154==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 20:17:57] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:17:57] [INFO ] Applying decomposition
[2024-05-28 20:17:57] [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/graph2830222408881433737.txt' '-o' '/tmp/graph2830222408881433737.bin' '-w' '/tmp/graph2830222408881433737.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2830222408881433737.bin' '-l' '-1' '-v' '-w' '/tmp/graph2830222408881433737.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:17:57] [INFO ] Decomposing Gal with order
[2024-05-28 20:17:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:17:57] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-28 20:17:57] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:17:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:17:57] [INFO ] Time to serialize gal into /tmp/CTLFireability15537927652618772864.gal : 13 ms
[2024-05-28 20:17:57] [INFO ] Time to serialize properties into /tmp/CTLFireability9556598552087308551.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/CTLFireability15537927652618772864.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9556598552087308551.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.93866e+13,0.029134,4916,31,15,2743,112,181,4988,44,514,0


Converting to forward existential form...Done !
original formula: A(EG(!(EF((u30.p278==1)))) U (i11.u17.p154==1))
=> equivalent forward existential formula: [((Init * !(EG(!((i11.u17.p154==1))))) * !(E(!((i11.u17.p154==1)) U (!(EG(!(E(TRUE U (u30.p278==1))))) * !((i11....182
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 237 transition count 217
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 237 transition count 217
Applied a total of 38 rules in 5 ms. Remains 237 /256 variables (removed 19) and now considering 217/236 (removed 19) transitions.
// Phase 1: matrix 217 rows 237 cols
[2024-05-28 20:18:27] [INFO ] Computed 37 invariants in 3 ms
[2024-05-28 20:18:27] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-28 20:18:27] [INFO ] Invariant cache hit.
[2024-05-28 20:18:27] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-28 20:18:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:18:29] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:18:30] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:18:31] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:18:31] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:18:31] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:18:32] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/454 variables, 237/304 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:18:35] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:18:35] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:18:36] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 307 constraints, problems are : Problem set: 0 solved, 216 unsolved in 14363 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 33/70 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:18:42] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:18:42] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:18:43] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/454 variables, 237/310 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 216/526 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:18:45] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:18:45] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-28 20:18:45] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-28 20:18:45] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-28 20:18:45] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-28 20:18:46] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:18:46] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:18:46] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:18:46] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:18:46] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:18:46] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:18:46] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:18:47] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:18:47] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-28 20:18:47] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:18:47] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:18:47] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:18:48] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 18/544 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:18:51] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:18:51] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:18:54] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:18:54] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 2/548 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:18:57] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-28 20:18:57] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:18:57] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-28 20:18:57] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (OVERLAPS) 0/454 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 552 constraints, problems are : Problem set: 0 solved, 216 unsolved in 29518 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 62/62 constraints]
After SMT, in 43903ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 43905ms
Starting structural reductions in LTL mode, iteration 1 : 237/256 places, 217/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44125 ms. Remains : 237/256 places, 217/236 transitions.
[2024-05-28 20:19:11] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:19:11] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:19:11] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-28 20:19:11] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:19:11] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:19:11] [INFO ] Time to serialize gal into /tmp/CTLFireability16925757050710415853.gal : 1 ms
[2024-05-28 20:19:11] [INFO ] Time to serialize properties into /tmp/CTLFireability5186970309642329028.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/CTLFireability16925757050710415853.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5186970309642329028.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,9.84081e+22,8.15424,237332,2,3480,5,675767,6,0,1167,1.69148e+06,0


Converting to forward existential form...Done !
original formula: AG(AX((p72==0)))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !((p72==0)))] = FALSE
(forward)formula 0,0,8.20404,237332,1,0,9,675767,9,2,1927,1.69148e+06,2
FORMULA ShieldIIPt-PT-004B-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 255 transition count 189
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 209 transition count 189
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 92 place count 209 transition count 164
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 142 place count 184 transition count 164
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 154 place count 172 transition count 152
Iterating global reduction 2 with 12 rules applied. Total rules applied 166 place count 172 transition count 152
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 166 place count 172 transition count 145
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 180 place count 165 transition count 145
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 296 place count 107 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 298 place count 107 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 299 place count 106 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 301 place count 104 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 302 place count 103 transition count 83
Applied a total of 302 rules in 31 ms. Remains 103 /256 variables (removed 153) and now considering 83/236 (removed 153) transitions.
// Phase 1: matrix 83 rows 103 cols
[2024-05-28 20:19:19] [INFO ] Computed 36 invariants in 1 ms
[2024-05-28 20:19:19] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-28 20:19:19] [INFO ] Invariant cache hit.
[2024-05-28 20:19:19] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-28 20:19:19] [INFO ] Redundant transitions in 1 ms returned []
Running 81 sub problems to find dead transitions.
[2024-05-28 20:19:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (OVERLAPS) 1/103 variables, 9/36 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-05-28 20:19:20] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:19:20] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 83/186 variables, 103/141 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 0/186 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 186/186 variables, and 141 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1506 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/103 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 83/186 variables, 103/141 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 81/222 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 0/186 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 186/186 variables, and 222 constraints, problems are : Problem set: 0 solved, 81 unsolved in 1376 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 2/2 constraints]
After SMT, in 2892ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 2893ms
Starting structural reductions in SI_CTL mode, iteration 1 : 103/256 places, 83/236 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3059 ms. Remains : 103/256 places, 83/236 transitions.
[2024-05-28 20:19:22] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:19:22] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:19:22] [INFO ] Input system was already deterministic with 83 transitions.
[2024-05-28 20:19:22] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:19:22] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:19:22] [INFO ] Time to serialize gal into /tmp/CTLFireability3205841307607988671.gal : 1 ms
[2024-05-28 20:19:22] [INFO ] Time to serialize properties into /tmp/CTLFireability13090538481413521623.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/CTLFireability3205841307607988671.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13090538481413521623.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,7.83823e+14,0.213128,13244,2,359,5,39250,6,0,497,66359,0


Converting to forward existential form...Done !
original formula: EG((((AF((p103==1)) + (p158==1)) + (!(E((p129==1) U (p9==1))) + E((p246==1) U (p245==1)))) + (!(A((p10==1) U (p176==1))) + AF((p177==0)))...157
=> equivalent forward existential formula: [FwdG(Init,(((!(EG(!((p103==1)))) + (p158==1)) + (!(E((p129==1) U (p9==1))) + E((p246==1) U (p245==1)))) + (!(!(...259
Reverse transition relation is NOT exact ! Due to transitions t35, t55, t67, t71, Intersection with reachable at each step enabled. (destroyed/reverse/int...179
Detected timeout of ITS tools.
[2024-05-28 20:19:52] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:19:52] [INFO ] Applying decomposition
[2024-05-28 20:19:52] [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/graph1911585344899618802.txt' '-o' '/tmp/graph1911585344899618802.bin' '-w' '/tmp/graph1911585344899618802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1911585344899618802.bin' '-l' '-1' '-v' '-w' '/tmp/graph1911585344899618802.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:19:52] [INFO ] Decomposing Gal with order
[2024-05-28 20:19:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:19:52] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-28 20:19:52] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:19:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 20:19:52] [INFO ] Time to serialize gal into /tmp/CTLFireability1977034930114161115.gal : 1 ms
[2024-05-28 20:19:52] [INFO ] Time to serialize properties into /tmp/CTLFireability8075519580863684284.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/CTLFireability1977034930114161115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8075519580863684284.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,7.83823e+14,0.058421,6408,74,20,6053,147,267,10923,52,607,0


Converting to forward existential form...Done !
original formula: EG((((AF((i4.u14.p103==1)) + (i7.u21.p158==1)) + (!(E((i5.u17.p129==1) U (i2.i1.u1.p9==1))) + E((i12.u32.p246==1) U (i12.u32.p245==1)))) ...226
=> equivalent forward existential formula: [FwdG(Init,(((!(EG(!((i4.u14.p103==1)))) + (i7.u21.p158==1)) + (!(E((i5.u17.p129==1) U (i2.i1.u1.p9==1))) + E((i...342
Reverse transition relation is NOT exact ! Due to transitions t67, t71, i2.i0.u8.t35, i2.i1.u9.t55, Intersection with reachable at each step enabled. (des...197
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,1,4.42246,135768,1,0,251145,277,1709,460593,268,1035,190085
FORMULA ShieldIIPt-PT-004B-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 241 transition count 221
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 241 transition count 221
Applied a total of 30 rules in 11 ms. Remains 241 /256 variables (removed 15) and now considering 221/236 (removed 15) transitions.
// Phase 1: matrix 221 rows 241 cols
[2024-05-28 20:19:57] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:19:57] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-28 20:19:57] [INFO ] Invariant cache hit.
[2024-05-28 20:19:57] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-05-28 20:19:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:19:59] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:20:00] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:20:01] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:20:01] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:20:01] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:20:01] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-28 20:20:01] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:20:01] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:20:01] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:20:01] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:20:01] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:20:02] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/241 variables, 7/84 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:20:03] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 10 ms to minimize.
[2024-05-28 20:20:04] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:20:05] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:20:05] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:20:05] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 221/462 variables, 241/330 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:20:08] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:20:10] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:20:11] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:20:11] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 3/334 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:20:13] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:20:17] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/462 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:20:18] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/462 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:20:22] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:20:22] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:20:23] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/462 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/462 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 18 (OVERLAPS) 0/462 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 340 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 62/99 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/241 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 221/462 variables, 241/340 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 220/560 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:20:30] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 0 ms to minimize.
[2024-05-28 20:20:30] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:20:30] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:20:31] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:20:31] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:20:31] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 2 ms to minimize.
[2024-05-28 20:20:32] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 0 ms to minimize.
[2024-05-28 20:20:32] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 8/568 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:20:34] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:20:35] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2024-05-28 20:20:36] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:20:36] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:20:36] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 5/573 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:20:38] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:20:40] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 2/575 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:20:44] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 1/576 constraints. Problems are: Problem set: 0 solved, 220 unsolved
[2024-05-28 20:20:48] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:20:48] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:20:48] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:20:49] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:20:50] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/462 variables, 5/581 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/462 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 581 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 83/83 constraints]
After SMT, in 60037ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60040ms
Starting structural reductions in LTL mode, iteration 1 : 241/256 places, 221/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60258 ms. Remains : 241/256 places, 221/236 transitions.
[2024-05-28 20:20:57] [INFO ] Flatten gal took : 7 ms
[2024-05-28 20:20:57] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:20:57] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-28 20:20:57] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:20:57] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:20:57] [INFO ] Time to serialize gal into /tmp/CTLFireability10870764786888892736.gal : 1 ms
[2024-05-28 20:20:57] [INFO ] Time to serialize properties into /tmp/CTLFireability738272859811058786.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/CTLFireability10870764786888892736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability738272859811058786.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.60428e+23,14.8394,417116,2,5064,5,1.11101e+06,6,0,1187,3.07549e+06,0


Converting to forward existential form...Done !
original formula: EX((AF(EG((E((p192==1) U (p198==1)) + EX((p190==1))))) * A((((EX((p145==1)) * (p58==1)) * ((p180==1)&&(!((p59==1)&&(p275==1))))) + A(((p2...202
=> equivalent forward existential formula: [(((EY(Init) * !(EG(!(EG((E((p192==1) U (p198==1)) + EX((p190==1)))))))) * !(EG(!((p134==1))))) * !(E(!((p134==1...350
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t13, t15, t18, t22, t27, t31, t36, t37, t40, t41, t42, t43, t44, t46, t47, t51, t55,...527
Detected timeout of ITS tools.
[2024-05-28 20:21:27] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:21:27] [INFO ] Applying decomposition
[2024-05-28 20:21:27] [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/graph5660903146759959229.txt' '-o' '/tmp/graph5660903146759959229.bin' '-w' '/tmp/graph5660903146759959229.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5660903146759959229.bin' '-l' '-1' '-v' '-w' '/tmp/graph5660903146759959229.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:21:27] [INFO ] Decomposing Gal with order
[2024-05-28 20:21:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:21:27] [INFO ] Removed a total of 38 redundant transitions.
[2024-05-28 20:21:27] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:21:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:21:27] [INFO ] Time to serialize gal into /tmp/CTLFireability12955166170191700629.gal : 3 ms
[2024-05-28 20:21:27] [INFO ] Time to serialize properties into /tmp/CTLFireability12940050400711140568.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/CTLFireability12955166170191700629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12940050400711140568.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.60428e+23,2.71351,77156,893,43,109660,447,562,501418,58,1134,0


Converting to forward existential form...Done !
original formula: EX((AF(EG((E((i9.i1.u62.p192==1) U (i9.i1.u62.p198==1)) + EX((i12.i2.u57.p190==1))))) * A((((EX((i0.i0.u45.p145==1)) * (i1.u20.p58==1)) *...311
=> equivalent forward existential formula: [(((EY(Init) * !(EG(!(EG((E((i9.i1.u62.p192==1) U (i9.i1.u62.p198==1)) + EX((i12.i2.u57.p190==1)))))))) * !(EG(!...499
Reverse transition relation is NOT exact ! Due to transitions t40, t85, t134, t178, i0.i1.u74.t41, i1.t150, i1.u20.t154, i2.t167, i2.u11.t171, i3.t176, i3....998
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 238 transition count 218
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 238 transition count 218
Applied a total of 36 rules in 15 ms. Remains 238 /256 variables (removed 18) and now considering 218/236 (removed 18) transitions.
// Phase 1: matrix 218 rows 238 cols
[2024-05-28 20:21:57] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:21:57] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-28 20:21:57] [INFO ] Invariant cache hit.
[2024-05-28 20:21:57] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-05-28 20:21:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:21:59] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:21:59] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:21:59] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:21:59] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:21:59] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:21:59] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:21:59] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-28 20:22:00] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:22:00] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:22:00] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:22:00] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:22:00] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:22:00] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:22:00] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:22:00] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:22:00] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:22:00] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:22:00] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:22:00] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-28 20:22:00] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:22:00] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:22:01] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:01] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:22:01] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:22:01] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:22:01] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-28 20:22:01] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:22:01] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:22:01] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:22:03] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 218/456 variables, 238/305 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:22:06] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:22:06] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 2/307 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:22:07] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:22:09] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-28 20:22:10] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/456 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 310 constraints, problems are : Problem set: 0 solved, 217 unsolved in 16357 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 35/72 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 218/456 variables, 238/310 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/456 variables, 217/527 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:22:16] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:22:17] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:22:18] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:22:18] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:22:18] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:22:18] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:22:18] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:22:19] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 12/539 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:22:20] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 1 ms to minimize.
[2024-05-28 20:22:21] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:22:22] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:22:22] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:22:22] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:22:22] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:22:22] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:22:22] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:22:23] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:22:23] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:22:23] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:22:23] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:22:23] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:22:23] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-28 20:22:23] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 15/554 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:22:25] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-28 20:22:25] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:22:26] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:22:27] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 4/558 constraints. Problems are: Problem set: 0 solved, 217 unsolved
[2024-05-28 20:22:30] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 11 (OVERLAPS) 0/456 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 559 constraints, problems are : Problem set: 0 solved, 217 unsolved in 26841 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 67/67 constraints]
After SMT, in 43218ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 43220ms
Starting structural reductions in LTL mode, iteration 1 : 238/256 places, 218/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43427 ms. Remains : 238/256 places, 218/236 transitions.
[2024-05-28 20:22:41] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:22:41] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:22:41] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-28 20:22:41] [INFO ] Flatten gal took : 6 ms
[2024-05-28 20:22:41] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:22:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5497062139640679422.gal : 1 ms
[2024-05-28 20:22:41] [INFO ] Time to serialize properties into /tmp/CTLFireability1323984524648560663.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/CTLFireability5497062139640679422.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1323984524648560663.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,9.98447e+22,8.27052,239380,2,3488,5,680103,6,0,1172,1.69998e+06,0


Converting to forward existential form...Done !
original formula: (EF(((AG(((p4==1)&&(p57==1))) * (p272==0)) * (((p229==0)||(p231==0)) * EF((p258==0))))) * !(E(AX(!(AX((p256==1)))) U EX(AG(AX((p59==1))))...158
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((!(E(TRUE U !(((p4==1)&&(p57==1))))) * (p272==0)) * (((p229==0)||(p231==0)) * E(TRUE U (p2...276
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t16, t20, t26, t31, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59, t63,...495
Detected timeout of ITS tools.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:23:11] [INFO ] Applying decomposition
[2024-05-28 20:23:11] [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/graph6264904344242575863.txt' '-o' '/tmp/graph6264904344242575863.bin' '-w' '/tmp/graph6264904344242575863.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6264904344242575863.bin' '-l' '-1' '-v' '-w' '/tmp/graph6264904344242575863.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:23:11] [INFO ] Decomposing Gal with order
[2024-05-28 20:23:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:23:11] [INFO ] Removed a total of 39 redundant transitions.
[2024-05-28 20:23:11] [INFO ] Flatten gal took : 11 ms
[2024-05-28 20:23:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:23:11] [INFO ] Time to serialize gal into /tmp/CTLFireability3673215856781286878.gal : 2 ms
[2024-05-28 20:23:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4649785578269943543.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/CTLFireability3673215856781286878.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4649785578269943543.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,9.98447e+22,0.919178,34124,611,44,51334,444,556,178828,60,1191,0


Converting to forward existential form...Done !
original formula: (EF(((AG(((i1.i0.u1.p4==1)&&(i1.i2.u20.p57==1))) * (i15.i1.u86.p272==0)) * (((i14.i0.u73.p229==0)||(i14.i0.u73.p231==0)) * EF((i12.u80.p2...236
=> equivalent forward existential formula: ([(Init * !(E(TRUE U ((!(E(TRUE U !(((i1.i0.u1.p4==1)&&(i1.i2.u20.p57==1))))) * (i15.i1.u86.p272==0)) * (((i14.i...354
Reverse transition relation is NOT exact ! Due to transitions t39, t43, t83, t131, t173, t175, i0.t164, i0.u12.t168, i1.i0.u1.t179, i1.i0.u9.t174, i1.i2.t1...926
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 239 transition count 219
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 239 transition count 219
Applied a total of 34 rules in 4 ms. Remains 239 /256 variables (removed 17) and now considering 219/236 (removed 17) transitions.
// Phase 1: matrix 219 rows 239 cols
[2024-05-28 20:23:41] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 20:23:41] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-28 20:23:41] [INFO ] Invariant cache hit.
[2024-05-28 20:23:41] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-28 20:23:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:23:43] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:23:43] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:23:43] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:23:43] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
[2024-05-28 20:23:43] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:23:43] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:23:43] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-28 20:23:43] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:23:43] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:23:43] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:23:43] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:23:43] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:23:43] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:23:43] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:23:44] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-28 20:23:44] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:23:44] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:23:44] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:23:44] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 2 ms to minimize.
[2024-05-28 20:23:44] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:23:44] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 0 ms to minimize.
[2024-05-28 20:23:44] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:23:44] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:23:44] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:23:44] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:23:45] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:23:45] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-28 20:23:45] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:23:45] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-28 20:23:45] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:23:45] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:23:45] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:23:45] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:23:47] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:23:47] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:23:48] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:23:48] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:23:48] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (OVERLAPS) 219/458 variables, 239/314 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:23:51] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:23:51] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:23:51] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:23:52] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-28 20:23:52] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:23:54] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:23:54] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:23:55] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:23:55] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:23:55] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 5/324 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:23:55] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/458 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:23:58] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:23:58] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/458 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 14 (OVERLAPS) 0/458 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 327 constraints, problems are : Problem set: 0 solved, 218 unsolved in 21175 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 51/88 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/458 variables, 239/327 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 218/545 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:24:05] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:24:05] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:24:06] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:24:06] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:24:06] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:24:07] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-28 20:24:07] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:24:07] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 8/553 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:24:09] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-28 20:24:10] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:24:10] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:24:11] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:24:11] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 5/558 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:24:13] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:24:13] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:24:17] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 2 ms to minimize.
[2024-05-28 20:24:18] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 2/562 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 11 (OVERLAPS) 0/458 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Int declared 458/458 variables, and 562 constraints, problems are : Problem set: 0 solved, 218 unsolved in 27185 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 68/68 constraints]
After SMT, in 48375ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 48378ms
Starting structural reductions in LTL mode, iteration 1 : 239/256 places, 219/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48609 ms. Remains : 239/256 places, 219/236 transitions.
[2024-05-28 20:24:29] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:24:29] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:24:29] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-28 20:24:29] [INFO ] Flatten gal took : 3 ms
[2024-05-28 20:24:29] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:24:29] [INFO ] Time to serialize gal into /tmp/CTLFireability16720189228172495286.gal : 2 ms
[2024-05-28 20:24:29] [INFO ] Time to serialize properties into /tmp/CTLFireability184485280888436168.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/CTLFireability16720189228172495286.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability184485280888436168.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27141e+23,11.2112,323904,2,4587,5,902314,6,0,1177,2.34862e+06,0


Converting to forward existential form...Done !
original formula: AX(AF(((EG((p112==0)) * (p73==0)) * (p273==0))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((EG((p112==0)) * (p73==0)) * (p273==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t7, t12, t14, t17, t21, t26, t30, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59,...512
Detected timeout of ITS tools.
[2024-05-28 20:24:59] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:24:59] [INFO ] Applying decomposition
[2024-05-28 20:24:59] [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/graph15249708666895334724.txt' '-o' '/tmp/graph15249708666895334724.bin' '-w' '/tmp/graph15249708666895334724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15249708666895334724.bin' '-l' '-1' '-v' '-w' '/tmp/graph15249708666895334724.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:24:59] [INFO ] Decomposing Gal with order
[2024-05-28 20:24:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:24:59] [INFO ] Removed a total of 41 redundant transitions.
[2024-05-28 20:25:00] [INFO ] Flatten gal took : 10 ms
[2024-05-28 20:25:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:25:00] [INFO ] Time to serialize gal into /tmp/CTLFireability1944509391359597380.gal : 2 ms
[2024-05-28 20:25:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4974705396916507826.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/CTLFireability1944509391359597380.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4974705396916507826.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.27141e+23,1.47316,51548,865,29,88872,437,528,252527,49,1154,0


Converting to forward existential form...Done !
original formula: AX(AF(((EG((i7.i2.u36.p112==0)) * (i1.i2.u21.p73==0)) * (i16.u88.p273==0))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((EG((i7.i2.u36.p112==0)) * (i1.i2.u21.p73==0)) * (i16.u88.p273==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t39, t87, t127, t174, t176, i0.i1.u75.t40, i1.i1.t172, i1.i1.u6.t179, i1.i1.u10.t173, i1.i2.t...955
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 239 transition count 219
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 239 transition count 219
Applied a total of 34 rules in 4 ms. Remains 239 /256 variables (removed 17) and now considering 219/236 (removed 17) transitions.
// Phase 1: matrix 219 rows 239 cols
[2024-05-28 20:25:30] [INFO ] Computed 37 invariants in 3 ms
[2024-05-28 20:25:30] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-28 20:25:30] [INFO ] Invariant cache hit.
[2024-05-28 20:25:30] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2024-05-28 20:25:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:25:32] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-28 20:25:33] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:25:33] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-28 20:25:33] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:25:33] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:25:33] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-28 20:25:33] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:25:33] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:25:33] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:25:33] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:25:33] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-28 20:25:33] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-28 20:25:34] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:25:34] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 10/67 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:25:35] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-28 20:25:35] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:25:36] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (OVERLAPS) 219/458 variables, 239/309 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:25:39] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:25:39] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:25:39] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-28 20:25:39] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:25:40] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:25:40] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-28 20:25:40] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (OVERLAPS) 0/458 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 218 unsolved
No progress, stopping.
After SMT solving in domain Real declared 458/458 variables, and 316 constraints, problems are : Problem set: 0 solved, 218 unsolved in 15283 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 40/77 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (OVERLAPS) 219/458 variables, 239/316 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 218/534 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:25:48] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-28 20:25:48] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-28 20:25:48] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-05-28 20:25:48] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:25:49] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:25:49] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:25:49] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-28 20:25:49] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-28 20:25:49] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:25:50] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-28 20:25:50] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 11/545 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 2 ms to minimize.
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:25:52] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:25:53] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 3 ms to minimize.
[2024-05-28 20:25:53] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:25:53] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-28 20:25:53] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:25:54] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:25:54] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 11/556 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:25:56] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-28 20:25:57] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 2/558 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:26:01] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/458 variables, 1/559 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 218 unsolved
[2024-05-28 20:26:09] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:26:09] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/458 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/458 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/458 variables, and 561 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 67/67 constraints]
After SMT, in 45310ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 45312ms
Starting structural reductions in LTL mode, iteration 1 : 239/256 places, 219/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45558 ms. Remains : 239/256 places, 219/236 transitions.
[2024-05-28 20:26:15] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:26:15] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:26:15] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-28 20:26:15] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:26:15] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:26:15] [INFO ] Time to serialize gal into /tmp/CTLFireability12376650973473926060.gal : 1 ms
[2024-05-28 20:26:15] [INFO ] Time to serialize properties into /tmp/CTLFireability9988438173907115618.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/CTLFireability12376650973473926060.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9988438173907115618.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27739e+23,9.63619,276208,2,3925,5,765467,6,0,1177,2.01693e+06,0


Converting to forward existential form...Done !
original formula: E(AF((p263==1)) U !(E(EG((p186!=1)) U (EX((((p35==1)&&(p94==1))||(p245==1))) * EG(E((p58==1) U (p102==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((p263==1))))) * !(E(EG((p186!=1)) U (EX((((p35==1)&&(p94==1))||(p245==1))) * EG(E((p58==1) U ...180
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t16, t20, t21, t26, t30, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59,...506
Detected timeout of ITS tools.
[2024-05-28 20:26:45] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:26:45] [INFO ] Applying decomposition
[2024-05-28 20:26:45] [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/graph7308699019647639568.txt' '-o' '/tmp/graph7308699019647639568.bin' '-w' '/tmp/graph7308699019647639568.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7308699019647639568.bin' '-l' '-1' '-v' '-w' '/tmp/graph7308699019647639568.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:26:45] [INFO ] Decomposing Gal with order
[2024-05-28 20:26:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:26:45] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-28 20:26:45] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:26:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:26:45] [INFO ] Time to serialize gal into /tmp/CTLFireability8001398215758969248.gal : 2 ms
[2024-05-28 20:26:45] [INFO ] Time to serialize properties into /tmp/CTLFireability9537954762815413887.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/CTLFireability8001398215758969248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9537954762815413887.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.27739e+23,1.22421,42040,654,43,59092,510,523,247705,56,1039,0


Converting to forward existential form...Done !
original formula: E(AF((i12.u83.p263==1)) U !(E(EG((i9.i1.u60.p186!=1)) U (EX((((i1.u11.p35==1)&&(i7.i1.u30.p94==1))||(i14.i1.u76.p245==1))) * EG(E((i3.u19...188
=> equivalent forward existential formula: [(FwdU(Init,!(EG(!((i12.u83.p263==1))))) * !(E(EG((i9.i1.u60.p186!=1)) U (EX((((i1.u11.p35==1)&&(i7.i1.u30.p94==...240
Reverse transition relation is NOT exact ! Due to transitions t43, t87, t132, t176, i0.t174, i0.i0.u2.t180, i0.i0.u9.t175, i0.i2.t172, i0.i2.u6.t179, i0.i2...942
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 237 transition count 217
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 237 transition count 217
Applied a total of 38 rules in 7 ms. Remains 237 /256 variables (removed 19) and now considering 217/236 (removed 19) transitions.
// Phase 1: matrix 217 rows 237 cols
[2024-05-28 20:27:15] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 20:27:15] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-28 20:27:15] [INFO ] Invariant cache hit.
[2024-05-28 20:27:16] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2024-05-28 20:27:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:27:17] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:27:17] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:27:17] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:27:17] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:27:17] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:27:17] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:27:18] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:27:18] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-28 20:27:18] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:27:18] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:27:18] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-28 20:27:18] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:27:18] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:27:18] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:27:18] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-28 20:27:18] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:27:18] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:27:18] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:27:18] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-28 20:27:18] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:27:18] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:27:19] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:27:19] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-28 20:27:19] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:27:19] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:27:19] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:27:19] [INFO ] Deduced a trap composed of 15 places in 18 ms of which 0 ms to minimize.
[2024-05-28 20:27:19] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-28 20:27:19] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:27:21] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 217/454 variables, 237/304 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:27:24] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-28 20:27:24] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 2/306 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:27:25] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 10 (OVERLAPS) 0/454 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 454/454 variables, and 307 constraints, problems are : Problem set: 0 solved, 216 unsolved in 14512 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 33/70 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:27:31] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:27:31] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:27:32] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 217/454 variables, 237/310 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 216/526 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:27:34] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:27:34] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2024-05-28 20:27:34] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-28 20:27:34] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 1 ms to minimize.
[2024-05-28 20:27:34] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-05-28 20:27:34] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:27:34] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:27:35] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:27:35] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-28 20:27:35] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-28 20:27:35] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:27:35] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:27:36] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-28 20:27:36] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-28 20:27:36] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:27:36] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-28 20:27:36] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-28 20:27:37] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 18/544 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:27:40] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 2 ms to minimize.
[2024-05-28 20:27:40] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/454 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:27:42] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-05-28 20:27:43] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/454 variables, 2/548 constraints. Problems are: Problem set: 0 solved, 216 unsolved
[2024-05-28 20:27:46] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-28 20:27:46] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 20:27:46] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:27:46] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/454 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/454 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 12 (OVERLAPS) 0/454 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 454/454 variables, and 552 constraints, problems are : Problem set: 0 solved, 216 unsolved in 29468 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 62/62 constraints]
After SMT, in 43996ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 43998ms
Starting structural reductions in LTL mode, iteration 1 : 237/256 places, 217/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44227 ms. Remains : 237/256 places, 217/236 transitions.
[2024-05-28 20:28:00] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:28:00] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:28:00] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-28 20:28:00] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:28:00] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:28:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3381234549618149197.gal : 1 ms
[2024-05-28 20:28:00] [INFO ] Time to serialize properties into /tmp/CTLFireability9847117233337050055.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/CTLFireability3381234549618149197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9847117233337050055.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,9.84081e+22,8.18406,238028,2,3480,5,675767,6,0,1167,1.69148e+06,0


Converting to forward existential form...Done !
original formula: (EX(!(E(!(EG((p8==1))) U AF(EG((p277==1)))))) + EG((((p23==1)&&(p62==1)) + E(!((EF((((p168==1)&&(p200==1))&&(p212==1))) * AX((p100==1))))...171
=> equivalent forward existential formula: ([(EY(Init) * !(E(!(EG((p8==1))) U !(EG(!(EG((p277==1))))))))] != FALSE + [FwdG(Init,(((p23==1)&&(p62==1)) + E(!...252
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t16, t20, t25, t29, t34, t35, t38, t39, t40, t41, t42, t44, t45, t49, t53, t58, t62,...495
Detected timeout of ITS tools.
[2024-05-28 20:28:30] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:28:30] [INFO ] Applying decomposition
[2024-05-28 20:28: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/graph1701297488554685089.txt' '-o' '/tmp/graph1701297488554685089.bin' '-w' '/tmp/graph1701297488554685089.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1701297488554685089.bin' '-l' '-1' '-v' '-w' '/tmp/graph1701297488554685089.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:28:30] [INFO ] Decomposing Gal with order
[2024-05-28 20:28:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:28:30] [INFO ] Removed a total of 41 redundant transitions.
[2024-05-28 20:28:30] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:28:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:28:30] [INFO ] Time to serialize gal into /tmp/CTLFireability10842411648728504608.gal : 2 ms
[2024-05-28 20:28:30] [INFO ] Time to serialize properties into /tmp/CTLFireability17985115833756265375.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/CTLFireability10842411648728504608.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17985115833756265375.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,9.84081e+22,0.849097,31968,640,43,51343,482,516,149902,56,1191,0


Converting to forward existential form...Done !
original formula: (EX(!(E(!(EG((i3.i0.u3.p8==1))) U AF(EG((i12.i3.u86.p277==1)))))) + EG((((i2.i0.u9.p23==1)&&(i3.i2.u20.p62==1)) + E(!((EF((((i11.i1.u53.p...254
=> equivalent forward existential formula: ([(EY(Init) * !(E(!(EG((i3.i0.u3.p8==1))) U !(EG(!(EG((i12.i3.u86.p277==1))))))))] != FALSE + [FwdG(Init,(((i2.i...335
Reverse transition relation is NOT exact ! Due to transitions t42, t86, t130, t170, i0.i0.u50.t88, i0.i1.t67, i0.i1.t71, i1.t163, i1.u14.t167, i2.t174, i2....923
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 255 transition count 189
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 209 transition count 189
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 92 place count 209 transition count 161
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 148 place count 181 transition count 161
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 163 place count 166 transition count 146
Iterating global reduction 2 with 15 rules applied. Total rules applied 178 place count 166 transition count 146
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 178 place count 166 transition count 136
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 198 place count 156 transition count 136
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 320 place count 95 transition count 75
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 321 place count 95 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 323 place count 94 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 324 place count 93 transition count 72
Applied a total of 324 rules in 20 ms. Remains 93 /256 variables (removed 163) and now considering 72/236 (removed 164) transitions.
// Phase 1: matrix 72 rows 93 cols
[2024-05-28 20:29:00] [INFO ] Computed 37 invariants in 1 ms
[2024-05-28 20:29:00] [INFO ] Implicit Places using invariants in 50 ms returned [82, 83]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 51 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 91/256 places, 72/236 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 91 transition count 71
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 2 place count 90 transition count 71
Applied a total of 2 rules in 2 ms. Remains 90 /91 variables (removed 1) and now considering 71/72 (removed 1) transitions.
// Phase 1: matrix 71 rows 90 cols
[2024-05-28 20:29:00] [INFO ] Computed 35 invariants in 0 ms
[2024-05-28 20:29:00] [INFO ] Implicit Places using invariants in 45 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 89/256 places, 71/236 transitions.
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 2 place count 88 transition count 70
Applied a total of 2 rules in 2 ms. Remains 88 /89 variables (removed 1) and now considering 70/71 (removed 1) transitions.
// Phase 1: matrix 70 rows 88 cols
[2024-05-28 20:29:00] [INFO ] Computed 34 invariants in 0 ms
[2024-05-28 20:29:00] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-28 20:29:00] [INFO ] Invariant cache hit.
[2024-05-28 20:29:00] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 3 : 88/256 places, 70/236 transitions.
Finished structural reductions in SI_CTL mode , in 3 iterations and 232 ms. Remains : 88/256 places, 70/236 transitions.
[2024-05-28 20:29:00] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:29:00] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:29:00] [INFO ] Input system was already deterministic with 70 transitions.
[2024-05-28 20:29:00] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:29:00] [INFO ] Flatten gal took : 2 ms
[2024-05-28 20:29:00] [INFO ] Time to serialize gal into /tmp/CTLFireability16662256087897185732.gal : 1 ms
[2024-05-28 20:29:00] [INFO ] Time to serialize properties into /tmp/CTLFireability490902586590995526.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/CTLFireability16662256087897185732.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability490902586590995526.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.46933e+13,0.052225,5772,2,343,5,10231,6,0,424,13143,0


Converting to forward existential form...Done !
original formula: EF(EG((p216==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(p216==1))] != FALSE
Hit Full ! (commute/partial/dont) 68/0/2
(forward)formula 0,0,0.084288,6036,1,0,10,14966,19,2,2125,13143,10
FORMULA ShieldIIPt-PT-004B-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 236/236 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 240 transition count 220
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 240 transition count 220
Applied a total of 32 rules in 3 ms. Remains 240 /256 variables (removed 16) and now considering 220/236 (removed 16) transitions.
// Phase 1: matrix 220 rows 240 cols
[2024-05-28 20:29:00] [INFO ] Computed 37 invariants in 2 ms
[2024-05-28 20:29:00] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-28 20:29:00] [INFO ] Invariant cache hit.
[2024-05-28 20:29:00] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2024-05-28 20:29:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:29:02] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:29:02] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:29:02] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-28 20:29:02] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-28 20:29:02] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:29:02] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:29:02] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:29:02] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-28 20:29:02] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-28 20:29:02] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-28 20:29:03] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-28 20:29:03] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 0 ms to minimize.
[2024-05-28 20:29:03] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:29:03] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:29:03] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-28 20:29:03] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:29:03] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:29:03] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-28 20:29:03] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-05-28 20:29:03] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/57 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:29:03] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 2 ms to minimize.
[2024-05-28 20:29:04] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-28 20:29:04] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:29:04] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-28 20:29:04] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-28 20:29:04] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:29:04] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-28 20:29:04] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-28 20:29:04] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:29:04] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-28 20:29:04] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-28 20:29:04] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-28 20:29:04] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:29:06] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-28 20:29:06] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:29:06] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 220/460 variables, 240/313 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:29:09] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-28 20:29:10] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:29:13] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/460 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:29:15] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:29:17] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:29:18] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-28 20:29:18] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/460 variables, 2/320 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:29:21] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-28 20:29:21] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/460 variables, 2/322 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:29:22] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/460 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/460 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 16 (OVERLAPS) 0/460 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 323 constraints, problems are : Problem set: 0 solved, 219 unsolved in 26009 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 46/83 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 220/460 variables, 240/323 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 219/542 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:29:29] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-28 20:29:30] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-28 20:29:30] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:29:30] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-28 20:29:30] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-28 20:29:30] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-28 20:29:31] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-28 20:29:31] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-28 20:29:31] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-28 20:29:31] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:29:31] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-28 20:29:31] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-28 20:29:31] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:29:32] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-28 20:29:32] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 15/557 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:29:34] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-28 20:29:34] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-28 20:29:34] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:29:34] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-28 20:29:35] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-28 20:29:35] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 6/563 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:29:38] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 219 unsolved
[2024-05-28 20:29:42] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2024-05-28 20:29:42] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-28 20:29:43] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 3/567 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (OVERLAPS) 0/460 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 567 constraints, problems are : Problem set: 0 solved, 219 unsolved in 28379 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 71/71 constraints]
After SMT, in 54404ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 54406ms
Starting structural reductions in LTL mode, iteration 1 : 240/256 places, 220/236 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54618 ms. Remains : 240/256 places, 220/236 transitions.
[2024-05-28 20:29:55] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:29:55] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:29:55] [INFO ] Input system was already deterministic with 220 transitions.
[2024-05-28 20:29:55] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:29:55] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:29:55] [INFO ] Time to serialize gal into /tmp/CTLFireability14236030007529614984.gal : 1 ms
[2024-05-28 20:29:55] [INFO ] Time to serialize properties into /tmp/CTLFireability12275288770926607963.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/CTLFireability14236030007529614984.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12275288770926607963.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.13684e+23,8.53611,245376,2,3559,5,691489,6,0,1182,1.74826e+06,0


Converting to forward existential form...Done !
original formula: (EF(AG((E((p52==1) U ((p45==1)&&(p259==1))) + E(((p75==1)||(p256==1)) U A((p48==1) U (p266==1)))))) + AF((AX((p270==1)) + EX((EG((p7==1))...203
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U !(E(TRUE U !((E((p52==1) U ((p45==1)&&(p259==1))) + E(((p75==1)||(p256==1)) U !((E(!((p...334
Reverse transition relation is NOT exact ! Due to transitions t7, t11, t17, t22, t26, t30, t35, t36, t39, t40, t41, t42, t43, t45, t46, t50, t54, t59, t63,...501
Detected timeout of ITS tools.
[2024-05-28 20:30:25] [INFO ] Flatten gal took : 9 ms
[2024-05-28 20:30:25] [INFO ] Applying decomposition
[2024-05-28 20:30:25] [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/graph8630428029438309983.txt' '-o' '/tmp/graph8630428029438309983.bin' '-w' '/tmp/graph8630428029438309983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8630428029438309983.bin' '-l' '-1' '-v' '-w' '/tmp/graph8630428029438309983.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:30:25] [INFO ] Decomposing Gal with order
[2024-05-28 20:30:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:30:25] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-28 20:30:25] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:30:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:30:25] [INFO ] Time to serialize gal into /tmp/CTLFireability13874807355968996709.gal : 2 ms
[2024-05-28 20:30:25] [INFO ] Time to serialize properties into /tmp/CTLFireability3939702362545977982.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/CTLFireability13874807355968996709.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3939702362545977982.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13684e+23,1.12883,42064,577,29,73251,409,531,204544,50,1178,0


Converting to forward existential form...Done !
original formula: (EF(AG((E((i3.i1.u18.p52==1) U ((i3.i1.u15.p45==1)&&(i14.u82.p259==1))) + E(((i2.i2.u24.p75==1)||(i14.u80.p256==1)) U A((i3.i1.u17.p48==1...307
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U !(E(TRUE U !((E((i3.i1.u18.p52==1) U ((i3.i1.u15.p45==1)&&(i14.u82.p259==1))) + E(((i2....452
Reverse transition relation is NOT exact ! Due to transitions t43, t83, t131, t175, t177, i0.i1.u54.t84, i0.i2.t59, i0.i2.u62.t63, i1.i0.u29.t133, i1.i1.t1...935
Detected timeout of ITS tools.
[2024-05-28 20:30:55] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:30:55] [INFO ] Flatten gal took : 4 ms
[2024-05-28 20:30:55] [INFO ] Applying decomposition
[2024-05-28 20:30:55] [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/graph1751400809237827033.txt' '-o' '/tmp/graph1751400809237827033.bin' '-w' '/tmp/graph1751400809237827033.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1751400809237827033.bin' '-l' '-1' '-v' '-w' '/tmp/graph1751400809237827033.weights' '-q' '0' '-e' '0.001'
[2024-05-28 20:30:55] [INFO ] Decomposing Gal with order
[2024-05-28 20:30:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:30:55] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-28 20:30:55] [INFO ] Flatten gal took : 8 ms
[2024-05-28 20:30:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 20:30:55] [INFO ] Time to serialize gal into /tmp/CTLFireability13555226457152861477.gal : 2 ms
[2024-05-28 20:30:55] [INFO ] Time to serialize properties into /tmp/CTLFireability6872016841195406617.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/CTLFireability13555226457152861477.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6872016841195406617.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 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.86213e+23,4.26042,116364,1422,51,181767,799,600,627086,70,2141,0


Converting to forward existential form...Done !
original formula: ((E((i5.i1.u45.p134==1) U (!(A((i4.i1.u42.p128==1) U (i11.i2.u68.p208==1))) + !(A(((i0.i2.u1.p6==1)&&(i0.i2.u9.p25==1)) U (i5.i0.u0.p2==1...265
=> equivalent forward existential formula: (([(Init * !(E((i5.i1.u45.p134==1) U (!(!((E(!((i11.i2.u68.p208==1)) U (!((i4.i1.u42.p128==1)) * !((i11.i2.u68.p...561
Reverse transition relation is NOT exact ! Due to transitions t49, t97, t141, t193, i0.t191, i0.i1.t189, i0.i1.u6.t196, i0.i1.u10.t190, i0.i2.u1.t197, i0.i...1297
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
[2024-05-28 20:58:16] [INFO ] Applying decomposition
[2024-05-28 20:58:16] [INFO ] Flatten gal took : 5 ms
[2024-05-28 20:58:16] [INFO ] Decomposing Gal with order
[2024-05-28 20:58:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 20:58:16] [INFO ] Removed a total of 4 redundant transitions.
[2024-05-28 20:58:16] [INFO ] Flatten gal took : 12 ms
[2024-05-28 20:58:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 20:58:16] [INFO ] Time to serialize gal into /tmp/CTLFireability449169875321948825.gal : 2 ms
[2024-05-28 20:58:16] [INFO ] Time to serialize properties into /tmp/CTLFireability10216693542964903679.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/CTLFireability449169875321948825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10216693542964903679.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.86213e+23,175.946,4950620,2730,317,8.3255e+06,833,351,4.35455e+07,131,7362,0


Converting to forward existential form...Done !
original formula: ((E((i0.i0.i1.u38.p134==1) U (!(A((i0.i0.i1.i0.u37.p128==1) U (i0.i1.u55.p208==1))) + !(A(((i0.i0.i0.u4.p6==1)&&(i0.i0.i0.i1.i0.i0.i0.i0....360
=> equivalent forward existential formula: (([(Init * !(E((i0.i0.i1.u38.p134==1) U (!(!((E(!((i0.i1.u55.p208==1)) U (!((i0.i0.i1.i0.u37.p128==1)) * !((i0.i...692
Reverse transition relation is NOT exact ! Due to transitions i0.i0.i0.u4.t197, i0.i0.i0.i1.u21.t153, i0.i0.i0.i1.u21.t154, i0.i0.i0.i1.u21.t158, i0.i0.i0....2278
ITS-tools command line returned an error code 137
[2024-05-28 21:08:37] [INFO ] Flatten gal took : 8 ms
[2024-05-28 21:08:37] [INFO ] Input system was already deterministic with 236 transitions.
[2024-05-28 21:08:37] [INFO ] Transformed 256 places.
[2024-05-28 21:08:37] [INFO ] Transformed 236 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 21:08:37] [INFO ] Time to serialize gal into /tmp/CTLFireability16366739299476098287.gal : 2 ms
[2024-05-28 21:08:37] [INFO ] Time to serialize properties into /tmp/CTLFireability8271459694757092473.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/CTLFireability16366739299476098287.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8271459694757092473.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.

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="ShieldIIPt-PT-004B"
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 ShieldIIPt-PT-004B, 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 r356-tall-171683760600234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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