Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 08:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 12 08:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 12 08:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 66K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716334854147

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-00b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:40:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:40:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:40:55] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-21 23:40:55] [INFO ] Transformed 271 places.
[2024-05-21 23:40:55] [INFO ] Transformed 230 transitions.
[2024-05-21 23:40:55] [INFO ] Found NUPN structural information;
[2024-05-21 23:40:55] [INFO ] Parsed PT model containing 271 places and 230 transitions and 658 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 113 out of 271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 271/271 places, 230/230 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 269 transition count 230
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 15 place count 256 transition count 217
Iterating global reduction 1 with 13 rules applied. Total rules applied 28 place count 256 transition count 217
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 250 transition count 211
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 250 transition count 211
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 45 place count 250 transition count 206
Applied a total of 45 rules in 58 ms. Remains 250 /271 variables (removed 21) and now considering 206/230 (removed 24) transitions.
// Phase 1: matrix 206 rows 250 cols
[2024-05-21 23:40:55] [INFO ] Computed 57 invariants in 31 ms
[2024-05-21 23:40:55] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-21 23:40:55] [INFO ] Invariant cache hit.
[2024-05-21 23:40:56] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 684 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2024-05-21 23:40:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-21 23:41:00] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 20 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 20 places in 940 ms of which 3 ms to minimize.
[2024-05-21 23:41:01] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 13 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 13 places in 865 ms of which 33 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 20 places in 102 ms of which 1 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 18 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:41:02] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 4 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 10 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:41:03] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 29 places in 673 ms of which 1 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-21 23:41:04] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 0 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 0 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:41:05] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 5 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:41:06] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:41:07] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:41:08] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 7/104 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (OVERLAPS) 206/456 variables, 250/354 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:41:10] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 6 ms to minimize.
[2024-05-21 23:41:11] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 5/359 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-21 23:41:13] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 9 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:41:15] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:41:16] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/456 variables, 16/376 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-21 23:41:20] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/456 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 15 (OVERLAPS) 0/456 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 377 constraints, problems are : Problem set: 0 solved, 205 unsolved in 29601 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/249 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (OVERLAPS) 1/250 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 70/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (OVERLAPS) 206/456 variables, 250/377 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 205/582 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-21 23:41:29] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:41:30] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:41:30] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:41:31] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/456 variables, 4/586 constraints. Problems are: Problem set: 0 solved, 205 unsolved
[2024-05-21 23:41:35] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:41:37] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:41:37] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 3/589 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/456 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 11 (OVERLAPS) 0/456 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 205 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 589 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 77/77 constraints]
After SMT, in 59751ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 59763ms
Starting structural reductions in LTL mode, iteration 1 : 250/271 places, 206/230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60525 ms. Remains : 250/271 places, 206/230 transitions.
Support contains 113 out of 250 places after structural reductions.
[2024-05-21 23:41:56] [INFO ] Flatten gal took : 72 ms
[2024-05-21 23:41:56] [INFO ] Flatten gal took : 42 ms
[2024-05-21 23:41:56] [INFO ] Input system was already deterministic with 206 transitions.
Support contains 112 out of 250 places (down from 113) after GAL structural reductions.
RANDOM walk for 40000 steps (356 resets) in 2007 ms. (19 steps per ms) remains 11/70 properties
BEST_FIRST walk for 40004 steps (47 resets) in 280 ms. (142 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (49 resets) in 157 ms. (253 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40004 steps (49 resets) in 221 ms. (180 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (49 resets) in 226 ms. (176 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (50 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (54 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (54 resets) in 91 ms. (434 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (55 resets) in 62 ms. (634 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (54 resets) in 62 ms. (634 steps per ms) remains 5/6 properties
[2024-05-21 23:41:57] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 175/191 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 3 (OVERLAPS) 32/223 variables, 20/55 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 189/412 variables, 223/278 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 0/278 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 29/441 variables, 18/296 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/441 variables, 1/297 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 0/297 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/443 variables, 1/298 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/298 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 8/451 variables, 6/304 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/451 variables, 0/304 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/454 variables, 2/306 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/454 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 2/456 variables, 1/307 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/456 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/456 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 307 constraints, problems are : Problem set: 1 solved, 4 unsolved in 534 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp64 is UNSAT
At refinement iteration 1 (OVERLAPS) 177/190 variables, 35/35 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 3 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:41:58] [INFO ] Deduced a trap composed of 26 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 3/38 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/38 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 33/223 variables, 20/58 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 1/59 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/59 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 189/412 variables, 223/282 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/412 variables, 0/282 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 29/441 variables, 18/300 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 1/301 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/441 variables, 1/302 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-05-21 23:41:59] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/441 variables, 1/303 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/441 variables, 0/303 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/443 variables, 1/304 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/443 variables, 0/304 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 8/451 variables, 6/310 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/451 variables, 0/310 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/454 variables, 2/312 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/454 variables, 0/312 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/456 variables, 1/313 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/456 variables, 0/313 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/456 variables, 0/313 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 313 constraints, problems are : Problem set: 4 solved, 1 unsolved in 998 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 1551ms problems are : Problem set: 4 solved, 1 unsolved
Finished Parikh walk after 2871 steps, including 42 resets, run visited all 1 properties in 11 ms. (steps per millisecond=261 )
Parikh walk visited 1 properties in 29 ms.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA DES-PT-00b-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-00b-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:41:59] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 23:41:59] [INFO ] Flatten gal took : 32 ms
FORMULA DES-PT-00b-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:41:59] [INFO ] Flatten gal took : 31 ms
[2024-05-21 23:41:59] [INFO ] Input system was already deterministic with 206 transitions.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 447 edges and 250 vertex of which 246 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.11 ms
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 206/206 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 234 transition count 190
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 234 transition count 190
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 234 transition count 186
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 227 transition count 179
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 227 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 227 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 226 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 226 transition count 173
Applied a total of 57 rules in 50 ms. Remains 226 /250 variables (removed 24) and now considering 173/206 (removed 33) transitions.
// Phase 1: matrix 173 rows 226 cols
[2024-05-21 23:41:59] [INFO ] Computed 57 invariants in 4 ms
[2024-05-21 23:42:00] [INFO ] Implicit Places using invariants in 671 ms returned []
[2024-05-21 23:42:00] [INFO ] Invariant cache hit.
[2024-05-21 23:42:00] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 872 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-21 23:42:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:42:03] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 0 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:42:04] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 0 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:42:05] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 0 ms to minimize.
[2024-05-21 23:42:06] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:42:06] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:42:06] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 173/399 variables, 226/318 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:42:09] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 9/327 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:42:11] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:42:11] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:42:13] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 330 constraints, problems are : Problem set: 0 solved, 172 unsolved in 15774 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 173/399 variables, 226/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 172/502 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:42:19] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 43 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:42:24] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:42:29] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:42:30] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:42:31] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 515 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 60/60 constraints]
After SMT, in 45848ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 45850ms
Starting structural reductions in LTL mode, iteration 1 : 226/250 places, 173/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46775 ms. Remains : 226/250 places, 173/206 transitions.
[2024-05-21 23:42:46] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:42:46] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:42:46] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-21 23:42:46] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:42:46] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:42:46] [INFO ] Time to serialize gal into /tmp/CTLFireability10191568342153139253.gal : 4 ms
[2024-05-21 23:42:46] [INFO ] Time to serialize properties into /tmp/CTLFireability12397992003770307993.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/CTLFireability10191568342153139253.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12397992003770307993.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:43:16] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:43:16] [INFO ] Applying decomposition
[2024-05-21 23:43:16] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13015845045593331275.txt' '-o' '/tmp/graph13015845045593331275.bin' '-w' '/tmp/graph13015845045593331275.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13015845045593331275.bin' '-l' '-1' '-v' '-w' '/tmp/graph13015845045593331275.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:43:17] [INFO ] Decomposing Gal with order
[2024-05-21 23:43:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:43:17] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-21 23:43:17] [INFO ] Flatten gal took : 67 ms
[2024-05-21 23:43:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 14 ms.
[2024-05-21 23:43:17] [INFO ] Time to serialize gal into /tmp/CTLFireability3438583143728421016.gal : 14 ms
[2024-05-21 23:43:17] [INFO ] Time to serialize properties into /tmp/CTLFireability7370237403386769229.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/CTLFireability3438583143728421016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7370237403386769229.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.22197e+17,3.23111,107064,4628,74,253385,687,637,242709,80,2099,0


Converting to forward existential form...Done !
original formula: A(((i10.i0.u32.p132==1)&&(i10.i1.u63.p232==1)) U !(EF(EG(AX(((i9.u35.p163==1)&&(i6.i2.u52.p195==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U EG(!(EX(!(((i9.u35.p163==1)&&(i6.i2.u52.p195==1)))))))))))) * !(E(!(!(E(TRUE U EG(!(...343
Reverse transition relation is NOT exact ! Due to transitions t48, t56, t85, t134, t135, t167, i0.u24.t84, i1.t117, i1.u3.t122, i1.u3.t123, i1.u4.t119, i1....720
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 250/250 places, 206/206 transitions.
Graph (complete) has 447 edges and 250 vertex of which 246 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.5 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 245 transition count 182
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 226 transition count 182
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 39 place count 226 transition count 173
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 57 place count 217 transition count 173
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 69 place count 205 transition count 161
Iterating global reduction 2 with 12 rules applied. Total rules applied 81 place count 205 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 205 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 204 transition count 156
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 87 place count 204 transition count 155
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 89 place count 203 transition count 155
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 93 place count 199 transition count 151
Iterating global reduction 4 with 4 rules applied. Total rules applied 97 place count 199 transition count 151
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 100 place count 199 transition count 148
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 100 place count 199 transition count 146
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 104 place count 197 transition count 146
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 238 place count 130 transition count 79
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 239 place count 130 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 241 place count 128 transition count 76
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 243 place count 127 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 244 place count 126 transition count 75
Applied a total of 244 rules in 63 ms. Remains 126 /250 variables (removed 124) and now considering 75/206 (removed 131) transitions.
// Phase 1: matrix 75 rows 126 cols
[2024-05-21 23:43:47] [INFO ] Computed 56 invariants in 1 ms
[2024-05-21 23:43:47] [INFO ] Implicit Places using invariants in 338 ms returned []
[2024-05-21 23:43:47] [INFO ] Invariant cache hit.
[2024-05-21 23:43:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 23:43:47] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2024-05-21 23:43:47] [INFO ] Redundant transitions in 1 ms returned []
Running 74 sub problems to find dead transitions.
[2024-05-21 23:43:47] [INFO ] Invariant cache hit.
[2024-05-21 23:43:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 75/201 variables, 126/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/201 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 183 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1662 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 23/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 1/126 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 75/201 variables, 126/182 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 74/257 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 257 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2632 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 126/126 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 0/0 constraints]
After SMT, in 4319ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 4320ms
Starting structural reductions in SI_CTL mode, iteration 1 : 126/250 places, 75/206 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4934 ms. Remains : 126/250 places, 75/206 transitions.
[2024-05-21 23:43:52] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:43:52] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:43:52] [INFO ] Input system was already deterministic with 75 transitions.
[2024-05-21 23:43:52] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:43:52] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:43:52] [INFO ] Time to serialize gal into /tmp/CTLFireability10713150433637259669.gal : 5 ms
[2024-05-21 23:43:52] [INFO ] Time to serialize properties into /tmp/CTLFireability13503152016562900747.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/CTLFireability10713150433637259669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13503152016562900747.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:44:22] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:44:22] [INFO ] Applying decomposition
[2024-05-21 23:44:22] [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/graph10775429068476428761.txt' '-o' '/tmp/graph10775429068476428761.bin' '-w' '/tmp/graph10775429068476428761.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10775429068476428761.bin' '-l' '-1' '-v' '-w' '/tmp/graph10775429068476428761.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:44:22] [INFO ] Decomposing Gal with order
[2024-05-21 23:44:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:44:22] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-21 23:44:22] [INFO ] Flatten gal took : 28 ms
[2024-05-21 23:44:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-21 23:44:22] [INFO ] Time to serialize gal into /tmp/CTLFireability870971221922431675.gal : 17 ms
[2024-05-21 23:44:22] [INFO ] Time to serialize properties into /tmp/CTLFireability10995301436137060833.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/CTLFireability870971221922431675.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10995301436137060833.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.40466e+11,0.215767,9824,586,54,15997,192,306,16940,72,407,0


Converting to forward existential form...Done !
original formula: (AF((i0.u3.p24==0)) * EF(((i4.i1.u46.p247==1)&&(i14.i0.u48.p249==1))))
=> equivalent forward existential formula: ([FwdG(Init,!((i0.u3.p24==0)))] = FALSE * [(Init * !(E(TRUE U ((i4.i1.u46.p247==1)&&(i14.i0.u48.p249==1)))))] = ...161
Reverse transition relation is NOT exact ! Due to transitions t31, t64, t67, t68, t72, i0.u3.t8, i0.u3.t44, i1.u1.t11, i2.u0.t41, i2.u7.t2, i2.u8.t4, i3.u9...313
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,3.48686,148688,1,0,358545,559,1583,373814,335,1530,345098
FORMULA DES-PT-00b-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 206/206 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 235 transition count 191
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 235 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 235 transition count 187
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 229 transition count 181
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 229 transition count 181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 229 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 228 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 228 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 228 transition count 175
Applied a total of 53 rules in 23 ms. Remains 228 /250 variables (removed 22) and now considering 175/206 (removed 31) transitions.
// Phase 1: matrix 175 rows 228 cols
[2024-05-21 23:44:26] [INFO ] Computed 57 invariants in 3 ms
[2024-05-21 23:44:26] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-21 23:44:26] [INFO ] Invariant cache hit.
[2024-05-21 23:44:26] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-05-21 23:44:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 9 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:44:28] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 4 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:44:29] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:44:30] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 6 ms to minimize.
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-05-21 23:44:31] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:44:32] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 0 ms to minimize.
[2024-05-21 23:44:33] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:44:34] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/228 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (OVERLAPS) 175/403 variables, 228/321 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:44:36] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:44:37] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:44:40] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/403 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/403 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:44:43] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/403 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/403 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:44:46] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/403 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/403 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:44:49] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/403 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/403 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:44:51] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
At refinement iteration 21 (OVERLAPS) 0/403 variables, 3/337 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/403 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 23 (OVERLAPS) 0/403 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 337 constraints, problems are : Problem set: 0 solved, 174 unsolved in 29732 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 52/109 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 175/403 variables, 228/337 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 174/511 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:44:58] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:44:58] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 2/513 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:45:03] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:45:13] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/403 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:45:19] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/403 variables, and 517 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 58/58 constraints]
After SMT, in 59768ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 59770ms
Starting structural reductions in LTL mode, iteration 1 : 228/250 places, 175/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60238 ms. Remains : 228/250 places, 175/206 transitions.
[2024-05-21 23:45:26] [INFO ] Flatten gal took : 13 ms
[2024-05-21 23:45:26] [INFO ] Flatten gal took : 16 ms
[2024-05-21 23:45:26] [INFO ] Input system was already deterministic with 175 transitions.
[2024-05-21 23:45:26] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:45:26] [INFO ] Flatten gal took : 22 ms
[2024-05-21 23:45:26] [INFO ] Time to serialize gal into /tmp/CTLFireability13759907431540898089.gal : 29 ms
[2024-05-21 23:45:26] [INFO ] Time to serialize properties into /tmp/CTLFireability13551908684532279505.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/CTLFireability13759907431540898089.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13551908684532279505.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:45:56] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:45:56] [INFO ] Applying decomposition
[2024-05-21 23:45:56] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14140257397804267499.txt' '-o' '/tmp/graph14140257397804267499.bin' '-w' '/tmp/graph14140257397804267499.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14140257397804267499.bin' '-l' '-1' '-v' '-w' '/tmp/graph14140257397804267499.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:45:56] [INFO ] Decomposing Gal with order
[2024-05-21 23:45:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:45:56] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-21 23:45:56] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:45:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-21 23:45:56] [INFO ] Time to serialize gal into /tmp/CTLFireability17240238264146688927.gal : 4 ms
[2024-05-21 23:45:56] [INFO ] Time to serialize properties into /tmp/CTLFireability2652002204949948808.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/CTLFireability17240238264146688927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2652002204949948808.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.95493e+17,1.26238,36336,2313,85,63233,811,652,145340,94,2233,0


Converting to forward existential form...Done !
original formula: AX(A(AG(AF((i0.i1.u67.p254==1))) U (((i9.i0.u33.p139==1) + EF(((i0.i1.u31.p134==1)&&(i0.i1.u32.p136==1)))) + EG((i0.i1.u30.p130==1)))))
=> equivalent forward existential formula: ([((((FwdU(EY(Init),!((((i9.i0.u33.p139==1) + E(TRUE U ((i0.i1.u31.p134==1)&&(i0.i1.u32.p136==1)))) + EG((i0.i1....483
Reverse transition relation is NOT exact ! Due to transitions t49, t57, t135, t136, t169, i0.i0.u28.t75, i0.i1.t144, i0.i1.u30.t73, i0.i1.u67.t22, i0.i1.u6...757
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 206/206 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 235 transition count 191
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 235 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 235 transition count 187
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 40 place count 229 transition count 181
Iterating global reduction 1 with 6 rules applied. Total rules applied 46 place count 229 transition count 181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 50 place count 229 transition count 177
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 228 transition count 176
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 228 transition count 176
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 228 transition count 175
Applied a total of 53 rules in 24 ms. Remains 228 /250 variables (removed 22) and now considering 175/206 (removed 31) transitions.
// Phase 1: matrix 175 rows 228 cols
[2024-05-21 23:46:26] [INFO ] Computed 57 invariants in 4 ms
[2024-05-21 23:46:26] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 23:46:26] [INFO ] Invariant cache hit.
[2024-05-21 23:46:26] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 174 sub problems to find dead transitions.
[2024-05-21 23:46:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:46:28] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:46:29] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:46:30] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:46:31] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 175/403 variables, 228/310 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:46:33] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 12/322 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:46:34] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 0/403 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 323 constraints, problems are : Problem set: 0 solved, 174 unsolved in 12158 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 38/95 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:46:39] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:46:40] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 7/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 175/403 variables, 228/330 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 174/504 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:46:43] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:46:44] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:46:47] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:46:48] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 4/511 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:46:53] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/403 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-21 23:47:02] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/403 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 174 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/403 variables, and 513 constraints, problems are : Problem set: 0 solved, 174 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 54/54 constraints]
After SMT, in 42188ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 42190ms
Starting structural reductions in LTL mode, iteration 1 : 228/250 places, 175/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42466 ms. Remains : 228/250 places, 175/206 transitions.
[2024-05-21 23:47:09] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:47:09] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:47:09] [INFO ] Input system was already deterministic with 175 transitions.
[2024-05-21 23:47:09] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:47:09] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:47:09] [INFO ] Time to serialize gal into /tmp/CTLFireability10151147622133694733.gal : 1 ms
[2024-05-21 23:47:09] [INFO ] Time to serialize properties into /tmp/CTLFireability1154955939680954130.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/CTLFireability10151147622133694733.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1154955939680954130.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:47:39] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:47:39] [INFO ] Applying decomposition
[2024-05-21 23:47:39] [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/graph7042095533560532476.txt' '-o' '/tmp/graph7042095533560532476.bin' '-w' '/tmp/graph7042095533560532476.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7042095533560532476.bin' '-l' '-1' '-v' '-w' '/tmp/graph7042095533560532476.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:47:39] [INFO ] Decomposing Gal with order
[2024-05-21 23:47:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:47:39] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-21 23:47:39] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:47:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-21 23:47:39] [INFO ] Time to serialize gal into /tmp/CTLFireability2923537409323631613.gal : 2 ms
[2024-05-21 23:47:39] [INFO ] Time to serialize properties into /tmp/CTLFireability6280866683832032066.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/CTLFireability2923537409323631613.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6280866683832032066.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.27337e+17,3.92235,122648,6211,94,309059,603,621,268118,94,1854,0


Converting to forward existential form...Done !
original formula: E(AX((!(AF(((i4.i1.u19.p74==1)&&(i3.u25.p111==1)))) + AF((i0.u3.p13==1)))) U ((i4.i0.u15.p64==1) + AF(AG((((i12.u71.p260==1)&&(i3.u27.p11...191
=> equivalent forward existential formula: ([(FwdU(Init,!(EX(!((!(!(EG(!(((i4.i1.u19.p74==1)&&(i3.u25.p111==1)))))) + !(EG(!((i0.u3.p13==1))))))))) * (i4.i...390
Reverse transition relation is NOT exact ! Due to transitions t52, t56, t85, t135, t136, i0.t118, i0.u3.t123, i0.u3.t124, i0.u4.t120, i0.u4.t121, i0.u8.t11...710
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 206/206 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 235 transition count 191
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 235 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 235 transition count 188
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 40 place count 228 transition count 181
Iterating global reduction 1 with 7 rules applied. Total rules applied 47 place count 228 transition count 181
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 51 place count 228 transition count 177
Applied a total of 51 rules in 14 ms. Remains 228 /250 variables (removed 22) and now considering 177/206 (removed 29) transitions.
// Phase 1: matrix 177 rows 228 cols
[2024-05-21 23:48:09] [INFO ] Computed 57 invariants in 4 ms
[2024-05-21 23:48:09] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-21 23:48:09] [INFO ] Invariant cache hit.
[2024-05-21 23:48:09] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 176 sub problems to find dead transitions.
[2024-05-21 23:48:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 4 ms to minimize.
[2024-05-21 23:48:11] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:48:12] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:48:13] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:48:14] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 177/405 variables, 228/314 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:48:16] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 4/318 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:48:17] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:48:18] [INFO ] Deduced a trap composed of 31 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-21 23:48:19] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:48:20] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (OVERLAPS) 0/405 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 326 constraints, problems are : Problem set: 0 solved, 176 unsolved in 14451 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 176 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/227 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 2 (OVERLAPS) 1/228 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 12/57 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 41/98 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-21 23:48:25] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 7 (OVERLAPS) 177/405 variables, 228/327 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/405 variables, 176/503 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:48:27] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:48:28] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/405 variables, 8/511 constraints. Problems are: Problem set: 0 solved, 176 unsolved
[2024-05-21 23:48:34] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/405 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/405 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 176 unsolved
At refinement iteration 12 (OVERLAPS) 0/405 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 176 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 512 constraints, problems are : Problem set: 0 solved, 176 unsolved in 27015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 51/51 constraints]
After SMT, in 41485ms problems are : Problem set: 0 solved, 176 unsolved
Search for dead transitions found 0 dead transitions in 41488ms
Starting structural reductions in LTL mode, iteration 1 : 228/250 places, 177/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41851 ms. Remains : 228/250 places, 177/206 transitions.
[2024-05-21 23:48:51] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:48:51] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:48:51] [INFO ] Input system was already deterministic with 177 transitions.
[2024-05-21 23:48:51] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:48:51] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:48:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3447491720605753007.gal : 2 ms
[2024-05-21 23:48:51] [INFO ] Time to serialize properties into /tmp/CTLFireability2651462128717600711.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/CTLFireability3447491720605753007.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2651462128717600711.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:49:21] [INFO ] Flatten gal took : 11 ms
[2024-05-21 23:49:21] [INFO ] Applying decomposition
[2024-05-21 23:49:21] [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/graph11637175727257298560.txt' '-o' '/tmp/graph11637175727257298560.bin' '-w' '/tmp/graph11637175727257298560.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11637175727257298560.bin' '-l' '-1' '-v' '-w' '/tmp/graph11637175727257298560.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:49:21] [INFO ] Decomposing Gal with order
[2024-05-21 23:49:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:49:21] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-21 23:49:21] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:49:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 3 ms.
[2024-05-21 23:49:21] [INFO ] Time to serialize gal into /tmp/CTLFireability5624808060358440274.gal : 2 ms
[2024-05-21 23:49:21] [INFO ] Time to serialize properties into /tmp/CTLFireability5281089438507661906.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/CTLFireability5624808060358440274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5281089438507661906.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.14238e+17,8.71521,244680,5605,85,584045,597,640,496562,84,1873,0


Converting to forward existential form...Done !
original formula: AF((EG(((((i7.i0.u46.p176==1)&&(i2.i1.u8.p30==1))&&(i2.i2.u27.p113==1)) + EX((i10.i1.u63.p239==0)))) * AF(((i9.i0.u50.p187==1)&&(i9.i0.u5...169
=> equivalent forward existential formula: [FwdG(Init,!((EG(((((i7.i0.u46.p176==1)&&(i2.i1.u8.p30==1))&&(i2.i2.u27.p113==1)) + EX((i10.i1.u63.p239==0)))) *...220
Reverse transition relation is NOT exact ! Due to transitions t50, t54, t85, t97, t138, t139, i0.u9.t110, i0.u11.t107, i1.t120, i1.u3.t125, i1.u3.t126, i1....739
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 206/206 transitions.
Graph (complete) has 447 edges and 250 vertex of which 246 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 245 transition count 183
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 227 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 226 transition count 182
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 39 place count 226 transition count 173
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 57 place count 217 transition count 173
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 70 place count 204 transition count 160
Iterating global reduction 3 with 13 rules applied. Total rules applied 83 place count 204 transition count 160
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 88 place count 204 transition count 155
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 89 place count 203 transition count 155
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 89 place count 203 transition count 153
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 93 place count 201 transition count 153
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 97 place count 197 transition count 149
Iterating global reduction 5 with 4 rules applied. Total rules applied 101 place count 197 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 105 place count 197 transition count 145
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 108 place count 196 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 109 place count 195 transition count 143
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 8 with 116 rules applied. Total rules applied 225 place count 137 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 227 place count 135 transition count 83
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 230 place count 133 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 231 place count 132 transition count 82
Applied a total of 231 rules in 50 ms. Remains 132 /250 variables (removed 118) and now considering 82/206 (removed 124) transitions.
// Phase 1: matrix 82 rows 132 cols
[2024-05-21 23:49:51] [INFO ] Computed 55 invariants in 1 ms
[2024-05-21 23:49:51] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-21 23:49:51] [INFO ] Invariant cache hit.
[2024-05-21 23:49:51] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-21 23:49:51] [INFO ] Redundant transitions in 1 ms returned []
Running 79 sub problems to find dead transitions.
[2024-05-21 23:49:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 5/130 variables, 26/44 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/131 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 82/213 variables, 131/186 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 1/214 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/214 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 214/214 variables, and 187 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2479 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (OVERLAPS) 5/130 variables, 26/44 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/131 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:49:54] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/131 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 82/213 variables, 131/190 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/213 variables, 79/269 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:49:55] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 2/271 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 13 (OVERLAPS) 1/214 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 79 unsolved
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-05-21 23:49:58] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/214 variables, 2/274 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/214 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 16 (OVERLAPS) 0/214 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 214/214 variables, and 274 constraints, problems are : Problem set: 0 solved, 79 unsolved in 8251 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 8/8 constraints]
After SMT, in 10740ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 10741ms
Starting structural reductions in SI_CTL mode, iteration 1 : 132/250 places, 82/206 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10985 ms. Remains : 132/250 places, 82/206 transitions.
[2024-05-21 23:50:02] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:50:02] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:50:02] [INFO ] Input system was already deterministic with 82 transitions.
[2024-05-21 23:50:02] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:50:02] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:50:02] [INFO ] Time to serialize gal into /tmp/CTLFireability508218598636034359.gal : 1 ms
[2024-05-21 23:50:02] [INFO ] Time to serialize properties into /tmp/CTLFireability8450846113094747042.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/CTLFireability508218598636034359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8450846113094747042.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:50:32] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:50:32] [INFO ] Applying decomposition
[2024-05-21 23:50:32] [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/graph17491204495848164719.txt' '-o' '/tmp/graph17491204495848164719.bin' '-w' '/tmp/graph17491204495848164719.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17491204495848164719.bin' '-l' '-1' '-v' '-w' '/tmp/graph17491204495848164719.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:50:32] [INFO ] Decomposing Gal with order
[2024-05-21 23:50:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:50:32] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-21 23:50:32] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:50:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2024-05-21 23:50:32] [INFO ] Time to serialize gal into /tmp/CTLFireability14895998444235642221.gal : 1 ms
[2024-05-21 23:50:32] [INFO ] Time to serialize properties into /tmp/CTLFireability9596896799189732332.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/CTLFireability14895998444235642221.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9596896799189732332.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.37868e+11,0.252707,13924,799,73,23821,581,371,25904,70,1395,0


Converting to forward existential form...Done !
original formula: AF(E((i0.u0.p13==1) U E(A((((i1.u9.p78==1)&&(i10.u24.p163==1))&&(i10.u32.p195==1)) U (((i8.i0.u33.p203==1)&&(i3.u12.p112==1))&&(i3.u12.p1...232
=> equivalent forward existential formula: [FwdG(Init,!(E((i0.u0.p13==1) U E(!((E(!((((i8.i0.u33.p203==1)&&(i3.u12.p112==1))&&(i3.u12.p114==1))) U (!((((i1...430
Reverse transition relation is NOT exact ! Due to transitions t3, t20, t42, t43, t73, t74, u1.t17, i0.u0.t52, i0.u7.t8, i0.u8.t10, i1.u9.t0, i1.u9.t7, i1.u...320
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 13
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 206/206 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 234 transition count 190
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 234 transition count 190
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 234 transition count 186
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 227 transition count 179
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 227 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 227 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 226 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 226 transition count 173
Applied a total of 57 rules in 9 ms. Remains 226 /250 variables (removed 24) and now considering 173/206 (removed 33) transitions.
// Phase 1: matrix 173 rows 226 cols
[2024-05-21 23:51:02] [INFO ] Computed 57 invariants in 1 ms
[2024-05-21 23:51:02] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-21 23:51:02] [INFO ] Invariant cache hit.
[2024-05-21 23:51:02] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-21 23:51:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:51:04] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 0 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:51:05] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:51:06] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:51:07] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 173/399 variables, 226/318 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-21 23:51:10] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:51:11] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 9/327 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:51:13] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:14] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 330 constraints, problems are : Problem set: 0 solved, 172 unsolved in 14995 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 173/399 variables, 226/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 172/502 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:51:20] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:51:25] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:51:30] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:51:31] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:51:32] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:51:33] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 515 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 60/60 constraints]
After SMT, in 45028ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 45030ms
Starting structural reductions in LTL mode, iteration 1 : 226/250 places, 173/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45310 ms. Remains : 226/250 places, 173/206 transitions.
[2024-05-21 23:51:47] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:51:47] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:51:47] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-21 23:51:47] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:51:47] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:51:47] [INFO ] Time to serialize gal into /tmp/CTLFireability12330111307852086516.gal : 1 ms
[2024-05-21 23:51:47] [INFO ] Time to serialize properties into /tmp/CTLFireability13371329392400125463.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/CTLFireability12330111307852086516.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13371329392400125463.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:52:17] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:52:17] [INFO ] Applying decomposition
[2024-05-21 23:52:17] [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/graph11955332757730590191.txt' '-o' '/tmp/graph11955332757730590191.bin' '-w' '/tmp/graph11955332757730590191.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11955332757730590191.bin' '-l' '-1' '-v' '-w' '/tmp/graph11955332757730590191.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:52:18] [INFO ] Decomposing Gal with order
[2024-05-21 23:52:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:52:18] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-21 23:52:18] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:52:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-21 23:52:18] [INFO ] Time to serialize gal into /tmp/CTLFireability1908660045544842110.gal : 3 ms
[2024-05-21 23:52:18] [INFO ] Time to serialize properties into /tmp/CTLFireability10678254896137931348.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/CTLFireability1908660045544842110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10678254896137931348.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.22197e+17,1.57036,51824,2565,71,88318,746,593,235153,83,2623,0


Converting to forward existential form...Done !
original formula: A(EG(A(EF((((i9.i0.i1.u40.p153==1)&&(i9.i0.i1.u48.p180==1))||((i3.u14.p63==1)&&(i10.u54.p222==1)))) U (i4.u24.p97==1))) U A(EX((i9.i0.i1....190
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!((i11.u66.p241==1)) U (!(EX((i9.i0.i1.u40.p147==1))) * !((i11.u66.p241==1)))) + EG(!((i11...619
Reverse transition relation is NOT exact ! Due to transitions t52, t85, t97, t134, t135, i0.t117, i0.u3.t122, i0.u3.t123, i0.u4.t119, i0.u4.t120, i0.u8.t11...694
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 206/206 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 234 transition count 190
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 234 transition count 190
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 234 transition count 186
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 227 transition count 179
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 227 transition count 179
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 54 place count 227 transition count 175
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 226 transition count 174
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 226 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 226 transition count 173
Applied a total of 57 rules in 16 ms. Remains 226 /250 variables (removed 24) and now considering 173/206 (removed 33) transitions.
[2024-05-21 23:52:48] [INFO ] Invariant cache hit.
[2024-05-21 23:52:48] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-21 23:52:48] [INFO ] Invariant cache hit.
[2024-05-21 23:52:48] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-21 23:52:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-21 23:52:50] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:52:51] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:52:52] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:52:52] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:52:52] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:52:52] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:52:52] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:52:52] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:52:52] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:52:52] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:52:52] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:52:52] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:52:53] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 13/90 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:52:53] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:52:53] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/226 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/226 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 173/399 variables, 226/318 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:52:55] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:52:56] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 9/327 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:52:58] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:52:58] [INFO ] Deduced a trap composed of 32 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 2/329 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:52:59] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 13 (OVERLAPS) 0/399 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 399/399 variables, and 330 constraints, problems are : Problem set: 0 solved, 172 unsolved in 15169 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/226 variables, 35/46 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/226 variables, 11/57 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/226 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/226 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 173/399 variables, 226/330 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 172/502 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:53:06] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 2 ms to minimize.
[2024-05-21 23:53:06] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/399 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:53:11] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:53:11] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:53:11] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/399 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-21 23:53:16] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:53:16] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:53:16] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:53:16] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:53:17] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:53:17] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:53:18] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:53:19] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/399 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/399 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 172 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 399/399 variables, and 515 constraints, problems are : Problem set: 0 solved, 172 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 226/226 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 60/60 constraints]
After SMT, in 45199ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 45201ms
Starting structural reductions in LTL mode, iteration 1 : 226/250 places, 173/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45482 ms. Remains : 226/250 places, 173/206 transitions.
[2024-05-21 23:53:33] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:53:33] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:53:33] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-21 23:53:33] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:53:33] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:53:33] [INFO ] Time to serialize gal into /tmp/CTLFireability12242102984600509746.gal : 2 ms
[2024-05-21 23:53:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15104411502375155819.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/CTLFireability12242102984600509746.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15104411502375155819.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:54:03] [INFO ] Flatten gal took : 7 ms
[2024-05-21 23:54:03] [INFO ] Applying decomposition
[2024-05-21 23:54:03] [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/graph17632324757116033506.txt' '-o' '/tmp/graph17632324757116033506.bin' '-w' '/tmp/graph17632324757116033506.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17632324757116033506.bin' '-l' '-1' '-v' '-w' '/tmp/graph17632324757116033506.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:54:03] [INFO ] Decomposing Gal with order
[2024-05-21 23:54:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:54:03] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-21 23:54:03] [INFO ] Flatten gal took : 12 ms
[2024-05-21 23:54:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-21 23:54:03] [INFO ] Time to serialize gal into /tmp/CTLFireability9803299437563393770.gal : 2 ms
[2024-05-21 23:54:03] [INFO ] Time to serialize properties into /tmp/CTLFireability5057551664631248978.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/CTLFireability9803299437563393770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5057551664631248978.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.22197e+17,1.35633,43112,2406,68,79086,556,583,156984,82,1857,0


Converting to forward existential form...Done !
original formula: EG(EX(((EF((i10.i1.i1.u59.p203==1)) + (i9.u58.p205==1)) + (((i1.u4.p20==1)&&((i11.u63.p247==0)||(i11.u69.p249==0)))&&((i7.u34.p132==0)||(...175
=> equivalent forward existential formula: [FwdG(Init,EX(((E(TRUE U (i10.i1.i1.u59.p203==1)) + (i9.u58.p205==1)) + (((i1.u4.p20==1)&&((i11.u63.p247==0)||(i...224
Reverse transition relation is NOT exact ! Due to transitions t50, t60, t85, t134, t135, t167, i0.u10.t107, i1.t117, i1.u3.t122, i1.u3.t123, i1.u4.t119, i1...695
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 250/250 places, 206/206 transitions.
Graph (complete) has 447 edges and 250 vertex of which 246 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 245 transition count 182
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 226 transition count 182
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 39 place count 226 transition count 172
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 59 place count 216 transition count 172
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 71 place count 204 transition count 160
Iterating global reduction 2 with 12 rules applied. Total rules applied 83 place count 204 transition count 160
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 87 place count 204 transition count 156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 203 transition count 156
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 88 place count 203 transition count 154
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 92 place count 201 transition count 154
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 97 place count 196 transition count 149
Iterating global reduction 4 with 5 rules applied. Total rules applied 102 place count 196 transition count 149
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 5 rules applied. Total rules applied 107 place count 196 transition count 144
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 109 place count 195 transition count 143
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 109 place count 195 transition count 141
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 113 place count 193 transition count 141
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 6 with 128 rules applied. Total rules applied 241 place count 129 transition count 77
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 243 place count 129 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 245 place count 127 transition count 75
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 248 place count 125 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 249 place count 124 transition count 74
Applied a total of 249 rules in 40 ms. Remains 124 /250 variables (removed 126) and now considering 74/206 (removed 132) transitions.
// Phase 1: matrix 74 rows 124 cols
[2024-05-21 23:54:33] [INFO ] Computed 55 invariants in 2 ms
[2024-05-21 23:54:33] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 23:54:33] [INFO ] Invariant cache hit.
[2024-05-21 23:54:33] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-05-21 23:54:34] [INFO ] Redundant transitions in 1 ms returned []
Running 70 sub problems to find dead transitions.
[2024-05-21 23:54:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 23/50 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (OVERLAPS) 5/123 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 74/197 variables, 123/178 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 1/198 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 179 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1901 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 23/50 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/118 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (OVERLAPS) 5/123 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:54:36] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (OVERLAPS) 74/197 variables, 123/181 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 70/251 constraints. Problems are: Problem set: 0 solved, 70 unsolved
[2024-05-21 23:54:37] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 1/252 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 11 (OVERLAPS) 1/198 variables, 1/253 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 13 (OVERLAPS) 0/198 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 253 constraints, problems are : Problem set: 0 solved, 70 unsolved in 4148 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints]
After SMT, in 6059ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 6060ms
Starting structural reductions in SI_CTL mode, iteration 1 : 124/250 places, 74/206 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6296 ms. Remains : 124/250 places, 74/206 transitions.
[2024-05-21 23:54:40] [INFO ] Flatten gal took : 2 ms
[2024-05-21 23:54:40] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:54:40] [INFO ] Input system was already deterministic with 74 transitions.
RANDOM walk for 131 steps (4 resets) in 4 ms. (26 steps per ms) remains 0/1 properties
FORMULA DES-PT-00b-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 23:54:40] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:54:40] [INFO ] Flatten gal took : 3 ms
[2024-05-21 23:54:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8575983227652867575.gal : 1 ms
[2024-05-21 23:54:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10357869919013419238.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/ReachabilityCardinality8575983227652867575.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10357869919013419238.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 : 250/250 places, 206/206 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 236 transition count 192
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 236 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 236 transition count 188
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 231 transition count 183
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 231 transition count 183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 45 place count 231 transition count 180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 230 transition count 179
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 230 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 230 transition count 178
Applied a total of 48 rules in 7 ms. Remains 230 /250 variables (removed 20) and now considering 178/206 (removed 28) transitions.
// Phase 1: matrix 178 rows 230 cols
[2024-05-21 23:54:40] [INFO ] Computed 57 invariants in 2 ms
[2024-05-21 23:54:40] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-21 23:54:40] [INFO ] Invariant cache hit.
[2024-05-21 23:54:40] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
Running 177 sub problems to find dead transitions.
[2024-05-21 23:54:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/230 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:54:42] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:54:43] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:54:44] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 12/89 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:54:45] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:54:46] [INFO ] Deduced a trap composed of 34 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 10/99 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:54:47] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 9 (OVERLAPS) 178/408 variables, 230/330 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 28 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-21 23:54:50] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 33 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:54:51] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 3/338 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:54:52] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:54:53] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:54:53] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-21 23:54:53] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/408 variables, 5/343 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 14 (OVERLAPS) 0/408 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 177 unsolved
No progress, stopping.
After SMT solving in domain Real declared 408/408 variables, and 343 constraints, problems are : Problem set: 0 solved, 177 unsolved in 16950 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 177 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (OVERLAPS) 1/230 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 56/113 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 6 (OVERLAPS) 178/408 variables, 230/343 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 177/520 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:55:00] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 2/522 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:55:04] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-05-21 23:55:05] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/408 variables, 5/527 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:55:11] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 0 ms to minimize.
[2024-05-21 23:55:11] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:55:12] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/408 variables, 6/533 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-21 23:55:18] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:55:20] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/408 variables, 4/537 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:55:25] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 1)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 1)
(s82 0)
(s83 0)
(s84 1)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 408/408 variables, and 540 constraints, problems are : Problem set: 0 solved, 177 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 76/76 constraints]
After SMT, in 46982ms problems are : Problem set: 0 solved, 177 unsolved
Search for dead transitions found 0 dead transitions in 46983ms
Starting structural reductions in LTL mode, iteration 1 : 230/250 places, 178/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47233 ms. Remains : 230/250 places, 178/206 transitions.
[2024-05-21 23:55:27] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:55:27] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:55:27] [INFO ] Input system was already deterministic with 178 transitions.
[2024-05-21 23:55:27] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:55:27] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:55:27] [INFO ] Time to serialize gal into /tmp/CTLFireability14375603360114153612.gal : 1 ms
[2024-05-21 23:55:27] [INFO ] Time to serialize properties into /tmp/CTLFireability2385110374632758327.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/CTLFireability14375603360114153612.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2385110374632758327.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:55:57] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:55:57] [INFO ] Applying decomposition
[2024-05-21 23:55:57] [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/graph9957766659815551251.txt' '-o' '/tmp/graph9957766659815551251.bin' '-w' '/tmp/graph9957766659815551251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9957766659815551251.bin' '-l' '-1' '-v' '-w' '/tmp/graph9957766659815551251.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:55:57] [INFO ] Decomposing Gal with order
[2024-05-21 23:55:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:55:57] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-21 23:55:57] [INFO ] Flatten gal took : 8 ms
[2024-05-21 23:55:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-21 23:55:57] [INFO ] Time to serialize gal into /tmp/CTLFireability2741201569428323000.gal : 2 ms
[2024-05-21 23:55:57] [INFO ] Time to serialize properties into /tmp/CTLFireability18389174766017447171.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/CTLFireability2741201569428323000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18389174766017447171.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.83295e+17,2.00508,60548,3084,92,112871,843,612,151052,98,2506,0


Converting to forward existential form...Done !
original formula: E(!((A(!(EG((i10.u70.p260==1))) U AX(EX((i11.u10.p49==1)))) * A(((((i8.i1.i0.u45.p172==1)&&(i8.i1.i1.u57.p206==1))||(i5.u30.p122==1))||((...550
=> equivalent forward existential formula: [(FwdU(Init,!((!((E(!(!(EX(!(EX((i11.u10.p49==1)))))) U (!(!(EG((i10.u70.p260==1)))) * !(!(EX(!(EX((i11.u10.p49=...890
Reverse transition relation is NOT exact ! Due to transitions t52, t85, t139, t140, t172, i0.t121, i0.u3.t126, i0.u3.t127, i0.u4.t123, i0.u4.t124, i1.t117,...749
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 206/206 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 194
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 238 transition count 190
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 233 transition count 185
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 233 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 41 place count 233 transition count 182
Applied a total of 41 rules in 12 ms. Remains 233 /250 variables (removed 17) and now considering 182/206 (removed 24) transitions.
// Phase 1: matrix 182 rows 233 cols
[2024-05-21 23:56:27] [INFO ] Computed 57 invariants in 6 ms
[2024-05-21 23:56:27] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-21 23:56:27] [INFO ] Invariant cache hit.
[2024-05-21 23:56:27] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 181 sub problems to find dead transitions.
[2024-05-21 23:56:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/233 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 2 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-21 23:56:30] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:56:31] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-21 23:56:32] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-21 23:56:33] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:56:34] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:56:35] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:56:36] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 182/415 variables, 233/330 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:56:39] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/415 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-21 23:56:41] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/415 variables, 7/339 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-21 23:56:42] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:43] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/415 variables, 3/342 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/415 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 16 (OVERLAPS) 0/415 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 342 constraints, problems are : Problem set: 0 solved, 181 unsolved in 19643 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/232 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (OVERLAPS) 1/233 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/233 variables, 52/109 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (OVERLAPS) 182/415 variables, 233/342 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 181/523 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:56:50] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:56:51] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2024-05-21 23:56:54] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/415 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (OVERLAPS) 0/415 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 532 constraints, problems are : Problem set: 0 solved, 181 unsolved in 23228 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 61/61 constraints]
After SMT, in 42889ms problems are : Problem set: 0 solved, 181 unsolved
Search for dead transitions found 0 dead transitions in 42891ms
Starting structural reductions in LTL mode, iteration 1 : 233/250 places, 182/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43189 ms. Remains : 233/250 places, 182/206 transitions.
[2024-05-21 23:57:10] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:57:10] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:57:10] [INFO ] Input system was already deterministic with 182 transitions.
[2024-05-21 23:57:10] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:57:10] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:57:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16431126746845959016.gal : 1 ms
[2024-05-21 23:57:10] [INFO ] Time to serialize properties into /tmp/CTLFireability6563310023042147965.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/CTLFireability16431126746845959016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6563310023042147965.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:57:40] [INFO ] Flatten gal took : 6 ms
[2024-05-21 23:57:40] [INFO ] Applying decomposition
[2024-05-21 23:57:40] [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/graph16901271175479382703.txt' '-o' '/tmp/graph16901271175479382703.bin' '-w' '/tmp/graph16901271175479382703.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16901271175479382703.bin' '-l' '-1' '-v' '-w' '/tmp/graph16901271175479382703.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:57:40] [INFO ] Decomposing Gal with order
[2024-05-21 23:57:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:57:40] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-21 23:57:40] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:57:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 4 ms.
[2024-05-21 23:57:40] [INFO ] Time to serialize gal into /tmp/CTLFireability4388301057269435872.gal : 2 ms
[2024-05-21 23:57:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11579450933723726998.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/CTLFireability4388301057269435872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11579450933723726998.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.72704e+17,1.09977,36536,2214,83,68207,874,680,124750,90,2629,0


Converting to forward existential form...Done !
original formula: EF((((EF((i12.i1.u71.p257==1)) + A((EF((i3.u11.p45==1)) * (i8.u37.p140!=1)) U AX((i5.i0.u21.p67==1)))) + AX((i0.u31.p122==1))) * ((((i12....456
=> equivalent forward existential formula: ((([((FwdU(Init,TRUE) * ((E(TRUE U (i12.i1.u71.p257==1)) + !((E(!(!(EX(!((i5.i0.u21.p67==1))))) U (!((E(TRUE U (...1708
Reverse transition relation is NOT exact ! Due to transitions t53, t57, t86, t123, t142, t143, i0.u31.t75, i1.t127, i1.u4.t125, i2.i0.t132, i2.i0.u3.t129, ...839
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 206/206 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 235 transition count 191
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 235 transition count 191
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 235 transition count 188
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 230 transition count 183
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 230 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 45 place count 230 transition count 181
Applied a total of 45 rules in 11 ms. Remains 230 /250 variables (removed 20) and now considering 181/206 (removed 25) transitions.
// Phase 1: matrix 181 rows 230 cols
[2024-05-21 23:58:10] [INFO ] Computed 57 invariants in 2 ms
[2024-05-21 23:58:11] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-21 23:58:11] [INFO ] Invariant cache hit.
[2024-05-21 23:58:11] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 180 sub problems to find dead transitions.
[2024-05-21 23:58:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/230 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:58:13] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 11 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-05-21 23:58:14] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 0 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:58:15] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 8/84 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:58:16] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 8 (OVERLAPS) 181/411 variables, 230/316 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:58:19] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 8/324 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-21 23:58:22] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-21 23:58:23] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-21 23:58:24] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 1/327 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/411 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 14 (OVERLAPS) 0/411 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 180 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 327 constraints, problems are : Problem set: 0 solved, 180 unsolved in 17175 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 180 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 2 (OVERLAPS) 1/230 variables, 35/48 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 40/97 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 6 (OVERLAPS) 181/411 variables, 230/327 constraints. Problems are: Problem set: 0 solved, 180 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 180/507 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:58:31] [INFO ] Deduced a trap composed of 32 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:58:32] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 4/511 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-21 23:58:35] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:58:36] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:58:37] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-21 23:58:38] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 7/518 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-21 23:58:41] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-21 23:58:46] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/411 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 180 unsolved
[2024-05-21 23:58:55] [INFO ] Deduced a trap composed of 22 places in 64 ms of which 2 ms to minimize.
[2024-05-21 23:58:55] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-21 23:58:55] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/411 variables, 3/523 constraints. Problems are: Problem set: 0 solved, 180 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 523 constraints, problems are : Problem set: 0 solved, 180 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 180/180 constraints, Known Traps: 56/56 constraints]
After SMT, in 47222ms problems are : Problem set: 0 solved, 180 unsolved
Search for dead transitions found 0 dead transitions in 47224ms
Starting structural reductions in LTL mode, iteration 1 : 230/250 places, 181/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47499 ms. Remains : 230/250 places, 181/206 transitions.
[2024-05-21 23:58:58] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:58:58] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:58:58] [INFO ] Input system was already deterministic with 181 transitions.
[2024-05-21 23:58:58] [INFO ] Flatten gal took : 4 ms
[2024-05-21 23:58:58] [INFO ] Flatten gal took : 5 ms
[2024-05-21 23:58:58] [INFO ] Time to serialize gal into /tmp/CTLFireability5485811923015441371.gal : 1 ms
[2024-05-21 23:58:58] [INFO ] Time to serialize properties into /tmp/CTLFireability125159728214692160.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/CTLFireability5485811923015441371.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability125159728214692160.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-21 23:59:28] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:59:28] [INFO ] Applying decomposition
[2024-05-21 23:59:28] [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/graph10859753234637189058.txt' '-o' '/tmp/graph10859753234637189058.bin' '-w' '/tmp/graph10859753234637189058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10859753234637189058.bin' '-l' '-1' '-v' '-w' '/tmp/graph10859753234637189058.weights' '-q' '0' '-e' '0.001'
[2024-05-21 23:59:28] [INFO ] Decomposing Gal with order
[2024-05-21 23:59:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 23:59:28] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-21 23:59:28] [INFO ] Flatten gal took : 10 ms
[2024-05-21 23:59:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2024-05-21 23:59:28] [INFO ] Time to serialize gal into /tmp/CTLFireability8248062613223327145.gal : 2 ms
[2024-05-21 23:59:28] [INFO ] Time to serialize properties into /tmp/CTLFireability6722772134966513875.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/CTLFireability8248062613223327145.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6722772134966513875.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,6.22329e+17,0.834397,35324,2625,82,79523,593,667,87431,91,1700,0


Converting to forward existential form...Done !
original formula: !(E(E(((((E(((i3.i2.u24.p94==1)&&(i4.u25.p96==1)) U (i9.u74.p262==1)) + !((((i2.i1.u12.p48==1)&&(i9.u72.p250==1))&&(i8.i1.u54.p191==1))))...521
=> equivalent forward existential formula: (([(FwdU(Init,E(((((E(((i3.i2.u24.p94==1)&&(i4.u25.p96==1)) U (i9.u74.p262==1)) + !((((i2.i1.u12.p48==1)&&(i9.u7...1366
Reverse transition relation is NOT exact ! Due to transitions t48, t56, t121, t142, t143, i0.u32.t74, i1.i0.t130, i1.i0.u5.t114, i1.i2.u26.t84, i2.i0.u3.t1...734
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 206/206 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 236 transition count 192
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 236 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 236 transition count 188
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 230 transition count 182
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 230 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 47 place count 230 transition count 179
Applied a total of 47 rules in 12 ms. Remains 230 /250 variables (removed 20) and now considering 179/206 (removed 27) transitions.
// Phase 1: matrix 179 rows 230 cols
[2024-05-21 23:59:58] [INFO ] Computed 57 invariants in 3 ms
[2024-05-21 23:59:58] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 23:59:58] [INFO ] Invariant cache hit.
[2024-05-21 23:59:58] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2024-05-21 23:59:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/230 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:00:01] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 0 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-22 00:00:02] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-22 00:00:03] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 179/409 variables, 230/313 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-22 00:00:05] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/409 variables, 5/318 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-22 00:00:06] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-22 00:00:07] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 7/325 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:00:09] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:00:10] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-22 00:00:10] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-22 00:00:10] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 3/330 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:00:13] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/409 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2024-05-22 00:00:15] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/409 variables, 4/335 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/409 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 16 (OVERLAPS) 0/409 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 409/409 variables, and 335 constraints, problems are : Problem set: 0 solved, 178 unsolved in 20758 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/229 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (OVERLAPS) 1/230 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 48/105 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:00:20] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:00:21] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 8 (OVERLAPS) 179/409 variables, 230/338 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/409 variables, 178/516 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:00:25] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/409 variables, 3/519 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:00:28] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-22 00:00:30] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/409 variables, 3/522 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:00:33] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:00:34] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/409 variables, 2/524 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/409 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 00:00:44] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/409 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 178 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 409/409 variables, and 525 constraints, problems are : Problem set: 0 solved, 178 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 60/60 constraints]
After SMT, in 50793ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 50795ms
Starting structural reductions in LTL mode, iteration 1 : 230/250 places, 179/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51069 ms. Remains : 230/250 places, 179/206 transitions.
[2024-05-22 00:00:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:00:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:00:49] [INFO ] Input system was already deterministic with 179 transitions.
[2024-05-22 00:00:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:00:49] [INFO ] Flatten gal took : 4 ms
[2024-05-22 00:00:49] [INFO ] Time to serialize gal into /tmp/CTLFireability3848444635012496082.gal : 1 ms
[2024-05-22 00:00:49] [INFO ] Time to serialize properties into /tmp/CTLFireability5023860038770455690.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/CTLFireability3848444635012496082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5023860038770455690.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 00:01:19] [INFO ] Flatten gal took : 9 ms
[2024-05-22 00:01:19] [INFO ] Applying decomposition
[2024-05-22 00:01:19] [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/graph5052827802140279878.txt' '-o' '/tmp/graph5052827802140279878.bin' '-w' '/tmp/graph5052827802140279878.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5052827802140279878.bin' '-l' '-1' '-v' '-w' '/tmp/graph5052827802140279878.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:01:19] [INFO ] Decomposing Gal with order
[2024-05-22 00:01:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:01:19] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 00:01:19] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:01:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-22 00:01:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13602485896892167682.gal : 2 ms
[2024-05-22 00:01:19] [INFO ] Time to serialize properties into /tmp/CTLFireability12844764336122282114.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/CTLFireability13602485896892167682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12844764336122282114.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.93732e+17,1.06562,36696,2428,90,73967,795,662,101562,89,2545,0


Converting to forward existential form...Done !
original formula: EG(EX(((EF(EX((i4.u28.p108==1))) + (((i2.i1.u9.p37==1)&&(i4.u27.p98==1))&&(((i9.i1.u42.p151==0)||(i9.i1.u49.p177==0))&&(((i7.i0.u36.p138=...332
=> equivalent forward existential formula: [FwdG(Init,EX(((E(TRUE U EX((i4.u28.p108==1))) + (((i2.i1.u9.p37==1)&&(i4.u27.p98==1))&&(((i9.i1.u42.p151==0)||(...387
Reverse transition relation is NOT exact ! Due to transitions t48, t52, t139, t140, i0.i1.u76.t15, i1.t122, i1.u4.t127, i1.u4.t128, i1.u5.t124, i1.u5.t125,...781
Detected timeout of ITS tools.
[2024-05-22 00:01:49] [INFO ] Flatten gal took : 8 ms
[2024-05-22 00:01:49] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:01:49] [INFO ] Applying decomposition
[2024-05-22 00:01:49] [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/graph15685924745894368754.txt' '-o' '/tmp/graph15685924745894368754.bin' '-w' '/tmp/graph15685924745894368754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15685924745894368754.bin' '-l' '-1' '-v' '-w' '/tmp/graph15685924745894368754.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:01:49] [INFO ] Decomposing Gal with order
[2024-05-22 00:01:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:01:49] [INFO ] Removed a total of 24 redundant transitions.
[2024-05-22 00:01:49] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:01:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 2 ms.
[2024-05-22 00:01:49] [INFO ] Time to serialize gal into /tmp/CTLFireability14737577572440998082.gal : 2 ms
[2024-05-22 00:01:49] [INFO ] Time to serialize properties into /tmp/CTLFireability5578149037032237170.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/CTLFireability14737577572440998082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5578149037032237170.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 11 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.35528e+18,1.35539,48056,3250,86,97728,705,651,128766,105,2551,0


Converting to forward existential form...Done !
original formula: A(((i6.u38.p132==1)&&(i10.u69.p232==1)) U !(EF(EG(AX(((i7.u41.p163==1)&&(i8.u58.p195==1)))))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U EG(!(EX(!(((i7.u41.p163==1)&&(i8.u58.p195==1)))))))))))) * !(E(!(!(E(TRUE U EG(!(EX(...327
Reverse transition relation is NOT exact ! Due to transitions t53, t57, t90, t137, i0.t126, i0.u6.t128, i0.u9.t134, i0.u9.t136, i1.t111, i1.u14.t113, i2.u4...812
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,407.179,2216612,1,0,5.38686e+06,1211,2083,4.25096e+06,282,4352,3599508
FORMULA DES-PT-00b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2024-05-22 00:28:48] [INFO ] Applying decomposition
[2024-05-22 00:28:48] [INFO ] Flatten gal took : 5 ms
[2024-05-22 00:28:48] [INFO ] Decomposing Gal with order
[2024-05-22 00:28:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:28:48] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-22 00:28:48] [INFO ] Flatten gal took : 20 ms
[2024-05-22 00:28:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 6 ms.
[2024-05-22 00:28:48] [INFO ] Time to serialize gal into /tmp/CTLFireability631818893820447349.gal : 3 ms
[2024-05-22 00:28:48] [INFO ] Time to serialize properties into /tmp/CTLFireability7781669902312233894.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/CTLFireability631818893820447349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7781669902312233894.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 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,4.35528e+18,20.8535,639368,11781,343,695626,1714,602,6.29841e+06,149,8260,0


Converting to forward existential form...Done !
original formula: AX(A(AG(AF((i1.i0.i1.u95.p254==1))) U (((i1.i0.i1.i0.i0.i1.i0.i0.u131.p139==1) + EF(((i1.i0.i1.i0.i0.i0.u37.p134==1)&&(i1.i0.i1.i0.i0.i0....212
=> equivalent forward existential formula: ([((((FwdU(EY(Init),!((((i1.i0.i1.i0.i0.i1.i0.i0.u131.p139==1) + E(TRUE U ((i1.i0.i1.i0.i0.i0.u37.p134==1)&&(i1....654
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u12.t111, i0.i0.u12.t113, i0.i0.i0.u11.t116, i0.i0.i0.u11.t118, i0.i0.i0.u11.t120, i0.i...1758

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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