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.r026-smll-171620167400306.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 AutonomousCar-PT-06b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167400306
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 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 228K 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 AutonomousCar-PT-06b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716328299950

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 21:51:42] [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 21:51:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:51:43] [INFO ] Load time of PNML (sax parser for PT used): 356 ms
[2024-05-21 21:51:43] [INFO ] Transformed 289 places.
[2024-05-21 21:51:43] [INFO ] Transformed 644 transitions.
[2024-05-21 21:51:43] [INFO ] Found NUPN structural information;
[2024-05-21 21:51:43] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 622 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 35 ms.
Support contains 98 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 254 transition count 609
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 254 transition count 609
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 251 transition count 606
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 251 transition count 606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 250 transition count 605
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 250 transition count 605
Applied a total of 78 rules in 177 ms. Remains 250 /289 variables (removed 39) and now considering 605/644 (removed 39) transitions.
// Phase 1: matrix 605 rows 250 cols
[2024-05-21 21:51:43] [INFO ] Computed 11 invariants in 40 ms
[2024-05-21 21:51:44] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-05-21 21:51:44] [INFO ] Invariant cache hit.
[2024-05-21 21:51:44] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2024-05-21 21:51:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/250 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-21 21:51:58] [INFO ] Deduced a trap composed of 52 places in 443 ms of which 49 ms to minimize.
[2024-05-21 21:51:59] [INFO ] Deduced a trap composed of 31 places in 370 ms of which 5 ms to minimize.
[2024-05-21 21:51:59] [INFO ] Deduced a trap composed of 47 places in 347 ms of which 5 ms to minimize.
[2024-05-21 21:51:59] [INFO ] Deduced a trap composed of 23 places in 351 ms of which 4 ms to minimize.
[2024-05-21 21:52:00] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 3 ms to minimize.
[2024-05-21 21:52:00] [INFO ] Deduced a trap composed of 32 places in 203 ms of which 3 ms to minimize.
[2024-05-21 21:52:00] [INFO ] Deduced a trap composed of 31 places in 209 ms of which 3 ms to minimize.
[2024-05-21 21:52:01] [INFO ] Deduced a trap composed of 25 places in 220 ms of which 3 ms to minimize.
[2024-05-21 21:52:01] [INFO ] Deduced a trap composed of 23 places in 378 ms of which 5 ms to minimize.
[2024-05-21 21:52:01] [INFO ] Deduced a trap composed of 31 places in 360 ms of which 4 ms to minimize.
[2024-05-21 21:52:02] [INFO ] Deduced a trap composed of 26 places in 295 ms of which 4 ms to minimize.
[2024-05-21 21:52:02] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 4 ms to minimize.
[2024-05-21 21:52:02] [INFO ] Deduced a trap composed of 43 places in 250 ms of which 3 ms to minimize.
[2024-05-21 21:52:02] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 4 ms to minimize.
[2024-05-21 21:52:03] [INFO ] Deduced a trap composed of 35 places in 330 ms of which 4 ms to minimize.
[2024-05-21 21:52:03] [INFO ] Deduced a trap composed of 37 places in 317 ms of which 3 ms to minimize.
[2024-05-21 21:52:04] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 3 ms to minimize.
[2024-05-21 21:52:04] [INFO ] Deduced a trap composed of 43 places in 300 ms of which 4 ms to minimize.
[2024-05-21 21:52:04] [INFO ] Deduced a trap composed of 43 places in 294 ms of which 4 ms to minimize.
[2024-05-21 21:52:05] [INFO ] Deduced a trap composed of 27 places in 370 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-21 21:52:06] [INFO ] Deduced a trap composed of 46 places in 330 ms of which 4 ms to minimize.
[2024-05-21 21:52:06] [INFO ] Deduced a trap composed of 36 places in 352 ms of which 4 ms to minimize.
[2024-05-21 21:52:07] [INFO ] Deduced a trap composed of 46 places in 319 ms of which 4 ms to minimize.
[2024-05-21 21:52:07] [INFO ] Deduced a trap composed of 43 places in 308 ms of which 4 ms to minimize.
[2024-05-21 21:52:07] [INFO ] Deduced a trap composed of 40 places in 372 ms of which 4 ms to minimize.
[2024-05-21 21:52:08] [INFO ] Deduced a trap composed of 14 places in 362 ms of which 4 ms to minimize.
[2024-05-21 21:52:08] [INFO ] Deduced a trap composed of 31 places in 326 ms of which 4 ms to minimize.
[2024-05-21 21:52:09] [INFO ] Deduced a trap composed of 41 places in 261 ms of which 4 ms to minimize.
[2024-05-21 21:52:09] [INFO ] Deduced a trap composed of 40 places in 264 ms of which 4 ms to minimize.
[2024-05-21 21:52:10] [INFO ] Deduced a trap composed of 49 places in 365 ms of which 4 ms to minimize.
[2024-05-21 21:52:10] [INFO ] Deduced a trap composed of 50 places in 267 ms of which 4 ms to minimize.
[2024-05-21 21:52:10] [INFO ] Deduced a trap composed of 44 places in 245 ms of which 4 ms to minimize.
[2024-05-21 21:52:11] [INFO ] Deduced a trap composed of 31 places in 286 ms of which 4 ms to minimize.
[2024-05-21 21:52:11] [INFO ] Deduced a trap composed of 48 places in 285 ms of which 4 ms to minimize.
[2024-05-21 21:52:11] [INFO ] Deduced a trap composed of 34 places in 296 ms of which 3 ms to minimize.
[2024-05-21 21:52:12] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 4 ms to minimize.
[2024-05-21 21:52:12] [INFO ] Deduced a trap composed of 41 places in 199 ms of which 3 ms to minimize.
[2024-05-21 21:52:12] [INFO ] Deduced a trap composed of 44 places in 244 ms of which 4 ms to minimize.
[2024-05-21 21:52:12] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 3 ms to minimize.
[2024-05-21 21:52:13] [INFO ] Deduced a trap composed of 40 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 250/855 variables, and 51 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/250 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/249 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/250 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-21 21:52:23] [INFO ] Deduced a trap composed of 42 places in 252 ms of which 2 ms to minimize.
[2024-05-21 21:52:24] [INFO ] Deduced a trap composed of 44 places in 336 ms of which 4 ms to minimize.
[2024-05-21 21:52:24] [INFO ] Deduced a trap composed of 43 places in 328 ms of which 4 ms to minimize.
[2024-05-21 21:52:24] [INFO ] Deduced a trap composed of 39 places in 319 ms of which 4 ms to minimize.
[2024-05-21 21:52:25] [INFO ] Deduced a trap composed of 19 places in 436 ms of which 5 ms to minimize.
[2024-05-21 21:52:26] [INFO ] Deduced a trap composed of 45 places in 284 ms of which 3 ms to minimize.
[2024-05-21 21:52:26] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 2 ms to minimize.
[2024-05-21 21:52:27] [INFO ] Deduced a trap composed of 44 places in 259 ms of which 3 ms to minimize.
[2024-05-21 21:52:27] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 3 ms to minimize.
[2024-05-21 21:52:27] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:52:28] [INFO ] Deduced a trap composed of 32 places in 273 ms of which 5 ms to minimize.
[2024-05-21 21:52:28] [INFO ] Deduced a trap composed of 45 places in 218 ms of which 4 ms to minimize.
[2024-05-21 21:52:28] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 3 ms to minimize.
[2024-05-21 21:52:28] [INFO ] Deduced a trap composed of 41 places in 242 ms of which 3 ms to minimize.
[2024-05-21 21:52:29] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 3 ms to minimize.
[2024-05-21 21:52:29] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 2 ms to minimize.
[2024-05-21 21:52:29] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 3 ms to minimize.
[2024-05-21 21:52:30] [INFO ] Deduced a trap composed of 42 places in 195 ms of which 2 ms to minimize.
[2024-05-21 21:52:30] [INFO ] Deduced a trap composed of 41 places in 195 ms of which 2 ms to minimize.
[2024-05-21 21:52:30] [INFO ] Deduced a trap composed of 44 places in 221 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-21 21:52:31] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 3 ms to minimize.
[2024-05-21 21:52:32] [INFO ] Deduced a trap composed of 41 places in 286 ms of which 4 ms to minimize.
[2024-05-21 21:52:32] [INFO ] Deduced a trap composed of 28 places in 215 ms of which 3 ms to minimize.
[2024-05-21 21:52:34] [INFO ] Deduced a trap composed of 40 places in 136 ms of which 2 ms to minimize.
[2024-05-21 21:52:34] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2024-05-21 21:52:34] [INFO ] Deduced a trap composed of 44 places in 153 ms of which 3 ms to minimize.
[2024-05-21 21:52:35] [INFO ] Deduced a trap composed of 11 places in 328 ms of which 3 ms to minimize.
[2024-05-21 21:52:36] [INFO ] Deduced a trap composed of 6 places in 320 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-21 21:52:41] [INFO ] Deduced a trap composed of 21 places in 429 ms of which 4 ms to minimize.
[2024-05-21 21:52:42] [INFO ] Deduced a trap composed of 42 places in 338 ms of which 3 ms to minimize.
[2024-05-21 21:52:42] [INFO ] Deduced a trap composed of 29 places in 317 ms of which 4 ms to minimize.
[2024-05-21 21:52:43] [INFO ] Deduced a trap composed of 25 places in 414 ms of which 5 ms to minimize.
[2024-05-21 21:52:43] [INFO ] Deduced a trap composed of 44 places in 398 ms of which 5 ms to minimize.
[2024-05-21 21:52:46] [INFO ] Deduced a trap composed of 12 places in 301 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 250/855 variables, and 85 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/250 constraints, PredecessorRefiner: 0/604 constraints, Known Traps: 74/74 constraints]
After SMT, in 63393ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 63456ms
Starting structural reductions in LTL mode, iteration 1 : 250/289 places, 605/644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64813 ms. Remains : 250/289 places, 605/644 transitions.
Support contains 98 out of 250 places after structural reductions.
[2024-05-21 21:52:48] [INFO ] Flatten gal took : 210 ms
[2024-05-21 21:52:48] [INFO ] Flatten gal took : 128 ms
[2024-05-21 21:52:49] [INFO ] Input system was already deterministic with 605 transitions.
Support contains 95 out of 250 places (down from 98) after GAL structural reductions.
RANDOM walk for 40000 steps (215 resets) in 3869 ms. (10 steps per ms) remains 36/91 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (10 resets) in 54 ms. (72 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (9 resets) in 45 ms. (87 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (10 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
[2024-05-21 21:52:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp85 is UNSAT
At refinement iteration 1 (OVERLAPS) 192/240 variables, 10/10 constraints. Problems are: Problem set: 7 solved, 29 unsolved
[2024-05-21 21:52:52] [INFO ] Deduced a trap composed of 31 places in 227 ms of which 4 ms to minimize.
Problem AtomicPropp53 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 1/11 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/11 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 4 (OVERLAPS) 10/250 variables, 1/12 constraints. Problems are: Problem set: 8 solved, 28 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 28 unsolved
Problem AtomicPropp75 is UNSAT
At refinement iteration 6 (OVERLAPS) 605/855 variables, 250/262 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/855 variables, 0/262 constraints. Problems are: Problem set: 9 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 0/855 variables, 0/262 constraints. Problems are: Problem set: 9 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 855/855 variables, and 262 constraints, problems are : Problem set: 9 solved, 27 unsolved in 2738 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 9 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 27 unsolved
Problem AtomicPropp3 is UNSAT
At refinement iteration 1 (OVERLAPS) 173/215 variables, 9/9 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 1/10 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/215 variables, 0/10 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 35/250 variables, 2/12 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/12 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 605/855 variables, 250/262 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/855 variables, 26/288 constraints. Problems are: Problem set: 10 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/855 variables, 0/288 constraints. Problems are: Problem set: 10 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 855/855 variables, and 288 constraints, problems are : Problem set: 10 solved, 26 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 26/36 constraints, Known Traps: 1/1 constraints]
After SMT, in 8525ms problems are : Problem set: 10 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 184 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 917 edges and 248 vertex of which 245 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.10 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 85 rules applied. Total rules applied 87 place count 245 transition count 515
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 122 rules applied. Total rules applied 209 place count 162 transition count 476
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 24 rules applied. Total rules applied 233 place count 140 transition count 474
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 235 place count 138 transition count 474
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 235 place count 138 transition count 467
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 249 place count 131 transition count 467
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 258 place count 122 transition count 458
Iterating global reduction 4 with 9 rules applied. Total rules applied 267 place count 122 transition count 458
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 411 place count 122 transition count 314
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 412 place count 121 transition count 313
Iterating global reduction 5 with 1 rules applied. Total rules applied 413 place count 121 transition count 313
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 469 place count 93 transition count 285
Free-agglomeration rule applied 15 times.
Iterating global reduction 5 with 15 rules applied. Total rules applied 484 place count 93 transition count 270
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 499 place count 78 transition count 270
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 502 place count 78 transition count 270
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 503 place count 77 transition count 263
Iterating global reduction 6 with 1 rules applied. Total rules applied 504 place count 77 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 505 place count 76 transition count 262
Applied a total of 505 rules in 266 ms. Remains 76 /250 variables (removed 174) and now considering 262/605 (removed 343) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 76/250 places, 262/605 transitions.
RANDOM walk for 40000 steps (1593 resets) in 771 ms. (51 steps per ms) remains 16/26 properties
BEST_FIRST walk for 4004 steps (20 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (19 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (18 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (17 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (19 resets) in 13 ms. (285 steps per ms) remains 14/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 12 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (20 resets) in 13 ms. (286 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (20 resets) in 11 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (15 resets) in 11 ms. (333 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4003 steps (16 resets) in 21 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 11/11 properties
// Phase 1: matrix 262 rows 76 cols
[2024-05-21 21:53:00] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 21:53:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 45/64 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 253/317 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 21/338 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/338 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 88 constraints, problems are : Problem set: 0 solved, 11 unsolved in 846 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 45/64 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 253/317 variables, 64/72 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 21/338 variables, 12/84 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/338 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/338 variables, and 99 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1373 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 76/76 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 2283ms problems are : Problem set: 0 solved, 11 unsolved
Parikh walk visited 0 properties in 5084 ms.
Support contains 19 out of 76 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 76/76 places, 262/262 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 76 transition count 259
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 73 transition count 259
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 73 transition count 258
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 72 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 71 transition count 257
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 71 transition count 257
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 20 place count 66 transition count 252
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 30 place count 61 transition count 247
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 38 place count 61 transition count 239
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 52 place count 53 transition count 233
Applied a total of 52 rules in 72 ms. Remains 53 /76 variables (removed 23) and now considering 233/262 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 53/76 places, 233/262 transitions.
RANDOM walk for 40000 steps (1857 resets) in 494 ms. (80 steps per ms) remains 4/11 properties
BEST_FIRST walk for 40004 steps (279 resets) in 66 ms. (597 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (225 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (267 resets) in 46 ms. (851 steps per ms) remains 1/2 properties
// Phase 1: matrix 233 rows 53 cols
[2024-05-21 21:53:07] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 21:53:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 207/227 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 59/286 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/286 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 65 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 16/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 207/227 variables, 20/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 59/286 variables, 33/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/286 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 66 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 314ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 233/233 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 50 transition count 212
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 50 transition count 212
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 49 transition count 211
Free-agglomeration rule applied 6 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 49 transition count 199
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 44 place count 43 transition count 175
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 42 transition count 174
Applied a total of 45 rules in 37 ms. Remains 42 /53 variables (removed 11) and now considering 174/233 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 42/53 places, 174/233 transitions.
RANDOM walk for 32906 steps (313 resets) in 226 ms. (144 steps per ms) remains 0/1 properties
Successfully simplified 10 atomic propositions for a total of 16 simplifications.
[2024-05-21 21:53:08] [INFO ] Flatten gal took : 65 ms
[2024-05-21 21:53:08] [INFO ] Flatten gal took : 54 ms
[2024-05-21 21:53:08] [INFO ] Input system was already deterministic with 605 transitions.
Support contains 87 out of 250 places (down from 88) after GAL structural reductions.
Computed a total of 45 stabilizing places and 46 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 239 transition count 594
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 239 transition count 594
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 238 transition count 593
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 238 transition count 593
Applied a total of 24 rules in 19 ms. Remains 238 /250 variables (removed 12) and now considering 593/605 (removed 12) transitions.
// Phase 1: matrix 593 rows 238 cols
[2024-05-21 21:53:08] [INFO ] Computed 11 invariants in 5 ms
[2024-05-21 21:53:08] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-21 21:53:08] [INFO ] Invariant cache hit.
[2024-05-21 21:53:08] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 592 sub problems to find dead transitions.
[2024-05-21 21:53:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-21 21:53:18] [INFO ] Deduced a trap composed of 21 places in 215 ms of which 3 ms to minimize.
[2024-05-21 21:53:18] [INFO ] Deduced a trap composed of 17 places in 226 ms of which 3 ms to minimize.
[2024-05-21 21:53:18] [INFO ] Deduced a trap composed of 60 places in 207 ms of which 2 ms to minimize.
[2024-05-21 21:53:18] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 2 ms to minimize.
[2024-05-21 21:53:19] [INFO ] Deduced a trap composed of 26 places in 214 ms of which 3 ms to minimize.
[2024-05-21 21:53:19] [INFO ] Deduced a trap composed of 33 places in 208 ms of which 3 ms to minimize.
[2024-05-21 21:53:19] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 3 ms to minimize.
[2024-05-21 21:53:19] [INFO ] Deduced a trap composed of 65 places in 284 ms of which 3 ms to minimize.
[2024-05-21 21:53:20] [INFO ] Deduced a trap composed of 42 places in 256 ms of which 2 ms to minimize.
[2024-05-21 21:53:20] [INFO ] Deduced a trap composed of 37 places in 266 ms of which 3 ms to minimize.
[2024-05-21 21:53:20] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 3 ms to minimize.
[2024-05-21 21:53:21] [INFO ] Deduced a trap composed of 66 places in 236 ms of which 2 ms to minimize.
[2024-05-21 21:53:21] [INFO ] Deduced a trap composed of 39 places in 355 ms of which 3 ms to minimize.
[2024-05-21 21:53:21] [INFO ] Deduced a trap composed of 43 places in 314 ms of which 4 ms to minimize.
[2024-05-21 21:53:22] [INFO ] Deduced a trap composed of 41 places in 351 ms of which 3 ms to minimize.
[2024-05-21 21:53:22] [INFO ] Deduced a trap composed of 40 places in 352 ms of which 4 ms to minimize.
[2024-05-21 21:53:22] [INFO ] Deduced a trap composed of 38 places in 351 ms of which 4 ms to minimize.
[2024-05-21 21:53:23] [INFO ] Deduced a trap composed of 47 places in 303 ms of which 4 ms to minimize.
[2024-05-21 21:53:23] [INFO ] Deduced a trap composed of 38 places in 384 ms of which 4 ms to minimize.
[2024-05-21 21:53:24] [INFO ] Deduced a trap composed of 31 places in 266 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-21 21:53:24] [INFO ] Deduced a trap composed of 25 places in 487 ms of which 4 ms to minimize.
[2024-05-21 21:53:25] [INFO ] Deduced a trap composed of 43 places in 375 ms of which 4 ms to minimize.
[2024-05-21 21:53:25] [INFO ] Deduced a trap composed of 31 places in 336 ms of which 3 ms to minimize.
[2024-05-21 21:53:26] [INFO ] Deduced a trap composed of 23 places in 319 ms of which 3 ms to minimize.
[2024-05-21 21:53:26] [INFO ] Deduced a trap composed of 14 places in 305 ms of which 4 ms to minimize.
[2024-05-21 21:53:26] [INFO ] Deduced a trap composed of 36 places in 313 ms of which 4 ms to minimize.
[2024-05-21 21:53:27] [INFO ] Deduced a trap composed of 37 places in 311 ms of which 3 ms to minimize.
[2024-05-21 21:53:27] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 2 ms to minimize.
[2024-05-21 21:53:27] [INFO ] Deduced a trap composed of 38 places in 298 ms of which 4 ms to minimize.
[2024-05-21 21:53:28] [INFO ] Deduced a trap composed of 42 places in 250 ms of which 4 ms to minimize.
[2024-05-21 21:53:28] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 4 ms to minimize.
[2024-05-21 21:53:28] [INFO ] Deduced a trap composed of 31 places in 275 ms of which 3 ms to minimize.
[2024-05-21 21:53:28] [INFO ] Deduced a trap composed of 31 places in 195 ms of which 2 ms to minimize.
[2024-05-21 21:53:29] [INFO ] Deduced a trap composed of 35 places in 305 ms of which 4 ms to minimize.
[2024-05-21 21:53:29] [INFO ] Deduced a trap composed of 58 places in 214 ms of which 2 ms to minimize.
[2024-05-21 21:53:29] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 4 ms to minimize.
[2024-05-21 21:53:30] [INFO ] Deduced a trap composed of 40 places in 204 ms of which 3 ms to minimize.
[2024-05-21 21:53:30] [INFO ] Deduced a trap composed of 40 places in 237 ms of which 3 ms to minimize.
[2024-05-21 21:53:30] [INFO ] Deduced a trap composed of 32 places in 235 ms of which 3 ms to minimize.
[2024-05-21 21:53:31] [INFO ] Deduced a trap composed of 32 places in 263 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 592 unsolved
[2024-05-21 21:53:36] [INFO ] Deduced a trap composed of 31 places in 341 ms of which 4 ms to minimize.
[2024-05-21 21:53:37] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 2 ms to minimize.
[2024-05-21 21:53:38] [INFO ] Deduced a trap composed of 40 places in 293 ms of which 4 ms to minimize.
[2024-05-21 21:53:38] [INFO ] Deduced a trap composed of 31 places in 284 ms of which 4 ms to minimize.
[2024-05-21 21:53:38] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 4 ms to minimize.
[2024-05-21 21:53:39] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 3 ms to minimize.
[2024-05-21 21:53:39] [INFO ] Deduced a trap composed of 32 places in 226 ms of which 3 ms to minimize.
[2024-05-21 21:53:40] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 4 ms to minimize.
[2024-05-21 21:53:40] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 3 ms to minimize.
[2024-05-21 21:53:40] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 3 ms to minimize.
[2024-05-21 21:53:41] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 3 ms to minimize.
[2024-05-21 21:53:41] [INFO ] Deduced a trap composed of 31 places in 295 ms of which 3 ms to minimize.
SMT process timed out in 32694ms, After SMT, problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 32707ms
Starting structural reductions in LTL mode, iteration 1 : 238/250 places, 593/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33126 ms. Remains : 238/250 places, 593/605 transitions.
[2024-05-21 21:53:41] [INFO ] Flatten gal took : 47 ms
[2024-05-21 21:53:41] [INFO ] Flatten gal took : 55 ms
[2024-05-21 21:53:41] [INFO ] Input system was already deterministic with 593 transitions.
[2024-05-21 21:53:41] [INFO ] Flatten gal took : 46 ms
[2024-05-21 21:53:41] [INFO ] Flatten gal took : 46 ms
[2024-05-21 21:53:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16109104351787089758.gal : 45 ms
[2024-05-21 21:53:42] [INFO ] Time to serialize properties into /tmp/CTLFireability11823667883405276307.ctl : 4 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/CTLFireability16109104351787089758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11823667883405276307.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 21:54:12] [INFO ] Flatten gal took : 30 ms
[2024-05-21 21:54:12] [INFO ] Applying decomposition
[2024-05-21 21:54:12] [INFO ] Flatten gal took : 29 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/graph14434083354417024640.txt' '-o' '/tmp/graph14434083354417024640.bin' '-w' '/tmp/graph14434083354417024640.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14434083354417024640.bin' '-l' '-1' '-v' '-w' '/tmp/graph14434083354417024640.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:54:12] [INFO ] Decomposing Gal with order
[2024-05-21 21:54:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:54:12] [INFO ] Removed a total of 1211 redundant transitions.
[2024-05-21 21:54:12] [INFO ] Flatten gal took : 244 ms
[2024-05-21 21:54:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 42 ms.
[2024-05-21 21:54:12] [INFO ] Time to serialize gal into /tmp/CTLFireability1529514710417347965.gal : 16 ms
[2024-05-21 21:54:13] [INFO ] Time to serialize properties into /tmp/CTLFireability141414548050929034.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/CTLFireability1529514710417347965.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability141414548050929034.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44207e+12,0.425882,13156,1591,129,20599,1597,639,31113,104,5123,0


Converting to forward existential form...Done !
original formula: AX((((EF(((EX((((u73.p6==0)||(u73.p17==0))||((i4.i1.u28.p113==0)||(u73.p246==0)))) + ((((u73.p6==0)||(u73.p14==0))||((i11.i1.u57.p206==0)...1074
=> equivalent forward existential formula: ((([(EY(Init) * !(E(TRUE U ((EX((((u73.p6==0)||(u73.p17==0))||((i4.i1.u28.p113==0)||(u73.p246==0)))) + ((((u73.p...1280
Reverse transition relation is NOT exact ! Due to transitions t189, t222, t224, t228, t276, t324, t456, t492, t590, u73.t225, i1.i1.t215, i1.i1.u10.t195, i...870
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 239 transition count 594
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 239 transition count 594
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 166 place count 239 transition count 450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 167 place count 238 transition count 449
Iterating global reduction 1 with 1 rules applied. Total rules applied 168 place count 238 transition count 449
Applied a total of 168 rules in 19 ms. Remains 238 /250 variables (removed 12) and now considering 449/605 (removed 156) transitions.
// Phase 1: matrix 449 rows 238 cols
[2024-05-21 21:54:43] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 21:54:43] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-21 21:54:43] [INFO ] Invariant cache hit.
[2024-05-21 21:54:43] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
Running 448 sub problems to find dead transitions.
[2024-05-21 21:54:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-05-21 21:54:52] [INFO ] Deduced a trap composed of 50 places in 359 ms of which 6 ms to minimize.
[2024-05-21 21:54:52] [INFO ] Deduced a trap composed of 55 places in 280 ms of which 6 ms to minimize.
[2024-05-21 21:54:53] [INFO ] Deduced a trap composed of 32 places in 274 ms of which 3 ms to minimize.
[2024-05-21 21:54:53] [INFO ] Deduced a trap composed of 32 places in 269 ms of which 4 ms to minimize.
[2024-05-21 21:54:53] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 3 ms to minimize.
[2024-05-21 21:54:54] [INFO ] Deduced a trap composed of 44 places in 260 ms of which 3 ms to minimize.
[2024-05-21 21:54:54] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 4 ms to minimize.
[2024-05-21 21:54:54] [INFO ] Deduced a trap composed of 45 places in 258 ms of which 4 ms to minimize.
[2024-05-21 21:54:54] [INFO ] Deduced a trap composed of 46 places in 243 ms of which 3 ms to minimize.
[2024-05-21 21:54:55] [INFO ] Deduced a trap composed of 47 places in 240 ms of which 3 ms to minimize.
[2024-05-21 21:54:55] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 4 ms to minimize.
[2024-05-21 21:54:55] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 3 ms to minimize.
[2024-05-21 21:54:56] [INFO ] Deduced a trap composed of 52 places in 315 ms of which 4 ms to minimize.
[2024-05-21 21:54:56] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 5 ms to minimize.
[2024-05-21 21:54:56] [INFO ] Deduced a trap composed of 42 places in 236 ms of which 3 ms to minimize.
[2024-05-21 21:54:57] [INFO ] Deduced a trap composed of 41 places in 282 ms of which 5 ms to minimize.
[2024-05-21 21:54:57] [INFO ] Deduced a trap composed of 39 places in 263 ms of which 4 ms to minimize.
[2024-05-21 21:54:57] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 3 ms to minimize.
[2024-05-21 21:54:58] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 3 ms to minimize.
[2024-05-21 21:54:58] [INFO ] Deduced a trap composed of 33 places in 246 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-05-21 21:54:58] [INFO ] Deduced a trap composed of 14 places in 229 ms of which 4 ms to minimize.
[2024-05-21 21:54:59] [INFO ] Deduced a trap composed of 31 places in 344 ms of which 4 ms to minimize.
[2024-05-21 21:54:59] [INFO ] Deduced a trap composed of 31 places in 285 ms of which 3 ms to minimize.
[2024-05-21 21:55:00] [INFO ] Deduced a trap composed of 23 places in 282 ms of which 4 ms to minimize.
[2024-05-21 21:55:00] [INFO ] Deduced a trap composed of 42 places in 238 ms of which 4 ms to minimize.
[2024-05-21 21:55:00] [INFO ] Deduced a trap composed of 46 places in 199 ms of which 4 ms to minimize.
[2024-05-21 21:55:00] [INFO ] Deduced a trap composed of 39 places in 230 ms of which 4 ms to minimize.
[2024-05-21 21:55:01] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
[2024-05-21 21:55:01] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 3 ms to minimize.
[2024-05-21 21:55:01] [INFO ] Deduced a trap composed of 37 places in 146 ms of which 2 ms to minimize.
[2024-05-21 21:55:01] [INFO ] Deduced a trap composed of 27 places in 268 ms of which 4 ms to minimize.
[2024-05-21 21:55:02] [INFO ] Deduced a trap composed of 35 places in 263 ms of which 3 ms to minimize.
[2024-05-21 21:55:02] [INFO ] Deduced a trap composed of 36 places in 258 ms of which 4 ms to minimize.
[2024-05-21 21:55:02] [INFO ] Deduced a trap composed of 58 places in 267 ms of which 3 ms to minimize.
[2024-05-21 21:55:03] [INFO ] Deduced a trap composed of 59 places in 279 ms of which 3 ms to minimize.
[2024-05-21 21:55:03] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 2 ms to minimize.
[2024-05-21 21:55:03] [INFO ] Deduced a trap composed of 43 places in 178 ms of which 2 ms to minimize.
[2024-05-21 21:55:04] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 2 ms to minimize.
[2024-05-21 21:55:04] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
[2024-05-21 21:55:04] [INFO ] Deduced a trap composed of 41 places in 196 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-05-21 21:55:08] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 3 ms to minimize.
[2024-05-21 21:55:09] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 3 ms to minimize.
[2024-05-21 21:55:10] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 3 ms to minimize.
[2024-05-21 21:55:10] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 3 ms to minimize.
[2024-05-21 21:55:10] [INFO ] Deduced a trap composed of 31 places in 224 ms of which 3 ms to minimize.
[2024-05-21 21:55:11] [INFO ] Deduced a trap composed of 41 places in 222 ms of which 3 ms to minimize.
[2024-05-21 21:55:11] [INFO ] Deduced a trap composed of 40 places in 181 ms of which 2 ms to minimize.
[2024-05-21 21:55:11] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-05-21 21:55:11] [INFO ] Deduced a trap composed of 47 places in 145 ms of which 3 ms to minimize.
[2024-05-21 21:55:12] [INFO ] Deduced a trap composed of 42 places in 177 ms of which 3 ms to minimize.
[2024-05-21 21:55:12] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 2 ms to minimize.
[2024-05-21 21:55:12] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 3 ms to minimize.
[2024-05-21 21:55:12] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 3 ms to minimize.
[2024-05-21 21:55:12] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2024-05-21 21:55:13] [INFO ] Deduced a trap composed of 43 places in 189 ms of which 3 ms to minimize.
[2024-05-21 21:55:13] [INFO ] Deduced a trap composed of 31 places in 201 ms of which 3 ms to minimize.
[2024-05-21 21:55:13] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2024-05-21 21:55:13] [INFO ] Deduced a trap composed of 42 places in 111 ms of which 1 ms to minimize.
[2024-05-21 21:55:14] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 3 ms to minimize.
[2024-05-21 21:55:14] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/687 variables, and 71 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/238 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-05-21 21:55:19] [INFO ] Deduced a trap composed of 24 places in 196 ms of which 3 ms to minimize.
[2024-05-21 21:55:19] [INFO ] Deduced a trap composed of 39 places in 184 ms of which 2 ms to minimize.
[2024-05-21 21:55:19] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 2 ms to minimize.
[2024-05-21 21:55:20] [INFO ] Deduced a trap composed of 43 places in 223 ms of which 3 ms to minimize.
[2024-05-21 21:55:20] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 3 ms to minimize.
[2024-05-21 21:55:20] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 3 ms to minimize.
[2024-05-21 21:55:20] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 2 ms to minimize.
[2024-05-21 21:55:21] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 2 ms to minimize.
[2024-05-21 21:55:21] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 2 ms to minimize.
[2024-05-21 21:55:22] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 2 ms to minimize.
[2024-05-21 21:55:22] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 2 ms to minimize.
[2024-05-21 21:55:22] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 2 ms to minimize.
[2024-05-21 21:55:22] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 2 ms to minimize.
[2024-05-21 21:55:23] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 2 ms to minimize.
[2024-05-21 21:55:23] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2024-05-21 21:55:23] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 3 ms to minimize.
[2024-05-21 21:55:24] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 17/88 constraints. Problems are: Problem set: 0 solved, 448 unsolved
[2024-05-21 21:55:27] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD375 is UNSAT
At refinement iteration 6 (OVERLAPS) 449/687 variables, 238/327 constraints. Problems are: Problem set: 2 solved, 446 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/687 variables, 446/773 constraints. Problems are: Problem set: 2 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 687/687 variables, and 773 constraints, problems are : Problem set: 2 solved, 446 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 446/448 constraints, Known Traps: 78/78 constraints]
After SMT, in 61181ms problems are : Problem set: 2 solved, 446 unsolved
Search for dead transitions found 2 dead transitions in 61192ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 238/250 places, 447/605 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 447
Applied a total of 1 rules in 6 ms. Remains 237 /238 variables (removed 1) and now considering 447/447 (removed 0) transitions.
// Phase 1: matrix 447 rows 237 cols
[2024-05-21 21:55:44] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 21:55:45] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-21 21:55:45] [INFO ] Invariant cache hit.
[2024-05-21 21:55:45] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 237/250 places, 447/605 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62410 ms. Remains : 237/250 places, 447/605 transitions.
[2024-05-21 21:55:45] [INFO ] Flatten gal took : 37 ms
[2024-05-21 21:55:45] [INFO ] Flatten gal took : 29 ms
[2024-05-21 21:55:45] [INFO ] Input system was already deterministic with 447 transitions.
[2024-05-21 21:55:45] [INFO ] Flatten gal took : 20 ms
[2024-05-21 21:55:45] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:55:45] [INFO ] Time to serialize gal into /tmp/CTLFireability8937944471508647133.gal : 6 ms
[2024-05-21 21:55:45] [INFO ] Time to serialize properties into /tmp/CTLFireability11511650741290193776.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8937944471508647133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11511650741290193776.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 21:56:15] [INFO ] Flatten gal took : 18 ms
[2024-05-21 21:56:15] [INFO ] Applying decomposition
[2024-05-21 21:56:15] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph991275394876008620.txt' '-o' '/tmp/graph991275394876008620.bin' '-w' '/tmp/graph991275394876008620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph991275394876008620.bin' '-l' '-1' '-v' '-w' '/tmp/graph991275394876008620.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:56:15] [INFO ] Decomposing Gal with order
[2024-05-21 21:56:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:56:16] [INFO ] Removed a total of 859 redundant transitions.
[2024-05-21 21:56:16] [INFO ] Flatten gal took : 44 ms
[2024-05-21 21:56:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 12 ms.
[2024-05-21 21:56:16] [INFO ] Time to serialize gal into /tmp/CTLFireability10581218371812876274.gal : 6 ms
[2024-05-21 21:56:16] [INFO ] Time to serialize properties into /tmp/CTLFireability3053347003955302715.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/CTLFireability10581218371812876274.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3053347003955302715.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07623e+12,0.365174,9976,676,112,11834,1722,606,14772,86,7861,0


Converting to forward existential form...Done !
original formula: ((EF(!(A(((AX((((u1.p6==1)&&(u1.p17==1))&&((i10.i1.u56.p175==1)&&(u1.p246==1)))) + (i12.i0.u66.p203==1)) + (((u1.p6==1)&&(u1.p18==1))&&((...1025
=> equivalent forward existential formula: ([(FwdU((FwdU(((Init * !((E(TRUE U !(!((E(!(!((((u1.p6==1)&&(u1.p17==1))&&((i5.i1.u22.p82==1)&&(u1.p246==1))))) ...4373
Reverse transition relation is NOT exact ! Due to transitions t222, t224, t226, t250, t274, t298, t340, t364, t444, i0.u72.t32, i0.u72.t35, i0.u72.t36, i0....834
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 234 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 247 transition count 504
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 136 rules applied. Total rules applied 235 place count 149 transition count 466
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 257 place count 127 transition count 466
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 257 place count 127 transition count 460
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 269 place count 121 transition count 460
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 280 place count 110 transition count 449
Iterating global reduction 3 with 11 rules applied. Total rules applied 291 place count 110 transition count 449
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 435 place count 110 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 435 place count 110 transition count 304
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 437 place count 109 transition count 304
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 440 place count 106 transition count 291
Iterating global reduction 4 with 3 rules applied. Total rules applied 443 place count 106 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 447 place count 106 transition count 287
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 449 place count 104 transition count 287
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 521 place count 68 transition count 251
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 530 place count 59 transition count 192
Iterating global reduction 6 with 9 rules applied. Total rules applied 539 place count 59 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 8 rules applied. Total rules applied 547 place count 59 transition count 184
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 551 place count 55 transition count 184
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 552 place count 55 transition count 183
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 553 place count 54 transition count 182
Applied a total of 553 rules in 112 ms. Remains 54 /250 variables (removed 196) and now considering 182/605 (removed 423) transitions.
// Phase 1: matrix 182 rows 54 cols
[2024-05-21 21:56:46] [INFO ] Computed 10 invariants in 2 ms
[2024-05-21 21:56:46] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-21 21:56:46] [INFO ] Invariant cache hit.
[2024-05-21 21:56:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:56:46] [INFO ] Implicit Places using invariants and state equation in 203 ms returned [47, 53]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 321 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 52/250 places, 182/605 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 0 with 1 rules applied. Total rules applied 1 place count 52 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 51 transition count 181
Applied a total of 2 rules in 23 ms. Remains 51 /52 variables (removed 1) and now considering 181/182 (removed 1) transitions.
// Phase 1: matrix 181 rows 51 cols
[2024-05-21 21:56:46] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 21:56:46] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-21 21:56:46] [INFO ] Invariant cache hit.
[2024-05-21 21:56:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:56:46] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 51/250 places, 181/605 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 768 ms. Remains : 51/250 places, 181/605 transitions.
[2024-05-21 21:56:46] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:56:46] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:56:46] [INFO ] Input system was already deterministic with 181 transitions.
[2024-05-21 21:56:47] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:56:47] [INFO ] Flatten gal took : 19 ms
[2024-05-21 21:56:47] [INFO ] Time to serialize gal into /tmp/CTLFireability5009575549817181599.gal : 4 ms
[2024-05-21 21:56:47] [INFO ] Time to serialize properties into /tmp/CTLFireability18097114660997281420.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/CTLFireability5009575549817181599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18097114660997281420.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.17509e+06,11.7159,218644,2,12123,5,533667,6,0,382,495373,0


Converting to forward existential form...Done !
original formula: EG(EF((((p6==0)||(p9==0))||((p117==0)||(p246==0)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((p6==0)||(p9==0))||((p117==0)||(p246==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t6, t8, t10, t12, t14, t16, t18, t20, t22, t24, t26, t28, t32, t34, t35, ...422
Detected timeout of ITS tools.
[2024-05-21 21:57:17] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:57:17] [INFO ] Applying decomposition
[2024-05-21 21:57:17] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17020002282941089885.txt' '-o' '/tmp/graph17020002282941089885.bin' '-w' '/tmp/graph17020002282941089885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17020002282941089885.bin' '-l' '-1' '-v' '-w' '/tmp/graph17020002282941089885.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:57:17] [INFO ] Decomposing Gal with order
[2024-05-21 21:57:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:57:17] [INFO ] Removed a total of 662 redundant transitions.
[2024-05-21 21:57:17] [INFO ] Flatten gal took : 32 ms
[2024-05-21 21:57:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 6 ms.
[2024-05-21 21:57:17] [INFO ] Time to serialize gal into /tmp/CTLFireability11590710662518786190.gal : 1 ms
[2024-05-21 21:57:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12588309812259913433.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/CTLFireability11590710662518786190.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12588309812259913433.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.17509e+06,0.023224,3980,105,39,949,213,148,1809,58,551,0


Converting to forward existential form...Done !
original formula: EG(EF((((i7.u0.p6==0)||(i7.u1.p9==0))||((i2.u6.p117==0)||(i7.u15.p246==0)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (((i7.u0.p6==0)||(i7.u1.p9==0))||((i2.u6.p117==0)||(i7.u15.p246==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t5, t35, t124, i0.u2.t28, i0.u3.t26, i1.u4.t24, i1.u5.t22, i2.u6.t20, i2.u6.t130, i2.u7.t18, ...388
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 7
(forward)formula 0,1,0.082656,6088,1,0,5300,561,888,8723,291,2034,9693
FORMULA AutonomousCar-PT-06b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 236 transition count 591
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 236 transition count 591
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 172 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 173 place count 235 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 235 transition count 446
Applied a total of 174 rules in 23 ms. Remains 235 /250 variables (removed 15) and now considering 446/605 (removed 159) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-05-21 21:57:17] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 21:57:17] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-21 21:57:17] [INFO ] Invariant cache hit.
[2024-05-21 21:57:18] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-21 21:57:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 21:57:25] [INFO ] Deduced a trap composed of 21 places in 293 ms of which 5 ms to minimize.
[2024-05-21 21:57:25] [INFO ] Deduced a trap composed of 55 places in 287 ms of which 4 ms to minimize.
[2024-05-21 21:57:26] [INFO ] Deduced a trap composed of 17 places in 269 ms of which 4 ms to minimize.
[2024-05-21 21:57:26] [INFO ] Deduced a trap composed of 53 places in 263 ms of which 3 ms to minimize.
[2024-05-21 21:57:26] [INFO ] Deduced a trap composed of 43 places in 261 ms of which 3 ms to minimize.
[2024-05-21 21:57:26] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-21 21:57:27] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 4 ms to minimize.
[2024-05-21 21:57:27] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 3 ms to minimize.
[2024-05-21 21:57:27] [INFO ] Deduced a trap composed of 30 places in 239 ms of which 3 ms to minimize.
[2024-05-21 21:57:28] [INFO ] Deduced a trap composed of 23 places in 249 ms of which 3 ms to minimize.
[2024-05-21 21:57:28] [INFO ] Deduced a trap composed of 44 places in 256 ms of which 4 ms to minimize.
[2024-05-21 21:57:28] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 3 ms to minimize.
[2024-05-21 21:57:28] [INFO ] Deduced a trap composed of 33 places in 313 ms of which 6 ms to minimize.
[2024-05-21 21:57:29] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 2 ms to minimize.
[2024-05-21 21:57:29] [INFO ] Deduced a trap composed of 27 places in 290 ms of which 4 ms to minimize.
[2024-05-21 21:57:29] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 2 ms to minimize.
[2024-05-21 21:57:29] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 2 ms to minimize.
[2024-05-21 21:57:30] [INFO ] Deduced a trap composed of 37 places in 279 ms of which 4 ms to minimize.
[2024-05-21 21:57:30] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 3 ms to minimize.
[2024-05-21 21:57:30] [INFO ] Deduced a trap composed of 44 places in 240 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 21:57:31] [INFO ] Deduced a trap composed of 14 places in 246 ms of which 4 ms to minimize.
[2024-05-21 21:57:31] [INFO ] Deduced a trap composed of 47 places in 249 ms of which 4 ms to minimize.
[2024-05-21 21:57:32] [INFO ] Deduced a trap composed of 24 places in 328 ms of which 2 ms to minimize.
[2024-05-21 21:57:32] [INFO ] Deduced a trap composed of 32 places in 239 ms of which 3 ms to minimize.
[2024-05-21 21:57:32] [INFO ] Deduced a trap composed of 18 places in 232 ms of which 5 ms to minimize.
[2024-05-21 21:57:32] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 3 ms to minimize.
[2024-05-21 21:57:33] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 3 ms to minimize.
[2024-05-21 21:57:33] [INFO ] Deduced a trap composed of 32 places in 191 ms of which 3 ms to minimize.
[2024-05-21 21:57:33] [INFO ] Deduced a trap composed of 57 places in 234 ms of which 2 ms to minimize.
[2024-05-21 21:57:34] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 2 ms to minimize.
[2024-05-21 21:57:34] [INFO ] Deduced a trap composed of 41 places in 140 ms of which 2 ms to minimize.
[2024-05-21 21:57:34] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 3 ms to minimize.
[2024-05-21 21:57:34] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 3 ms to minimize.
[2024-05-21 21:57:35] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 3 ms to minimize.
[2024-05-21 21:57:35] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 3 ms to minimize.
[2024-05-21 21:57:35] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 2 ms to minimize.
[2024-05-21 21:57:35] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 3 ms to minimize.
[2024-05-21 21:57:36] [INFO ] Deduced a trap composed of 44 places in 175 ms of which 3 ms to minimize.
[2024-05-21 21:57:36] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 3 ms to minimize.
[2024-05-21 21:57:36] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 21:57:40] [INFO ] Deduced a trap composed of 40 places in 273 ms of which 4 ms to minimize.
[2024-05-21 21:57:40] [INFO ] Deduced a trap composed of 21 places in 272 ms of which 5 ms to minimize.
[2024-05-21 21:57:40] [INFO ] Deduced a trap composed of 32 places in 272 ms of which 4 ms to minimize.
[2024-05-21 21:57:41] [INFO ] Deduced a trap composed of 44 places in 173 ms of which 2 ms to minimize.
[2024-05-21 21:57:42] [INFO ] Deduced a trap composed of 42 places in 188 ms of which 3 ms to minimize.
[2024-05-21 21:57:42] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 2 ms to minimize.
[2024-05-21 21:57:42] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 2 ms to minimize.
[2024-05-21 21:57:43] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 3 ms to minimize.
[2024-05-21 21:57:43] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 2 ms to minimize.
[2024-05-21 21:57:43] [INFO ] Deduced a trap composed of 43 places in 196 ms of which 3 ms to minimize.
[2024-05-21 21:57:43] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 4 ms to minimize.
[2024-05-21 21:57:44] [INFO ] Deduced a trap composed of 15 places in 270 ms of which 3 ms to minimize.
[2024-05-21 21:57:44] [INFO ] Deduced a trap composed of 23 places in 265 ms of which 3 ms to minimize.
[2024-05-21 21:57:44] [INFO ] Deduced a trap composed of 22 places in 255 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/681 variables, and 65 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 21:57:52] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 2 ms to minimize.
[2024-05-21 21:57:53] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 3 ms to minimize.
[2024-05-21 21:57:53] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:57:53] [INFO ] Deduced a trap composed of 32 places in 149 ms of which 3 ms to minimize.
[2024-05-21 21:57:53] [INFO ] Deduced a trap composed of 31 places in 139 ms of which 2 ms to minimize.
[2024-05-21 21:57:53] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:57:53] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 2 ms to minimize.
[2024-05-21 21:57:54] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-05-21 21:57:54] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2024-05-21 21:57:54] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-05-21 21:57:54] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-21 21:57:54] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 2 ms to minimize.
[2024-05-21 21:57:54] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-05-21 21:57:55] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 2 ms to minimize.
[2024-05-21 21:57:55] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 21:57:57] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 2 ms to minimize.
[2024-05-21 21:57:57] [INFO ] Deduced a trap composed of 35 places in 158 ms of which 2 ms to minimize.
[2024-05-21 21:57:57] [INFO ] Deduced a trap composed of 37 places in 147 ms of which 2 ms to minimize.
[2024-05-21 21:57:57] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2024-05-21 21:57:58] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 2 ms to minimize.
[2024-05-21 21:57:58] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2024-05-21 21:57:59] [INFO ] Deduced a trap composed of 19 places in 151 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 21:58:01] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 3 ms to minimize.
[2024-05-21 21:58:02] [INFO ] Deduced a trap composed of 33 places in 212 ms of which 3 ms to minimize.
[2024-05-21 21:58:02] [INFO ] Deduced a trap composed of 35 places in 203 ms of which 3 ms to minimize.
[2024-05-21 21:58:02] [INFO ] Deduced a trap composed of 31 places in 130 ms of which 2 ms to minimize.
[2024-05-21 21:58:02] [INFO ] Deduced a trap composed of 51 places in 155 ms of which 2 ms to minimize.
[2024-05-21 21:58:03] [INFO ] Deduced a trap composed of 32 places in 200 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 21:58:07] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
[2024-05-21 21:58:07] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 1 ms to minimize.
[2024-05-21 21:58:07] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2024-05-21 21:58:08] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/235 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 8 (OVERLAPS) 446/681 variables, 235/332 constraints. Problems are: Problem set: 2 solved, 443 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 443/775 constraints. Problems are: Problem set: 2 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 681/681 variables, and 775 constraints, problems are : Problem set: 2 solved, 443 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 443/445 constraints, Known Traps: 86/86 constraints]
After SMT, in 61031ms problems are : Problem set: 2 solved, 443 unsolved
Search for dead transitions found 2 dead transitions in 61038ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 444/605 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 444
Applied a total of 1 rules in 6 ms. Remains 234 /235 variables (removed 1) and now considering 444/444 (removed 0) transitions.
// Phase 1: matrix 444 rows 234 cols
[2024-05-21 21:58:19] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 21:58:19] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-21 21:58:19] [INFO ] Invariant cache hit.
[2024-05-21 21:58:19] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 234/250 places, 444/605 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62124 ms. Remains : 234/250 places, 444/605 transitions.
[2024-05-21 21:58:19] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:58:19] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:58:19] [INFO ] Input system was already deterministic with 444 transitions.
[2024-05-21 21:58:19] [INFO ] Flatten gal took : 22 ms
[2024-05-21 21:58:19] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:58:19] [INFO ] Time to serialize gal into /tmp/CTLFireability289732709628349398.gal : 6 ms
[2024-05-21 21:58:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17448194051948221265.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/CTLFireability289732709628349398.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17448194051948221265.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 21:58:49] [INFO ] Flatten gal took : 13 ms
[2024-05-21 21:58:49] [INFO ] Applying decomposition
[2024-05-21 21:58:49] [INFO ] Flatten gal took : 14 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/graph10013705372906621995.txt' '-o' '/tmp/graph10013705372906621995.bin' '-w' '/tmp/graph10013705372906621995.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10013705372906621995.bin' '-l' '-1' '-v' '-w' '/tmp/graph10013705372906621995.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:58:49] [INFO ] Decomposing Gal with order
[2024-05-21 21:58:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:58:49] [INFO ] Removed a total of 850 redundant transitions.
[2024-05-21 21:58:49] [INFO ] Flatten gal took : 38 ms
[2024-05-21 21:58:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 6 ms.
[2024-05-21 21:58:49] [INFO ] Time to serialize gal into /tmp/CTLFireability13555243177921469091.gal : 4 ms
[2024-05-21 21:58:49] [INFO ] Time to serialize properties into /tmp/CTLFireability7442716788895851152.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/CTLFireability13555243177921469091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7442716788895851152.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03205e+12,25.291,786840,5196,113,413786,1111,565,9.30541e+06,89,4630,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 216 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 247 transition count 505
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 135 rules applied. Total rules applied 233 place count 150 transition count 467
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 255 place count 128 transition count 467
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 255 place count 128 transition count 461
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 267 place count 122 transition count 461
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 278 place count 111 transition count 450
Iterating global reduction 3 with 11 rules applied. Total rules applied 289 place count 111 transition count 450
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 433 place count 111 transition count 306
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 435 place count 109 transition count 299
Iterating global reduction 4 with 2 rules applied. Total rules applied 437 place count 109 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 439 place count 109 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 440 place count 108 transition count 297
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 500 place count 78 transition count 267
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 506 place count 72 transition count 228
Iterating global reduction 6 with 6 rules applied. Total rules applied 512 place count 72 transition count 228
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 6 rules applied. Total rules applied 518 place count 72 transition count 222
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 521 place count 69 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 522 place count 69 transition count 221
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 524 place count 69 transition count 221
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 526 place count 67 transition count 219
Applied a total of 526 rules in 85 ms. Remains 67 /250 variables (removed 183) and now considering 219/605 (removed 386) transitions.
// Phase 1: matrix 219 rows 67 cols
[2024-05-21 21:59:20] [INFO ] Computed 10 invariants in 3 ms
[2024-05-21 21:59:20] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-21 21:59:20] [INFO ] Invariant cache hit.
[2024-05-21 21:59:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:59:20] [INFO ] Implicit Places using invariants and state equation in 150 ms returned [60, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 244 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 65/250 places, 219/605 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 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 64 transition count 218
Applied a total of 2 rules in 19 ms. Remains 64 /65 variables (removed 1) and now considering 218/219 (removed 1) transitions.
// Phase 1: matrix 218 rows 64 cols
[2024-05-21 21:59:20] [INFO ] Computed 8 invariants in 2 ms
[2024-05-21 21:59:20] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-21 21:59:20] [INFO ] Invariant cache hit.
[2024-05-21 21:59:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 21:59:20] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 64/250 places, 218/605 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 599 ms. Remains : 64/250 places, 218/605 transitions.
[2024-05-21 21:59:20] [INFO ] Flatten gal took : 36 ms
[2024-05-21 21:59:20] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:59:20] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-21 21:59:20] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:59:20] [INFO ] Flatten gal took : 21 ms
[2024-05-21 21:59:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4003255139870489186.gal : 6 ms
[2024-05-21 21:59:20] [INFO ] Time to serialize properties into /tmp/CTLFireability4840067796973253069.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/CTLFireability4003255139870489186.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4840067796973253069.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.89942e+07,24.721,514184,2,22670,5,2.1659e+06,6,0,471,1.71027e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 21:59:50] [INFO ] Flatten gal took : 17 ms
[2024-05-21 21:59:50] [INFO ] Applying decomposition
[2024-05-21 21:59:50] [INFO ] Flatten gal took : 13 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/graph16291625327474271988.txt' '-o' '/tmp/graph16291625327474271988.bin' '-w' '/tmp/graph16291625327474271988.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16291625327474271988.bin' '-l' '-1' '-v' '-w' '/tmp/graph16291625327474271988.weights' '-q' '0' '-e' '0.001'
[2024-05-21 21:59:50] [INFO ] Decomposing Gal with order
[2024-05-21 21:59:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 21:59:50] [INFO ] Removed a total of 675 redundant transitions.
[2024-05-21 21:59:50] [INFO ] Flatten gal took : 23 ms
[2024-05-21 21:59:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 4 ms.
[2024-05-21 21:59:50] [INFO ] Time to serialize gal into /tmp/CTLFireability7234483389728926581.gal : 2 ms
[2024-05-21 21:59:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17704951288080778418.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/CTLFireability7234483389728926581.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17704951288080778418.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.89942e+07,1.75505,52492,926,141,60634,3962,254,385314,74,24488,0


Converting to forward existential form...Done !
original formula: (EF((((u0.p6==1)&&(u0.p16==1))&&((i6.u16.p206==1)&&(u0.p246==1)))) * E((EG(!((((u0.p6==1)&&(u0.p18==1))&&((i3.u2.p51==1)&&(u0.p246==1))))...309
=> equivalent forward existential formula: [(FwdU((Init * E(TRUE U (((u0.p6==1)&&(u0.p16==1))&&((i6.u16.p206==1)&&(u0.p246==1))))),(EG(!((((u0.p6==1)&&(u0....361
Reverse transition relation is NOT exact ! Due to transitions t5, t41, t57, t63, t69, t93, t125, t144, t150, t174, t192, t198, i2.u3.t36, i2.u6.t30, i2.u7....480
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 236 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 247 transition count 504
Reduce places removed 98 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 134 rules applied. Total rules applied 233 place count 149 transition count 468
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 254 place count 128 transition count 468
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 254 place count 128 transition count 463
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 264 place count 123 transition count 463
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 274 place count 113 transition count 453
Iterating global reduction 3 with 10 rules applied. Total rules applied 284 place count 113 transition count 453
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 428 place count 113 transition count 309
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 428 place count 113 transition count 307
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 432 place count 111 transition count 307
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 435 place count 108 transition count 294
Iterating global reduction 4 with 3 rules applied. Total rules applied 438 place count 108 transition count 294
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 442 place count 108 transition count 290
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 444 place count 106 transition count 290
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 520 place count 68 transition count 252
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 530 place count 58 transition count 186
Iterating global reduction 6 with 10 rules applied. Total rules applied 540 place count 58 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 6 with 8 rules applied. Total rules applied 548 place count 58 transition count 178
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 552 place count 54 transition count 178
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 553 place count 54 transition count 177
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 555 place count 52 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 556 place count 51 transition count 175
Applied a total of 556 rules in 57 ms. Remains 51 /250 variables (removed 199) and now considering 175/605 (removed 430) transitions.
// Phase 1: matrix 175 rows 51 cols
[2024-05-21 22:00:21] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 22:00:21] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 22:00:21] [INFO ] Invariant cache hit.
[2024-05-21 22:00:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:00:21] [INFO ] Implicit Places using invariants and state equation in 130 ms returned [44, 50]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 216 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 49/250 places, 175/605 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 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 48 transition count 174
Applied a total of 2 rules in 8 ms. Remains 48 /49 variables (removed 1) and now considering 174/175 (removed 1) transitions.
// Phase 1: matrix 174 rows 48 cols
[2024-05-21 22:00:21] [INFO ] Computed 7 invariants in 1 ms
[2024-05-21 22:00:21] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 22:00:21] [INFO ] Invariant cache hit.
[2024-05-21 22:00:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:00:21] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/250 places, 174/605 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 513 ms. Remains : 48/250 places, 174/605 transitions.
[2024-05-21 22:00:21] [INFO ] Flatten gal took : 14 ms
[2024-05-21 22:00:21] [INFO ] Flatten gal took : 14 ms
[2024-05-21 22:00:21] [INFO ] Input system was already deterministic with 174 transitions.
RANDOM walk for 148 steps (7 resets) in 6 ms. (21 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-06b-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 22:00:21] [INFO ] Flatten gal took : 15 ms
[2024-05-21 22:00:21] [INFO ] Flatten gal took : 15 ms
[2024-05-21 22:00:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10720574946074736203.gal : 3 ms
[2024-05-21 22:00:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5138011973983994722.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/ReachabilityCardinality10720574946074736203.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5138011973983994722.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, 605/605 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 236 transition count 591
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 236 transition count 591
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 172 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 173 place count 235 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 235 transition count 446
Applied a total of 174 rules in 14 ms. Remains 235 /250 variables (removed 15) and now considering 446/605 (removed 159) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-05-21 22:00:21] [INFO ] Computed 11 invariants in 5 ms
[2024-05-21 22:00:21] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 22:00:21] [INFO ] Invariant cache hit.
[2024-05-21 22:00:22] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-21 22:00:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:00:30] [INFO ] Deduced a trap composed of 21 places in 343 ms of which 4 ms to minimize.
[2024-05-21 22:00:31] [INFO ] Deduced a trap composed of 55 places in 253 ms of which 3 ms to minimize.
[2024-05-21 22:00:31] [INFO ] Deduced a trap composed of 17 places in 232 ms of which 2 ms to minimize.
[2024-05-21 22:00:31] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 3 ms to minimize.
[2024-05-21 22:00:31] [INFO ] Deduced a trap composed of 43 places in 256 ms of which 3 ms to minimize.
[2024-05-21 22:00:32] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 1 ms to minimize.
[2024-05-21 22:00:32] [INFO ] Deduced a trap composed of 38 places in 276 ms of which 3 ms to minimize.
[2024-05-21 22:00:32] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 4 ms to minimize.
[2024-05-21 22:00:33] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 4 ms to minimize.
[2024-05-21 22:00:33] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 3 ms to minimize.
[2024-05-21 22:00:33] [INFO ] Deduced a trap composed of 44 places in 296 ms of which 3 ms to minimize.
[2024-05-21 22:00:33] [INFO ] Deduced a trap composed of 44 places in 285 ms of which 3 ms to minimize.
[2024-05-21 22:00:34] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 4 ms to minimize.
[2024-05-21 22:00:34] [INFO ] Deduced a trap composed of 42 places in 313 ms of which 4 ms to minimize.
[2024-05-21 22:00:34] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 3 ms to minimize.
[2024-05-21 22:00:35] [INFO ] Deduced a trap composed of 34 places in 276 ms of which 3 ms to minimize.
[2024-05-21 22:00:35] [INFO ] Deduced a trap composed of 39 places in 277 ms of which 3 ms to minimize.
[2024-05-21 22:00:35] [INFO ] Deduced a trap composed of 37 places in 456 ms of which 3 ms to minimize.
[2024-05-21 22:00:36] [INFO ] Deduced a trap composed of 39 places in 284 ms of which 3 ms to minimize.
[2024-05-21 22:00:36] [INFO ] Deduced a trap composed of 44 places in 304 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:00:36] [INFO ] Deduced a trap composed of 14 places in 287 ms of which 4 ms to minimize.
[2024-05-21 22:00:37] [INFO ] Deduced a trap composed of 47 places in 295 ms of which 4 ms to minimize.
[2024-05-21 22:00:37] [INFO ] Deduced a trap composed of 24 places in 308 ms of which 3 ms to minimize.
[2024-05-21 22:00:38] [INFO ] Deduced a trap composed of 32 places in 292 ms of which 3 ms to minimize.
[2024-05-21 22:00:38] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 4 ms to minimize.
[2024-05-21 22:00:38] [INFO ] Deduced a trap composed of 31 places in 237 ms of which 4 ms to minimize.
[2024-05-21 22:00:39] [INFO ] Deduced a trap composed of 31 places in 232 ms of which 4 ms to minimize.
[2024-05-21 22:00:39] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 4 ms to minimize.
[2024-05-21 22:00:39] [INFO ] Deduced a trap composed of 57 places in 324 ms of which 4 ms to minimize.
[2024-05-21 22:00:40] [INFO ] Deduced a trap composed of 43 places in 173 ms of which 3 ms to minimize.
[2024-05-21 22:00:40] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 2 ms to minimize.
[2024-05-21 22:00:40] [INFO ] Deduced a trap composed of 40 places in 267 ms of which 4 ms to minimize.
[2024-05-21 22:00:40] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 3 ms to minimize.
[2024-05-21 22:00:41] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 3 ms to minimize.
[2024-05-21 22:00:41] [INFO ] Deduced a trap composed of 43 places in 159 ms of which 2 ms to minimize.
[2024-05-21 22:00:41] [INFO ] Deduced a trap composed of 42 places in 146 ms of which 2 ms to minimize.
[2024-05-21 22:00:41] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 4 ms to minimize.
[2024-05-21 22:00:42] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 3 ms to minimize.
[2024-05-21 22:00:42] [INFO ] Deduced a trap composed of 41 places in 183 ms of which 3 ms to minimize.
[2024-05-21 22:00:42] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:00:46] [INFO ] Deduced a trap composed of 40 places in 290 ms of which 4 ms to minimize.
[2024-05-21 22:00:46] [INFO ] Deduced a trap composed of 21 places in 279 ms of which 3 ms to minimize.
[2024-05-21 22:00:46] [INFO ] Deduced a trap composed of 32 places in 270 ms of which 4 ms to minimize.
[2024-05-21 22:00:47] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 2 ms to minimize.
[2024-05-21 22:00:48] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 3 ms to minimize.
[2024-05-21 22:00:48] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 2 ms to minimize.
[2024-05-21 22:00:48] [INFO ] Deduced a trap composed of 44 places in 138 ms of which 3 ms to minimize.
[2024-05-21 22:00:49] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 2 ms to minimize.
[2024-05-21 22:00:49] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 3 ms to minimize.
[2024-05-21 22:00:49] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 3 ms to minimize.
[2024-05-21 22:00:49] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 2 ms to minimize.
[2024-05-21 22:00:50] [INFO ] Deduced a trap composed of 15 places in 268 ms of which 3 ms to minimize.
[2024-05-21 22:00:50] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 3 ms to minimize.
[2024-05-21 22:00:51] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/681 variables, and 65 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:00:58] [INFO ] Deduced a trap composed of 31 places in 245 ms of which 4 ms to minimize.
[2024-05-21 22:00:59] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 3 ms to minimize.
[2024-05-21 22:00:59] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 3 ms to minimize.
[2024-05-21 22:00:59] [INFO ] Deduced a trap composed of 32 places in 249 ms of which 4 ms to minimize.
[2024-05-21 22:01:00] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 3 ms to minimize.
[2024-05-21 22:01:00] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-05-21 22:01:00] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 3 ms to minimize.
[2024-05-21 22:01:00] [INFO ] Deduced a trap composed of 37 places in 230 ms of which 4 ms to minimize.
[2024-05-21 22:01:01] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 3 ms to minimize.
[2024-05-21 22:01:01] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 3 ms to minimize.
[2024-05-21 22:01:01] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 2 ms to minimize.
[2024-05-21 22:01:01] [INFO ] Deduced a trap composed of 31 places in 143 ms of which 3 ms to minimize.
[2024-05-21 22:01:02] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 2 ms to minimize.
[2024-05-21 22:01:02] [INFO ] Deduced a trap composed of 32 places in 268 ms of which 4 ms to minimize.
[2024-05-21 22:01:03] [INFO ] Deduced a trap composed of 5 places in 200 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:01:06] [INFO ] Deduced a trap composed of 41 places in 283 ms of which 4 ms to minimize.
[2024-05-21 22:01:06] [INFO ] Deduced a trap composed of 35 places in 287 ms of which 4 ms to minimize.
[2024-05-21 22:01:07] [INFO ] Deduced a trap composed of 37 places in 267 ms of which 4 ms to minimize.
[2024-05-21 22:01:07] [INFO ] Deduced a trap composed of 41 places in 248 ms of which 4 ms to minimize.
[2024-05-21 22:01:07] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 3 ms to minimize.
[2024-05-21 22:01:07] [INFO ] Deduced a trap composed of 38 places in 243 ms of which 3 ms to minimize.
[2024-05-21 22:01:10] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:01:13] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 3 ms to minimize.
[2024-05-21 22:01:14] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 3 ms to minimize.
[2024-05-21 22:01:14] [INFO ] Deduced a trap composed of 35 places in 228 ms of which 3 ms to minimize.
[2024-05-21 22:01:15] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 3 ms to minimize.
[2024-05-21 22:01:15] [INFO ] Deduced a trap composed of 51 places in 256 ms of which 4 ms to minimize.
[2024-05-21 22:01:15] [INFO ] Deduced a trap composed of 32 places in 261 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:01:20] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 2 ms to minimize.
[2024-05-21 22:01:21] [INFO ] Deduced a trap composed of 52 places in 171 ms of which 2 ms to minimize.
[2024-05-21 22:01:21] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 3 ms to minimize.
[2024-05-21 22:01:22] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/681 variables, and 97 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 0/445 constraints, Known Traps: 86/86 constraints]
After SMT, in 61134ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 61142ms
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 446/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61769 ms. Remains : 235/250 places, 446/605 transitions.
[2024-05-21 22:01:23] [INFO ] Flatten gal took : 22 ms
[2024-05-21 22:01:23] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:01:23] [INFO ] Input system was already deterministic with 446 transitions.
[2024-05-21 22:01:23] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:01:23] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:01:23] [INFO ] Time to serialize gal into /tmp/CTLFireability6756073423511660852.gal : 6 ms
[2024-05-21 22:01:23] [INFO ] Time to serialize properties into /tmp/CTLFireability5150968440520669643.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/CTLFireability6756073423511660852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5150968440520669643.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 22:01:53] [INFO ] Flatten gal took : 14 ms
[2024-05-21 22:01:53] [INFO ] Applying decomposition
[2024-05-21 22:01:53] [INFO ] Flatten gal took : 13 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/graph16618332047969227909.txt' '-o' '/tmp/graph16618332047969227909.bin' '-w' '/tmp/graph16618332047969227909.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16618332047969227909.bin' '-l' '-1' '-v' '-w' '/tmp/graph16618332047969227909.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:01:53] [INFO ] Decomposing Gal with order
[2024-05-21 22:01:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:01:53] [INFO ] Removed a total of 852 redundant transitions.
[2024-05-21 22:01:53] [INFO ] Flatten gal took : 34 ms
[2024-05-21 22:01:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 9 ms.
[2024-05-21 22:01:53] [INFO ] Time to serialize gal into /tmp/CTLFireability7351115139613519181.gal : 4 ms
[2024-05-21 22:01:53] [INFO ] Time to serialize properties into /tmp/CTLFireability3107037786210753475.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/CTLFireability7351115139613519181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3107037786210753475.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.03205e+12,0.32291,12080,906,115,16225,1581,614,25140,88,8177,0


Converting to forward existential form...Done !
original formula: EG(E(!((AX((i9.i1.u46.p154==1)) * E((((u2.p6==1)&&(u2.p16==1))&&((i4.u16.p55==1)&&(u2.p246==1))) U (((u2.p6==1)&&(u2.p15==1))&&((i8.u43.p...206
=> equivalent forward existential formula: [FwdG(Init,E(!((!(EX(!((i9.i1.u46.p154==1)))) * E((((u2.p6==1)&&(u2.p16==1))&&((i4.u16.p55==1)&&(u2.p246==1))) U...255
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t224, t248, t278, t296, t338, t362, t443, i1.u72.t33, i1.u72.t36, i1.u72.t37, i1....831
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 217 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 0 with 95 rules applied. Total rules applied 96 place count 247 transition count 507
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 130 rules applied. Total rules applied 226 place count 152 transition count 472
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 247 place count 132 transition count 471
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 3 with 3 rules applied. Total rules applied 250 place count 131 transition count 469
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 251 place count 130 transition count 469
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 251 place count 130 transition count 464
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 261 place count 125 transition count 464
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 271 place count 115 transition count 454
Iterating global reduction 5 with 10 rules applied. Total rules applied 281 place count 115 transition count 454
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 5 with 144 rules applied. Total rules applied 425 place count 115 transition count 310
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 425 place count 115 transition count 309
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 427 place count 114 transition count 309
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 430 place count 111 transition count 296
Iterating global reduction 6 with 3 rules applied. Total rules applied 433 place count 111 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 4 rules applied. Total rules applied 437 place count 111 transition count 292
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 439 place count 109 transition count 292
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 8 with 64 rules applied. Total rules applied 503 place count 77 transition count 260
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 510 place count 70 transition count 215
Iterating global reduction 8 with 7 rules applied. Total rules applied 517 place count 70 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 6 rules applied. Total rules applied 523 place count 70 transition count 209
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 526 place count 67 transition count 209
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 527 place count 67 transition count 208
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 529 place count 65 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 530 place count 64 transition count 206
Applied a total of 530 rules in 64 ms. Remains 64 /250 variables (removed 186) and now considering 206/605 (removed 399) transitions.
// Phase 1: matrix 206 rows 64 cols
[2024-05-21 22:02:23] [INFO ] Computed 9 invariants in 1 ms
[2024-05-21 22:02:24] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-21 22:02:24] [INFO ] Invariant cache hit.
[2024-05-21 22:02:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:02:24] [INFO ] Implicit Places using invariants and state equation in 204 ms returned [57, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 290 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 62/250 places, 206/605 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 0 with 1 rules applied. Total rules applied 1 place count 62 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 61 transition count 205
Applied a total of 2 rules in 12 ms. Remains 61 /62 variables (removed 1) and now considering 205/206 (removed 1) transitions.
// Phase 1: matrix 205 rows 61 cols
[2024-05-21 22:02:24] [INFO ] Computed 7 invariants in 2 ms
[2024-05-21 22:02:24] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 22:02:24] [INFO ] Invariant cache hit.
[2024-05-21 22:02:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:02:24] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 61/250 places, 205/605 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 630 ms. Remains : 61/250 places, 205/605 transitions.
[2024-05-21 22:02:24] [INFO ] Flatten gal took : 16 ms
[2024-05-21 22:02:24] [INFO ] Flatten gal took : 16 ms
[2024-05-21 22:02:24] [INFO ] Input system was already deterministic with 205 transitions.
[2024-05-21 22:02:24] [INFO ] Flatten gal took : 16 ms
[2024-05-21 22:02:24] [INFO ] Flatten gal took : 17 ms
[2024-05-21 22:02:24] [INFO ] Time to serialize gal into /tmp/CTLFireability11058068135967957727.gal : 3 ms
[2024-05-21 22:02:24] [INFO ] Time to serialize properties into /tmp/CTLFireability17960378669728877396.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/CTLFireability11058068135967957727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17960378669728877396.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27203e+07,22.9398,477972,2,19617,5,1.93277e+06,6,0,446,1.58086e+06,0


Converting to forward existential form...Done !
original formula: AF(((p249==1) * EG(!(A(!(((((p56==1)&&(p93==1))&&((p124==1)&&(p149==1)))&&(((p180==1)&&(p217==1))&&(p247==1)))) U AF((p107==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!(((p249==1) * EG(!(!((E(!(!(EG(!((p107==1))))) U (!(!(((((p56==1)&&(p93==1))&&((p124==1)&&(p149==1))...268
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t5, t6, t7, t9, t11, t13, t15, t16, t19, t21, t22, t25, t27, t31, t33, t35, t37, ...750
Detected timeout of ITS tools.
[2024-05-21 22:02:54] [INFO ] Flatten gal took : 11 ms
[2024-05-21 22:02:54] [INFO ] Applying decomposition
[2024-05-21 22:02:54] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1356006070253965295.txt' '-o' '/tmp/graph1356006070253965295.bin' '-w' '/tmp/graph1356006070253965295.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1356006070253965295.bin' '-l' '-1' '-v' '-w' '/tmp/graph1356006070253965295.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:02:54] [INFO ] Decomposing Gal with order
[2024-05-21 22:02:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:02:54] [INFO ] Removed a total of 648 redundant transitions.
[2024-05-21 22:02:54] [INFO ] Flatten gal took : 18 ms
[2024-05-21 22:02:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2024-05-21 22:02:54] [INFO ] Time to serialize gal into /tmp/CTLFireability14579181251336374374.gal : 1 ms
[2024-05-21 22:02:54] [INFO ] Time to serialize properties into /tmp/CTLFireability2340051198929464473.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/CTLFireability14579181251336374374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2340051198929464473.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.27203e+07,0.133431,7656,399,91,8001,1123,230,10316,66,5756,0


Converting to forward existential form...Done !
original formula: AF(((i9.u17.p249==1) * EG(!(A(!(((((i0.u1.p56==1)&&(i1.u4.p93==1))&&((i2.u8.p124==1)&&(i4.u10.p149==1)))&&(((i6.u12.p180==1)&&(i8.u16.p21...208
=> equivalent forward existential formula: [FwdG(Init,!(((i9.u17.p249==1) * EG(!(!((E(!(!(EG(!((i2.u6.p107==1))))) U (!(!(((((i0.u1.p56==1)&&(i1.u4.p93==1)...338
Reverse transition relation is NOT exact ! Due to transitions t7, t62, t66, t94, t98, t119, t125, t131, t143, t149, t167, t173, t179, t185, t191, t197, u7....508
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 10
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 10
(forward)formula 0,1,3.87158,142296,1,0,315799,1624,1755,403414,343,8093,452729
FORMULA AutonomousCar-PT-06b-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 593
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 593
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 238 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 237 transition count 448
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 237 transition count 448
Applied a total of 170 rules in 9 ms. Remains 237 /250 variables (removed 13) and now considering 448/605 (removed 157) transitions.
// Phase 1: matrix 448 rows 237 cols
[2024-05-21 22:02:58] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 22:02:58] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-21 22:02:58] [INFO ] Invariant cache hit.
[2024-05-21 22:02:59] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Running 447 sub problems to find dead transitions.
[2024-05-21 22:02:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 22:03:07] [INFO ] Deduced a trap composed of 18 places in 329 ms of which 5 ms to minimize.
[2024-05-21 22:03:08] [INFO ] Deduced a trap composed of 51 places in 300 ms of which 4 ms to minimize.
[2024-05-21 22:03:08] [INFO ] Deduced a trap composed of 19 places in 312 ms of which 4 ms to minimize.
[2024-05-21 22:03:08] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 2 ms to minimize.
[2024-05-21 22:03:09] [INFO ] Deduced a trap composed of 53 places in 312 ms of which 4 ms to minimize.
[2024-05-21 22:03:09] [INFO ] Deduced a trap composed of 21 places in 317 ms of which 4 ms to minimize.
[2024-05-21 22:03:09] [INFO ] Deduced a trap composed of 49 places in 299 ms of which 4 ms to minimize.
[2024-05-21 22:03:10] [INFO ] Deduced a trap composed of 24 places in 310 ms of which 4 ms to minimize.
[2024-05-21 22:03:10] [INFO ] Deduced a trap composed of 31 places in 302 ms of which 3 ms to minimize.
[2024-05-21 22:03:10] [INFO ] Deduced a trap composed of 14 places in 286 ms of which 3 ms to minimize.
[2024-05-21 22:03:11] [INFO ] Deduced a trap composed of 55 places in 274 ms of which 4 ms to minimize.
[2024-05-21 22:03:11] [INFO ] Deduced a trap composed of 38 places in 301 ms of which 4 ms to minimize.
[2024-05-21 22:03:11] [INFO ] Deduced a trap composed of 39 places in 294 ms of which 4 ms to minimize.
[2024-05-21 22:03:12] [INFO ] Deduced a trap composed of 37 places in 296 ms of which 4 ms to minimize.
[2024-05-21 22:03:12] [INFO ] Deduced a trap composed of 71 places in 302 ms of which 4 ms to minimize.
[2024-05-21 22:03:12] [INFO ] Deduced a trap composed of 39 places in 324 ms of which 4 ms to minimize.
[2024-05-21 22:03:13] [INFO ] Deduced a trap composed of 47 places in 285 ms of which 4 ms to minimize.
[2024-05-21 22:03:13] [INFO ] Deduced a trap composed of 31 places in 319 ms of which 4 ms to minimize.
[2024-05-21 22:03:13] [INFO ] Deduced a trap composed of 43 places in 317 ms of which 3 ms to minimize.
[2024-05-21 22:03:14] [INFO ] Deduced a trap composed of 31 places in 301 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 22:03:14] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 5 ms to minimize.
[2024-05-21 22:03:15] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 3 ms to minimize.
[2024-05-21 22:03:15] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 4 ms to minimize.
[2024-05-21 22:03:15] [INFO ] Deduced a trap composed of 46 places in 257 ms of which 4 ms to minimize.
[2024-05-21 22:03:16] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 4 ms to minimize.
[2024-05-21 22:03:16] [INFO ] Deduced a trap composed of 31 places in 297 ms of which 4 ms to minimize.
[2024-05-21 22:03:16] [INFO ] Deduced a trap composed of 26 places in 279 ms of which 3 ms to minimize.
[2024-05-21 22:03:17] [INFO ] Deduced a trap composed of 40 places in 297 ms of which 4 ms to minimize.
[2024-05-21 22:03:17] [INFO ] Deduced a trap composed of 44 places in 304 ms of which 4 ms to minimize.
[2024-05-21 22:03:17] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 4 ms to minimize.
[2024-05-21 22:03:18] [INFO ] Deduced a trap composed of 43 places in 230 ms of which 3 ms to minimize.
[2024-05-21 22:03:18] [INFO ] Deduced a trap composed of 41 places in 201 ms of which 3 ms to minimize.
[2024-05-21 22:03:19] [INFO ] Deduced a trap composed of 48 places in 276 ms of which 4 ms to minimize.
[2024-05-21 22:03:19] [INFO ] Deduced a trap composed of 31 places in 280 ms of which 4 ms to minimize.
[2024-05-21 22:03:19] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 4 ms to minimize.
[2024-05-21 22:03:19] [INFO ] Deduced a trap composed of 32 places in 238 ms of which 3 ms to minimize.
[2024-05-21 22:03:20] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 3 ms to minimize.
[2024-05-21 22:03:20] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 4 ms to minimize.
[2024-05-21 22:03:20] [INFO ] Deduced a trap composed of 45 places in 246 ms of which 3 ms to minimize.
[2024-05-21 22:03:21] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 22:03:25] [INFO ] Deduced a trap composed of 25 places in 305 ms of which 4 ms to minimize.
[2024-05-21 22:03:25] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 4 ms to minimize.
[2024-05-21 22:03:26] [INFO ] Deduced a trap composed of 28 places in 276 ms of which 4 ms to minimize.
[2024-05-21 22:03:26] [INFO ] Deduced a trap composed of 41 places in 291 ms of which 3 ms to minimize.
[2024-05-21 22:03:26] [INFO ] Deduced a trap composed of 47 places in 302 ms of which 4 ms to minimize.
[2024-05-21 22:03:27] [INFO ] Deduced a trap composed of 37 places in 273 ms of which 4 ms to minimize.
[2024-05-21 22:03:27] [INFO ] Deduced a trap composed of 40 places in 250 ms of which 3 ms to minimize.
[2024-05-21 22:03:28] [INFO ] Deduced a trap composed of 55 places in 269 ms of which 4 ms to minimize.
[2024-05-21 22:03:29] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 4 ms to minimize.
[2024-05-21 22:03:29] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 3 ms to minimize.
[2024-05-21 22:03:29] [INFO ] Deduced a trap composed of 32 places in 269 ms of which 4 ms to minimize.
[2024-05-21 22:03:29] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 237/685 variables, and 63 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/237 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 22:03:35] [INFO ] Deduced a trap composed of 31 places in 228 ms of which 3 ms to minimize.
[2024-05-21 22:03:35] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 3 ms to minimize.
[2024-05-21 22:03:35] [INFO ] Deduced a trap composed of 58 places in 258 ms of which 4 ms to minimize.
[2024-05-21 22:03:36] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 3 ms to minimize.
[2024-05-21 22:03:36] [INFO ] Deduced a trap composed of 40 places in 207 ms of which 6 ms to minimize.
[2024-05-21 22:03:37] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 2 ms to minimize.
[2024-05-21 22:03:37] [INFO ] Deduced a trap composed of 40 places in 172 ms of which 3 ms to minimize.
[2024-05-21 22:03:37] [INFO ] Deduced a trap composed of 47 places in 170 ms of which 3 ms to minimize.
[2024-05-21 22:03:38] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 2 ms to minimize.
[2024-05-21 22:03:38] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2024-05-21 22:03:38] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2024-05-21 22:03:39] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 3 ms to minimize.
[2024-05-21 22:03:39] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 2 ms to minimize.
[2024-05-21 22:03:39] [INFO ] Deduced a trap composed of 32 places in 253 ms of which 3 ms to minimize.
[2024-05-21 22:03:39] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 15/78 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 22:03:43] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 3 ms to minimize.
[2024-05-21 22:03:44] [INFO ] Deduced a trap composed of 52 places in 245 ms of which 3 ms to minimize.
[2024-05-21 22:03:46] [INFO ] Deduced a trap composed of 23 places in 278 ms of which 4 ms to minimize.
[2024-05-21 22:03:46] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 4/82 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 22:03:50] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 3 ms to minimize.
[2024-05-21 22:03:50] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 3 ms to minimize.
[2024-05-21 22:03:50] [INFO ] Deduced a trap composed of 35 places in 221 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 22:03:55] [INFO ] Deduced a trap composed of 24 places in 239 ms of which 3 ms to minimize.
[2024-05-21 22:03:55] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 3 ms to minimize.
[2024-05-21 22:03:57] [INFO ] Deduced a trap composed of 43 places in 148 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 237/685 variables, and 88 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/237 constraints, PredecessorRefiner: 0/447 constraints, Known Traps: 77/77 constraints]
After SMT, in 61124ms problems are : Problem set: 0 solved, 447 unsolved
Search for dead transitions found 0 dead transitions in 61133ms
Starting structural reductions in LTL mode, iteration 1 : 237/250 places, 448/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61592 ms. Remains : 237/250 places, 448/605 transitions.
[2024-05-21 22:04:00] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:04:00] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:04:00] [INFO ] Input system was already deterministic with 448 transitions.
[2024-05-21 22:04:00] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:04:00] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:04:00] [INFO ] Time to serialize gal into /tmp/CTLFireability1507375496658112493.gal : 5 ms
[2024-05-21 22:04:00] [INFO ] Time to serialize properties into /tmp/CTLFireability1141387446039404294.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/CTLFireability1507375496658112493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1141387446039404294.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 22:04:30] [INFO ] Flatten gal took : 14 ms
[2024-05-21 22:04:30] [INFO ] Applying decomposition
[2024-05-21 22:04:30] [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/graph5566566838444718758.txt' '-o' '/tmp/graph5566566838444718758.bin' '-w' '/tmp/graph5566566838444718758.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5566566838444718758.bin' '-l' '-1' '-v' '-w' '/tmp/graph5566566838444718758.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:04:30] [INFO ] Decomposing Gal with order
[2024-05-21 22:04:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:04:30] [INFO ] Removed a total of 857 redundant transitions.
[2024-05-21 22:04:30] [INFO ] Flatten gal took : 55 ms
[2024-05-21 22:04:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 8 ms.
[2024-05-21 22:04:30] [INFO ] Time to serialize gal into /tmp/CTLFireability12825285611833501153.gal : 6 ms
[2024-05-21 22:04:30] [INFO ] Time to serialize properties into /tmp/CTLFireability14628664183765431819.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/CTLFireability12825285611833501153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14628664183765431819.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05638e+12,1.14821,32684,2624,115,68674,1565,542,63122,89,5863,0


Converting to forward existential form...Done !
original formula: AF((EX((((((i1.i1.u19.p60==0)&&(((u1.p6==0)||(u1.p16==0))||((i12.u17.p58==0)||(u1.p246==0))))||(i17.i2.u90.p288==1))&&(i14.u78.p222==1))&...363
=> equivalent forward existential formula: [FwdG(Init,!((EX((((((i1.i1.u19.p60==0)&&(((u1.p6==0)||(u1.p16==0))||((i12.u17.p58==0)||(u1.p246==0))))||(i17.i2...414
Reverse transition relation is NOT exact ! Due to transitions t222, t224, t226, t250, t274, t298, t334, t364, i1.i1.t215, i1.i1.u12.t195, i1.i1.u20.t196, i...833
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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, 605/605 transitions.
Graph (trivial) has 217 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 97 rules applied. Total rules applied 98 place count 247 transition count 505
Reduce places removed 97 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 135 rules applied. Total rules applied 233 place count 150 transition count 467
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 23 rules applied. Total rules applied 256 place count 128 transition count 466
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 257 place count 127 transition count 466
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 257 place count 127 transition count 460
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 269 place count 121 transition count 460
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 280 place count 110 transition count 449
Iterating global reduction 4 with 11 rules applied. Total rules applied 291 place count 110 transition count 449
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 435 place count 110 transition count 305
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 438 place count 107 transition count 292
Iterating global reduction 5 with 3 rules applied. Total rules applied 441 place count 107 transition count 292
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 445 place count 107 transition count 288
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 447 place count 105 transition count 288
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 509 place count 74 transition count 257
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 515 place count 68 transition count 218
Iterating global reduction 7 with 6 rules applied. Total rules applied 521 place count 68 transition count 218
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 5 rules applied. Total rules applied 526 place count 68 transition count 213
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 529 place count 66 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 530 place count 65 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 531 place count 65 transition count 211
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 532 place count 65 transition count 211
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 534 place count 63 transition count 209
Applied a total of 534 rules in 51 ms. Remains 63 /250 variables (removed 187) and now considering 209/605 (removed 396) transitions.
// Phase 1: matrix 209 rows 63 cols
[2024-05-21 22:05:00] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 22:05:00] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-21 22:05:00] [INFO ] Invariant cache hit.
[2024-05-21 22:05:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:05:00] [INFO ] Implicit Places using invariants and state equation in 120 ms returned [56, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 182 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 61/250 places, 209/605 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 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 60 transition count 208
Applied a total of 2 rules in 6 ms. Remains 60 /61 variables (removed 1) and now considering 208/209 (removed 1) transitions.
// Phase 1: matrix 208 rows 60 cols
[2024-05-21 22:05:00] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 22:05:00] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-21 22:05:00] [INFO ] Invariant cache hit.
[2024-05-21 22:05:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:05:01] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 60/250 places, 208/605 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 468 ms. Remains : 60/250 places, 208/605 transitions.
[2024-05-21 22:05:01] [INFO ] Flatten gal took : 19 ms
[2024-05-21 22:05:01] [INFO ] Flatten gal took : 20 ms
[2024-05-21 22:05:01] [INFO ] Input system was already deterministic with 208 transitions.
[2024-05-21 22:05:01] [INFO ] Flatten gal took : 20 ms
[2024-05-21 22:05:01] [INFO ] Flatten gal took : 20 ms
[2024-05-21 22:05:01] [INFO ] Time to serialize gal into /tmp/CTLFireability925570686299962873.gal : 4 ms
[2024-05-21 22:05:01] [INFO ] Time to serialize properties into /tmp/CTLFireability10712215656224862178.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/CTLFireability925570686299962873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10712215656224862178.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.93951e+07,23.1846,458400,2,21257,5,1.94058e+06,6,0,446,1.70022e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-21 22:05:31] [INFO ] Flatten gal took : 12 ms
[2024-05-21 22:05:31] [INFO ] Applying decomposition
[2024-05-21 22:05:31] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12554116081875345805.txt' '-o' '/tmp/graph12554116081875345805.bin' '-w' '/tmp/graph12554116081875345805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12554116081875345805.bin' '-l' '-1' '-v' '-w' '/tmp/graph12554116081875345805.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:05:31] [INFO ] Decomposing Gal with order
[2024-05-21 22:05:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:05:31] [INFO ] Removed a total of 653 redundant transitions.
[2024-05-21 22:05:31] [INFO ] Flatten gal took : 20 ms
[2024-05-21 22:05:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 2 ms.
[2024-05-21 22:05:31] [INFO ] Time to serialize gal into /tmp/CTLFireability7004509747242072509.gal : 1 ms
[2024-05-21 22:05:31] [INFO ] Time to serialize properties into /tmp/CTLFireability9494767465971045181.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/CTLFireability7004509747242072509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9494767465971045181.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.93951e+07,0.855886,24408,780,111,32632,1129,214,141553,76,6296,0


Converting to forward existential form...Done !
original formula: !(E(E(!((((u0.p6==1)&&(u0.p18==1))&&((i3.u14.p210==1)&&(u0.p246==1)))) U A((u4.p92==1) U ((((i1.u2.p62==1)&&(u4.p93==1))&&((i1.u6.p118==1...301
=> equivalent forward existential formula: [(FwdU(Init,E(!((((u0.p6==1)&&(u0.p18==1))&&((i3.u14.p210==1)&&(u0.p246==1)))) U !((E(!(((((i1.u2.p62==1)&&(u4.p...626
Reverse transition relation is NOT exact ! Due to transitions t5, t38, t44, t50, t60, t62, t132, t150, t156, t168, u4.t28, u4.t30, i1.u1.t33, i1.u2.t31, i1...474
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 236 transition count 591
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 236 transition count 591
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 172 place count 236 transition count 447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 173 place count 235 transition count 446
Iterating global reduction 1 with 1 rules applied. Total rules applied 174 place count 235 transition count 446
Applied a total of 174 rules in 9 ms. Remains 235 /250 variables (removed 15) and now considering 446/605 (removed 159) transitions.
// Phase 1: matrix 446 rows 235 cols
[2024-05-21 22:06:01] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 22:06:01] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-21 22:06:01] [INFO ] Invariant cache hit.
[2024-05-21 22:06:01] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-21 22:06:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:06:10] [INFO ] Deduced a trap composed of 21 places in 343 ms of which 5 ms to minimize.
[2024-05-21 22:06:10] [INFO ] Deduced a trap composed of 55 places in 340 ms of which 4 ms to minimize.
[2024-05-21 22:06:11] [INFO ] Deduced a trap composed of 17 places in 323 ms of which 4 ms to minimize.
[2024-05-21 22:06:11] [INFO ] Deduced a trap composed of 53 places in 317 ms of which 4 ms to minimize.
[2024-05-21 22:06:11] [INFO ] Deduced a trap composed of 43 places in 300 ms of which 4 ms to minimize.
[2024-05-21 22:06:12] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 2 ms to minimize.
[2024-05-21 22:06:12] [INFO ] Deduced a trap composed of 38 places in 326 ms of which 4 ms to minimize.
[2024-05-21 22:06:12] [INFO ] Deduced a trap composed of 36 places in 268 ms of which 3 ms to minimize.
[2024-05-21 22:06:13] [INFO ] Deduced a trap composed of 30 places in 285 ms of which 4 ms to minimize.
[2024-05-21 22:06:13] [INFO ] Deduced a trap composed of 23 places in 300 ms of which 4 ms to minimize.
[2024-05-21 22:06:13] [INFO ] Deduced a trap composed of 44 places in 300 ms of which 3 ms to minimize.
[2024-05-21 22:06:14] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 4 ms to minimize.
[2024-05-21 22:06:14] [INFO ] Deduced a trap composed of 33 places in 296 ms of which 3 ms to minimize.
[2024-05-21 22:06:14] [INFO ] Deduced a trap composed of 42 places in 377 ms of which 3 ms to minimize.
[2024-05-21 22:06:15] [INFO ] Deduced a trap composed of 27 places in 208 ms of which 3 ms to minimize.
[2024-05-21 22:06:15] [INFO ] Deduced a trap composed of 34 places in 203 ms of which 3 ms to minimize.
[2024-05-21 22:06:15] [INFO ] Deduced a trap composed of 39 places in 275 ms of which 3 ms to minimize.
[2024-05-21 22:06:15] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 2 ms to minimize.
[2024-05-21 22:06:16] [INFO ] Deduced a trap composed of 39 places in 209 ms of which 2 ms to minimize.
[2024-05-21 22:06:16] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:06:16] [INFO ] Deduced a trap composed of 14 places in 210 ms of which 4 ms to minimize.
[2024-05-21 22:06:17] [INFO ] Deduced a trap composed of 47 places in 254 ms of which 3 ms to minimize.
[2024-05-21 22:06:17] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 3 ms to minimize.
[2024-05-21 22:06:17] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 4 ms to minimize.
[2024-05-21 22:06:18] [INFO ] Deduced a trap composed of 18 places in 237 ms of which 3 ms to minimize.
[2024-05-21 22:06:18] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 3 ms to minimize.
[2024-05-21 22:06:18] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 3 ms to minimize.
[2024-05-21 22:06:18] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 3 ms to minimize.
[2024-05-21 22:06:19] [INFO ] Deduced a trap composed of 57 places in 196 ms of which 2 ms to minimize.
[2024-05-21 22:06:19] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 3 ms to minimize.
[2024-05-21 22:06:19] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 3 ms to minimize.
[2024-05-21 22:06:19] [INFO ] Deduced a trap composed of 40 places in 178 ms of which 3 ms to minimize.
[2024-05-21 22:06:20] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 2 ms to minimize.
[2024-05-21 22:06:20] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 2 ms to minimize.
[2024-05-21 22:06:20] [INFO ] Deduced a trap composed of 43 places in 152 ms of which 2 ms to minimize.
[2024-05-21 22:06:20] [INFO ] Deduced a trap composed of 42 places in 147 ms of which 2 ms to minimize.
[2024-05-21 22:06:20] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 3 ms to minimize.
[2024-05-21 22:06:21] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 3 ms to minimize.
[2024-05-21 22:06:21] [INFO ] Deduced a trap composed of 41 places in 165 ms of which 3 ms to minimize.
[2024-05-21 22:06:21] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:06:25] [INFO ] Deduced a trap composed of 40 places in 287 ms of which 4 ms to minimize.
[2024-05-21 22:06:25] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 4 ms to minimize.
[2024-05-21 22:06:26] [INFO ] Deduced a trap composed of 32 places in 278 ms of which 4 ms to minimize.
[2024-05-21 22:06:27] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 2 ms to minimize.
[2024-05-21 22:06:27] [INFO ] Deduced a trap composed of 42 places in 180 ms of which 3 ms to minimize.
[2024-05-21 22:06:27] [INFO ] Deduced a trap composed of 41 places in 153 ms of which 2 ms to minimize.
[2024-05-21 22:06:27] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 3 ms to minimize.
[2024-05-21 22:06:28] [INFO ] Deduced a trap composed of 43 places in 165 ms of which 2 ms to minimize.
[2024-05-21 22:06:28] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 2 ms to minimize.
[2024-05-21 22:06:29] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 3 ms to minimize.
[2024-05-21 22:06:29] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 2 ms to minimize.
[2024-05-21 22:06:29] [INFO ] Deduced a trap composed of 15 places in 277 ms of which 3 ms to minimize.
[2024-05-21 22:06:30] [INFO ] Deduced a trap composed of 23 places in 272 ms of which 4 ms to minimize.
[2024-05-21 22:06:30] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/681 variables, and 65 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 54/54 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:06:38] [INFO ] Deduced a trap composed of 31 places in 234 ms of which 3 ms to minimize.
[2024-05-21 22:06:39] [INFO ] Deduced a trap composed of 31 places in 253 ms of which 4 ms to minimize.
[2024-05-21 22:06:39] [INFO ] Deduced a trap composed of 40 places in 149 ms of which 2 ms to minimize.
[2024-05-21 22:06:39] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 3 ms to minimize.
[2024-05-21 22:06:40] [INFO ] Deduced a trap composed of 31 places in 240 ms of which 4 ms to minimize.
[2024-05-21 22:06:40] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2024-05-21 22:06:40] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 3 ms to minimize.
[2024-05-21 22:06:40] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 3 ms to minimize.
[2024-05-21 22:06:41] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 3 ms to minimize.
[2024-05-21 22:06:41] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 2 ms to minimize.
[2024-05-21 22:06:41] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 3 ms to minimize.
[2024-05-21 22:06:41] [INFO ] Deduced a trap composed of 31 places in 132 ms of which 2 ms to minimize.
[2024-05-21 22:06:42] [INFO ] Deduced a trap composed of 42 places in 143 ms of which 2 ms to minimize.
[2024-05-21 22:06:42] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 3 ms to minimize.
[2024-05-21 22:06:42] [INFO ] Deduced a trap composed of 5 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:06:46] [INFO ] Deduced a trap composed of 41 places in 285 ms of which 4 ms to minimize.
[2024-05-21 22:06:46] [INFO ] Deduced a trap composed of 35 places in 280 ms of which 3 ms to minimize.
[2024-05-21 22:06:46] [INFO ] Deduced a trap composed of 37 places in 261 ms of which 3 ms to minimize.
[2024-05-21 22:06:47] [INFO ] Deduced a trap composed of 41 places in 254 ms of which 3 ms to minimize.
[2024-05-21 22:06:47] [INFO ] Deduced a trap composed of 39 places in 241 ms of which 4 ms to minimize.
[2024-05-21 22:06:47] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 4 ms to minimize.
[2024-05-21 22:06:50] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 7/87 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:06:53] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 3 ms to minimize.
[2024-05-21 22:06:54] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 3 ms to minimize.
[2024-05-21 22:06:54] [INFO ] Deduced a trap composed of 35 places in 229 ms of which 3 ms to minimize.
[2024-05-21 22:06:55] [INFO ] Deduced a trap composed of 31 places in 223 ms of which 3 ms to minimize.
[2024-05-21 22:06:55] [INFO ] Deduced a trap composed of 51 places in 271 ms of which 3 ms to minimize.
[2024-05-21 22:06:55] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-21 22:07:01] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 2 ms to minimize.
[2024-05-21 22:07:01] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 2 ms to minimize.
[2024-05-21 22:07:01] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 2 ms to minimize.
[2024-05-21 22:07:02] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/681 variables, and 97 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 0/445 constraints, Known Traps: 86/86 constraints]
After SMT, in 60996ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 61005ms
Starting structural reductions in LTL mode, iteration 1 : 235/250 places, 446/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61526 ms. Remains : 235/250 places, 446/605 transitions.
[2024-05-21 22:07:03] [INFO ] Flatten gal took : 22 ms
[2024-05-21 22:07:03] [INFO ] Flatten gal took : 25 ms
[2024-05-21 22:07:03] [INFO ] Input system was already deterministic with 446 transitions.
[2024-05-21 22:07:03] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:07:03] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:07:03] [INFO ] Time to serialize gal into /tmp/CTLFireability9539936335565979669.gal : 6 ms
[2024-05-21 22:07:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7431507886271165538.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/CTLFireability9539936335565979669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7431507886271165538.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 22:07:33] [INFO ] Flatten gal took : 14 ms
[2024-05-21 22:07:33] [INFO ] Applying decomposition
[2024-05-21 22:07:33] [INFO ] Flatten gal took : 14 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/graph12804325027896718184.txt' '-o' '/tmp/graph12804325027896718184.bin' '-w' '/tmp/graph12804325027896718184.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12804325027896718184.bin' '-l' '-1' '-v' '-w' '/tmp/graph12804325027896718184.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:07:33] [INFO ] Decomposing Gal with order
[2024-05-21 22:07:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:07:33] [INFO ] Removed a total of 846 redundant transitions.
[2024-05-21 22:07:33] [INFO ] Flatten gal took : 33 ms
[2024-05-21 22:07:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 6 ms.
[2024-05-21 22:07:33] [INFO ] Time to serialize gal into /tmp/CTLFireability3692498474907515947.gal : 12 ms
[2024-05-21 22:07:33] [INFO ] Time to serialize properties into /tmp/CTLFireability15492863089943943205.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/CTLFireability3692498474907515947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15492863089943943205.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03205e+12,0.223348,9684,838,113,12060,1466,585,12483,91,4607,0


Converting to forward existential form...Done !
original formula: E(!((!(EF((i2.u27.p91==1))) * (i0.i1.u7.p27!=1))) U EX(AF((((u1.p6==1)&&(u1.p9==1))&&((i5.i0.u29.p113==1)&&(u1.p246==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,!((!(E(TRUE U (i2.u27.p91==1))) * (i0.i1.u7.p27!=1))))) * !(EG(!((((u1.p6==1)&&(u1.p9==1))&&((i5....200
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t232, t250, t274, t304, t334, t364, t443, i1.i1.t213, i1.i1.u10.t193, i1.i1.u18.t...811
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 238 transition count 593
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 238 transition count 593
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 238 transition count 449
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 237 transition count 448
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 237 transition count 448
Applied a total of 170 rules in 8 ms. Remains 237 /250 variables (removed 13) and now considering 448/605 (removed 157) transitions.
// Phase 1: matrix 448 rows 237 cols
[2024-05-21 22:08:03] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 22:08:03] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-21 22:08:03] [INFO ] Invariant cache hit.
[2024-05-21 22:08:03] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
Running 447 sub problems to find dead transitions.
[2024-05-21 22:08:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 22:08:12] [INFO ] Deduced a trap composed of 17 places in 350 ms of which 4 ms to minimize.
[2024-05-21 22:08:13] [INFO ] Deduced a trap composed of 24 places in 323 ms of which 3 ms to minimize.
[2024-05-21 22:08:13] [INFO ] Deduced a trap composed of 33 places in 306 ms of which 4 ms to minimize.
[2024-05-21 22:08:13] [INFO ] Deduced a trap composed of 32 places in 296 ms of which 4 ms to minimize.
[2024-05-21 22:08:14] [INFO ] Deduced a trap composed of 40 places in 315 ms of which 4 ms to minimize.
[2024-05-21 22:08:14] [INFO ] Deduced a trap composed of 36 places in 300 ms of which 4 ms to minimize.
[2024-05-21 22:08:14] [INFO ] Deduced a trap composed of 32 places in 294 ms of which 4 ms to minimize.
[2024-05-21 22:08:15] [INFO ] Deduced a trap composed of 44 places in 299 ms of which 4 ms to minimize.
[2024-05-21 22:08:15] [INFO ] Deduced a trap composed of 34 places in 283 ms of which 4 ms to minimize.
[2024-05-21 22:08:15] [INFO ] Deduced a trap composed of 26 places in 297 ms of which 3 ms to minimize.
[2024-05-21 22:08:16] [INFO ] Deduced a trap composed of 28 places in 300 ms of which 4 ms to minimize.
[2024-05-21 22:08:16] [INFO ] Deduced a trap composed of 44 places in 300 ms of which 4 ms to minimize.
[2024-05-21 22:08:16] [INFO ] Deduced a trap composed of 35 places in 295 ms of which 4 ms to minimize.
[2024-05-21 22:08:17] [INFO ] Deduced a trap composed of 36 places in 278 ms of which 3 ms to minimize.
[2024-05-21 22:08:17] [INFO ] Deduced a trap composed of 37 places in 282 ms of which 4 ms to minimize.
[2024-05-21 22:08:17] [INFO ] Deduced a trap composed of 44 places in 281 ms of which 4 ms to minimize.
[2024-05-21 22:08:17] [INFO ] Deduced a trap composed of 18 places in 250 ms of which 3 ms to minimize.
[2024-05-21 22:08:18] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 4 ms to minimize.
[2024-05-21 22:08:18] [INFO ] Deduced a trap composed of 32 places in 291 ms of which 4 ms to minimize.
[2024-05-21 22:08:18] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 22:08:19] [INFO ] Deduced a trap composed of 31 places in 324 ms of which 4 ms to minimize.
[2024-05-21 22:08:19] [INFO ] Deduced a trap composed of 14 places in 319 ms of which 4 ms to minimize.
[2024-05-21 22:08:20] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 3 ms to minimize.
[2024-05-21 22:08:20] [INFO ] Deduced a trap composed of 40 places in 313 ms of which 4 ms to minimize.
[2024-05-21 22:08:20] [INFO ] Deduced a trap composed of 38 places in 302 ms of which 3 ms to minimize.
[2024-05-21 22:08:21] [INFO ] Deduced a trap composed of 40 places in 314 ms of which 4 ms to minimize.
[2024-05-21 22:08:21] [INFO ] Deduced a trap composed of 38 places in 311 ms of which 4 ms to minimize.
[2024-05-21 22:08:21] [INFO ] Deduced a trap composed of 44 places in 315 ms of which 4 ms to minimize.
[2024-05-21 22:08:22] [INFO ] Deduced a trap composed of 50 places in 303 ms of which 3 ms to minimize.
[2024-05-21 22:08:22] [INFO ] Deduced a trap composed of 38 places in 319 ms of which 4 ms to minimize.
[2024-05-21 22:08:22] [INFO ] Deduced a trap composed of 40 places in 318 ms of which 4 ms to minimize.
[2024-05-21 22:08:23] [INFO ] Deduced a trap composed of 26 places in 334 ms of which 4 ms to minimize.
[2024-05-21 22:08:23] [INFO ] Deduced a trap composed of 43 places in 317 ms of which 4 ms to minimize.
[2024-05-21 22:08:23] [INFO ] Deduced a trap composed of 39 places in 324 ms of which 4 ms to minimize.
[2024-05-21 22:08:24] [INFO ] Deduced a trap composed of 35 places in 298 ms of which 4 ms to minimize.
[2024-05-21 22:08:24] [INFO ] Deduced a trap composed of 31 places in 265 ms of which 3 ms to minimize.
[2024-05-21 22:08:24] [INFO ] Deduced a trap composed of 31 places in 269 ms of which 4 ms to minimize.
[2024-05-21 22:08:25] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 3 ms to minimize.
[2024-05-21 22:08:25] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 4 ms to minimize.
[2024-05-21 22:08:25] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 22:08:29] [INFO ] Deduced a trap composed of 41 places in 63 ms of which 1 ms to minimize.
[2024-05-21 22:08:29] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-21 22:08:29] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 3 ms to minimize.
[2024-05-21 22:08:29] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 2 ms to minimize.
[2024-05-21 22:08:30] [INFO ] Deduced a trap composed of 37 places in 225 ms of which 2 ms to minimize.
[2024-05-21 22:08:30] [INFO ] Deduced a trap composed of 59 places in 178 ms of which 2 ms to minimize.
[2024-05-21 22:08:30] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 3 ms to minimize.
[2024-05-21 22:08:30] [INFO ] Deduced a trap composed of 39 places in 186 ms of which 2 ms to minimize.
[2024-05-21 22:08:30] [INFO ] Deduced a trap composed of 46 places in 224 ms of which 3 ms to minimize.
[2024-05-21 22:08:31] [INFO ] Deduced a trap composed of 56 places in 238 ms of which 3 ms to minimize.
[2024-05-21 22:08:31] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 3 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 2 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 41 places in 207 ms of which 3 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 2 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2024-05-21 22:08:32] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 3 ms to minimize.
[2024-05-21 22:08:33] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 2 ms to minimize.
[2024-05-21 22:08:33] [INFO ] Deduced a trap composed of 41 places in 250 ms of which 3 ms to minimize.
[2024-05-21 22:08:33] [INFO ] Deduced a trap composed of 43 places in 175 ms of which 3 ms to minimize.
[2024-05-21 22:08:34] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-05-21 22:08:35] [INFO ] Deduced a trap composed of 32 places in 159 ms of which 3 ms to minimize.
SMT process timed out in 31157ms, After SMT, problems are : Problem set: 0 solved, 447 unsolved
Search for dead transitions found 0 dead transitions in 31166ms
Starting structural reductions in LTL mode, iteration 1 : 237/250 places, 448/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31701 ms. Remains : 237/250 places, 448/605 transitions.
[2024-05-21 22:08:35] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:08:35] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:08:35] [INFO ] Input system was already deterministic with 448 transitions.
[2024-05-21 22:08:35] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:08:35] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:08:35] [INFO ] Time to serialize gal into /tmp/CTLFireability988008071333540959.gal : 5 ms
[2024-05-21 22:08:35] [INFO ] Time to serialize properties into /tmp/CTLFireability11902108706484168264.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/CTLFireability988008071333540959.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11902108706484168264.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 22:09:05] [INFO ] Flatten gal took : 14 ms
[2024-05-21 22:09:05] [INFO ] Applying decomposition
[2024-05-21 22:09:05] [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/graph3050232976412854994.txt' '-o' '/tmp/graph3050232976412854994.bin' '-w' '/tmp/graph3050232976412854994.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3050232976412854994.bin' '-l' '-1' '-v' '-w' '/tmp/graph3050232976412854994.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:09:05] [INFO ] Decomposing Gal with order
[2024-05-21 22:09:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:09:05] [INFO ] Removed a total of 848 redundant transitions.
[2024-05-21 22:09:05] [INFO ] Flatten gal took : 31 ms
[2024-05-21 22:09:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 6 ms.
[2024-05-21 22:09:05] [INFO ] Time to serialize gal into /tmp/CTLFireability12331028137705853544.gal : 4 ms
[2024-05-21 22:09:05] [INFO ] Time to serialize properties into /tmp/CTLFireability3581199178358752028.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/CTLFireability12331028137705853544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3581199178358752028.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.06396e+12,1.13946,29480,2181,118,60473,1803,567,58430,96,9273,0


Converting to forward existential form...Done !
original formula: E(!(A(EX((AF((((u1.p6==1)&&(u1.p14==1))&&((i7.i0.u39.p132==1)&&(u1.p246==1)))) * EX((i10.u55.p178==1)))) U AG(EF(((((i1.i1.u18.p62==1)&&(...485
=> equivalent forward existential formula: [((((FwdU(Init,!(!((E(!(!(E(TRUE U !(E(TRUE U ((((i1.i1.u18.p62==1)&&(i2.u25.p87==1))&&((i6.u35.p118==1)&&(i8.u4...950
Reverse transition relation is NOT exact ! Due to transitions t221, t223, t226, t250, t274, t298, t340, t445, i1.i1.t214, i1.i1.u11.t194, i1.i1.u18.t195, i...809
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 237 transition count 592
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 237 transition count 592
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 170 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 236 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 236 transition count 447
Applied a total of 172 rules in 9 ms. Remains 236 /250 variables (removed 14) and now considering 447/605 (removed 158) transitions.
// Phase 1: matrix 447 rows 236 cols
[2024-05-21 22:09:35] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 22:09:35] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-21 22:09:35] [INFO ] Invariant cache hit.
[2024-05-21 22:09:35] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2024-05-21 22:09:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:09:44] [INFO ] Deduced a trap composed of 22 places in 357 ms of which 4 ms to minimize.
[2024-05-21 22:09:45] [INFO ] Deduced a trap composed of 55 places in 335 ms of which 4 ms to minimize.
[2024-05-21 22:09:45] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 4 ms to minimize.
[2024-05-21 22:09:45] [INFO ] Deduced a trap composed of 31 places in 291 ms of which 3 ms to minimize.
[2024-05-21 22:09:46] [INFO ] Deduced a trap composed of 14 places in 272 ms of which 4 ms to minimize.
[2024-05-21 22:09:46] [INFO ] Deduced a trap composed of 31 places in 248 ms of which 3 ms to minimize.
[2024-05-21 22:09:46] [INFO ] Deduced a trap composed of 31 places in 235 ms of which 4 ms to minimize.
[2024-05-21 22:09:47] [INFO ] Deduced a trap composed of 38 places in 299 ms of which 3 ms to minimize.
[2024-05-21 22:09:47] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 3 ms to minimize.
[2024-05-21 22:09:47] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 2 ms to minimize.
[2024-05-21 22:09:47] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2024-05-21 22:09:47] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 2 ms to minimize.
[2024-05-21 22:09:47] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-21 22:09:48] [INFO ] Deduced a trap composed of 27 places in 306 ms of which 4 ms to minimize.
[2024-05-21 22:09:48] [INFO ] Deduced a trap composed of 59 places in 316 ms of which 4 ms to minimize.
[2024-05-21 22:09:49] [INFO ] Deduced a trap composed of 52 places in 309 ms of which 4 ms to minimize.
[2024-05-21 22:09:49] [INFO ] Deduced a trap composed of 56 places in 277 ms of which 4 ms to minimize.
[2024-05-21 22:09:49] [INFO ] Deduced a trap composed of 55 places in 256 ms of which 4 ms to minimize.
[2024-05-21 22:09:50] [INFO ] Deduced a trap composed of 32 places in 286 ms of which 4 ms to minimize.
[2024-05-21 22:09:50] [INFO ] Deduced a trap composed of 31 places in 268 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:09:51] [INFO ] Deduced a trap composed of 34 places in 309 ms of which 4 ms to minimize.
[2024-05-21 22:09:51] [INFO ] Deduced a trap composed of 34 places in 295 ms of which 4 ms to minimize.
[2024-05-21 22:09:51] [INFO ] Deduced a trap composed of 38 places in 287 ms of which 4 ms to minimize.
[2024-05-21 22:09:51] [INFO ] Deduced a trap composed of 36 places in 306 ms of which 4 ms to minimize.
[2024-05-21 22:09:52] [INFO ] Deduced a trap composed of 38 places in 251 ms of which 4 ms to minimize.
[2024-05-21 22:09:52] [INFO ] Deduced a trap composed of 38 places in 288 ms of which 4 ms to minimize.
[2024-05-21 22:09:52] [INFO ] Deduced a trap composed of 21 places in 295 ms of which 4 ms to minimize.
[2024-05-21 22:09:53] [INFO ] Deduced a trap composed of 40 places in 310 ms of which 3 ms to minimize.
[2024-05-21 22:09:53] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 4 ms to minimize.
[2024-05-21 22:09:53] [INFO ] Deduced a trap composed of 25 places in 310 ms of which 4 ms to minimize.
[2024-05-21 22:09:54] [INFO ] Deduced a trap composed of 38 places in 305 ms of which 4 ms to minimize.
[2024-05-21 22:09:54] [INFO ] Deduced a trap composed of 36 places in 292 ms of which 4 ms to minimize.
[2024-05-21 22:09:54] [INFO ] Deduced a trap composed of 45 places in 274 ms of which 4 ms to minimize.
[2024-05-21 22:09:55] [INFO ] Deduced a trap composed of 42 places in 275 ms of which 3 ms to minimize.
[2024-05-21 22:09:55] [INFO ] Deduced a trap composed of 40 places in 298 ms of which 4 ms to minimize.
[2024-05-21 22:09:55] [INFO ] Deduced a trap composed of 41 places in 264 ms of which 3 ms to minimize.
[2024-05-21 22:09:56] [INFO ] Deduced a trap composed of 37 places in 270 ms of which 4 ms to minimize.
[2024-05-21 22:09:56] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 3 ms to minimize.
[2024-05-21 22:09:56] [INFO ] Deduced a trap composed of 39 places in 275 ms of which 4 ms to minimize.
[2024-05-21 22:09:57] [INFO ] Deduced a trap composed of 45 places in 303 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:10:01] [INFO ] Deduced a trap composed of 40 places in 255 ms of which 4 ms to minimize.
[2024-05-21 22:10:02] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 4 ms to minimize.
[2024-05-21 22:10:02] [INFO ] Deduced a trap composed of 47 places in 290 ms of which 4 ms to minimize.
[2024-05-21 22:10:03] [INFO ] Deduced a trap composed of 31 places in 267 ms of which 3 ms to minimize.
[2024-05-21 22:10:03] [INFO ] Deduced a trap composed of 56 places in 274 ms of which 3 ms to minimize.
[2024-05-21 22:10:04] [INFO ] Deduced a trap composed of 32 places in 257 ms of which 4 ms to minimize.
[2024-05-21 22:10:04] [INFO ] Deduced a trap composed of 47 places in 282 ms of which 3 ms to minimize.
[2024-05-21 22:10:04] [INFO ] Deduced a trap composed of 58 places in 233 ms of which 3 ms to minimize.
[2024-05-21 22:10:05] [INFO ] Deduced a trap composed of 40 places in 192 ms of which 3 ms to minimize.
[2024-05-21 22:10:05] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 3 ms to minimize.
[2024-05-21 22:10:05] [INFO ] Deduced a trap composed of 43 places in 179 ms of which 3 ms to minimize.
[2024-05-21 22:10:05] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 3 ms to minimize.
[2024-05-21 22:10:05] [INFO ] Deduced a trap composed of 40 places in 173 ms of which 3 ms to minimize.
[2024-05-21 22:10:05] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 2 ms to minimize.
[2024-05-21 22:10:06] [INFO ] Deduced a trap composed of 42 places in 201 ms of which 3 ms to minimize.
[2024-05-21 22:10:06] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 2 ms to minimize.
SMT process timed out in 30983ms, After SMT, problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 30989ms
Starting structural reductions in LTL mode, iteration 1 : 236/250 places, 447/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31404 ms. Remains : 236/250 places, 447/605 transitions.
[2024-05-21 22:10:07] [INFO ] Flatten gal took : 22 ms
[2024-05-21 22:10:07] [INFO ] Flatten gal took : 31 ms
[2024-05-21 22:10:07] [INFO ] Input system was already deterministic with 447 transitions.
[2024-05-21 22:10:07] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:10:07] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:10:07] [INFO ] Time to serialize gal into /tmp/CTLFireability8612316271772103588.gal : 5 ms
[2024-05-21 22:10:07] [INFO ] Time to serialize properties into /tmp/CTLFireability4406705387233266806.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/CTLFireability8612316271772103588.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4406705387233266806.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 22:10:37] [INFO ] Flatten gal took : 14 ms
[2024-05-21 22:10:37] [INFO ] Applying decomposition
[2024-05-21 22:10:37] [INFO ] Flatten gal took : 14 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/graph4280066036471706903.txt' '-o' '/tmp/graph4280066036471706903.bin' '-w' '/tmp/graph4280066036471706903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4280066036471706903.bin' '-l' '-1' '-v' '-w' '/tmp/graph4280066036471706903.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:10:37] [INFO ] Decomposing Gal with order
[2024-05-21 22:10:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:10:37] [INFO ] Removed a total of 842 redundant transitions.
[2024-05-21 22:10:37] [INFO ] Flatten gal took : 30 ms
[2024-05-21 22:10:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 5 ms.
[2024-05-21 22:10:37] [INFO ] Time to serialize gal into /tmp/CTLFireability14277130659528051929.gal : 3 ms
[2024-05-21 22:10:37] [INFO ] Time to serialize properties into /tmp/CTLFireability17657553958771656882.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/CTLFireability14277130659528051929.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17657553958771656882.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.11325e+12,0.247294,9972,831,117,13096,1257,535,14266,88,4055,0


Converting to forward existential form...Done !
original formula: (AF((EG((((u2.p6==1)&&(u2.p9==1))&&((i10.i1.u50.p175==1)&&(u2.p246==1)))) + ((((((u2.p6==0)||(u2.p14==0))||((i2.u14.p58==0)||(u2.p246==0)...991
=> equivalent forward existential formula: ([FwdG(Init,!((EG((((u2.p6==1)&&(u2.p9==1))&&((i10.i1.u50.p175==1)&&(u2.p246==1)))) + ((((((u2.p6==0)||(u2.p14==...1073
Reverse transition relation is NOT exact ! Due to transitions t221, t223, t236, t260, t278, t302, t344, t368, t444, i2.t214, i2.u9.t194, i2.u14.t198, i2.u1...786
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Graph (trivial) has 235 edges and 250 vertex of which 4 / 250 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 247 transition count 503
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 137 rules applied. Total rules applied 237 place count 148 transition count 465
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 259 place count 126 transition count 465
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 259 place count 126 transition count 460
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 269 place count 121 transition count 460
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 280 place count 110 transition count 449
Iterating global reduction 3 with 11 rules applied. Total rules applied 291 place count 110 transition count 449
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 435 place count 110 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 435 place count 110 transition count 304
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 437 place count 109 transition count 304
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 440 place count 106 transition count 291
Iterating global reduction 4 with 3 rules applied. Total rules applied 443 place count 106 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 447 place count 106 transition count 287
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 449 place count 104 transition count 287
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 523 place count 67 transition count 250
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 532 place count 58 transition count 190
Iterating global reduction 6 with 9 rules applied. Total rules applied 541 place count 58 transition count 190
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 6 rules applied. Total rules applied 547 place count 58 transition count 184
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 550 place count 55 transition count 184
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 551 place count 55 transition count 183
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 552 place count 55 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 554 place count 53 transition count 181
Applied a total of 554 rules in 55 ms. Remains 53 /250 variables (removed 197) and now considering 181/605 (removed 424) transitions.
// Phase 1: matrix 181 rows 53 cols
[2024-05-21 22:11:07] [INFO ] Computed 10 invariants in 1 ms
[2024-05-21 22:11:07] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 22:11:07] [INFO ] Invariant cache hit.
[2024-05-21 22:11:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:11:07] [INFO ] Implicit Places using invariants and state equation in 213 ms returned [46, 52]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 328 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 51/250 places, 181/605 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 0 with 1 rules applied. Total rules applied 1 place count 51 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 50 transition count 180
Applied a total of 2 rules in 11 ms. Remains 50 /51 variables (removed 1) and now considering 180/181 (removed 1) transitions.
// Phase 1: matrix 180 rows 50 cols
[2024-05-21 22:11:07] [INFO ] Computed 8 invariants in 1 ms
[2024-05-21 22:11:07] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 22:11:07] [INFO ] Invariant cache hit.
[2024-05-21 22:11:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 22:11:08] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 50/250 places, 180/605 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 677 ms. Remains : 50/250 places, 180/605 transitions.
[2024-05-21 22:11:08] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:11:08] [INFO ] Flatten gal took : 11 ms
[2024-05-21 22:11:08] [INFO ] Input system was already deterministic with 180 transitions.
[2024-05-21 22:11:08] [INFO ] Flatten gal took : 10 ms
[2024-05-21 22:11:08] [INFO ] Flatten gal took : 11 ms
[2024-05-21 22:11:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14589568606320760907.gal : 2 ms
[2024-05-21 22:11:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17249301762910237378.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/ReachabilityCardinality14589568606320760907.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17249301762910237378.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
RANDOM walk for 12939 steps (736 resets) in 163 ms. (78 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-06b-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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, 605/605 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 237 transition count 592
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 237 transition count 592
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 170 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 236 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 236 transition count 447
Applied a total of 172 rules in 10 ms. Remains 236 /250 variables (removed 14) and now considering 447/605 (removed 158) transitions.
// Phase 1: matrix 447 rows 236 cols
[2024-05-21 22:11:08] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 22:11:08] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-21 22:11:08] [INFO ] Invariant cache hit.
[2024-05-21 22:11:08] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2024-05-21 22:11:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:11:17] [INFO ] Deduced a trap composed of 21 places in 337 ms of which 4 ms to minimize.
[2024-05-21 22:11:17] [INFO ] Deduced a trap composed of 55 places in 348 ms of which 4 ms to minimize.
[2024-05-21 22:11:18] [INFO ] Deduced a trap composed of 23 places in 305 ms of which 4 ms to minimize.
[2024-05-21 22:11:18] [INFO ] Deduced a trap composed of 14 places in 291 ms of which 4 ms to minimize.
[2024-05-21 22:11:18] [INFO ] Deduced a trap composed of 31 places in 265 ms of which 3 ms to minimize.
[2024-05-21 22:11:18] [INFO ] Deduced a trap composed of 31 places in 241 ms of which 3 ms to minimize.
[2024-05-21 22:11:19] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 3 ms to minimize.
[2024-05-21 22:11:19] [INFO ] Deduced a trap composed of 31 places in 217 ms of which 3 ms to minimize.
[2024-05-21 22:11:19] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 3 ms to minimize.
[2024-05-21 22:11:20] [INFO ] Deduced a trap composed of 38 places in 296 ms of which 4 ms to minimize.
[2024-05-21 22:11:20] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 4 ms to minimize.
[2024-05-21 22:11:20] [INFO ] Deduced a trap composed of 52 places in 274 ms of which 4 ms to minimize.
[2024-05-21 22:11:21] [INFO ] Deduced a trap composed of 35 places in 290 ms of which 4 ms to minimize.
[2024-05-21 22:11:21] [INFO ] Deduced a trap composed of 37 places in 284 ms of which 3 ms to minimize.
[2024-05-21 22:11:21] [INFO ] Deduced a trap composed of 32 places in 282 ms of which 3 ms to minimize.
[2024-05-21 22:11:22] [INFO ] Deduced a trap composed of 46 places in 275 ms of which 4 ms to minimize.
[2024-05-21 22:11:22] [INFO ] Deduced a trap composed of 37 places in 271 ms of which 4 ms to minimize.
[2024-05-21 22:11:22] [INFO ] Deduced a trap composed of 24 places in 258 ms of which 3 ms to minimize.
[2024-05-21 22:11:23] [INFO ] Deduced a trap composed of 52 places in 314 ms of which 4 ms to minimize.
[2024-05-21 22:11:23] [INFO ] Deduced a trap composed of 40 places in 253 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:11:24] [INFO ] Deduced a trap composed of 40 places in 292 ms of which 3 ms to minimize.
[2024-05-21 22:11:24] [INFO ] Deduced a trap composed of 38 places in 286 ms of which 4 ms to minimize.
[2024-05-21 22:11:24] [INFO ] Deduced a trap composed of 34 places in 281 ms of which 3 ms to minimize.
[2024-05-21 22:11:24] [INFO ] Deduced a trap composed of 33 places in 287 ms of which 4 ms to minimize.
[2024-05-21 22:11:25] [INFO ] Deduced a trap composed of 42 places in 265 ms of which 4 ms to minimize.
[2024-05-21 22:11:25] [INFO ] Deduced a trap composed of 27 places in 248 ms of which 3 ms to minimize.
[2024-05-21 22:11:25] [INFO ] Deduced a trap composed of 40 places in 247 ms of which 3 ms to minimize.
[2024-05-21 22:11:26] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 4 ms to minimize.
[2024-05-21 22:11:26] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-21 22:11:26] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 4 ms to minimize.
[2024-05-21 22:11:26] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 4 ms to minimize.
[2024-05-21 22:11:27] [INFO ] Deduced a trap composed of 25 places in 370 ms of which 3 ms to minimize.
[2024-05-21 22:11:27] [INFO ] Deduced a trap composed of 27 places in 275 ms of which 3 ms to minimize.
[2024-05-21 22:11:27] [INFO ] Deduced a trap composed of 36 places in 262 ms of which 3 ms to minimize.
[2024-05-21 22:11:28] [INFO ] Deduced a trap composed of 47 places in 246 ms of which 3 ms to minimize.
[2024-05-21 22:11:28] [INFO ] Deduced a trap composed of 38 places in 253 ms of which 3 ms to minimize.
[2024-05-21 22:11:28] [INFO ] Deduced a trap composed of 39 places in 249 ms of which 3 ms to minimize.
[2024-05-21 22:11:29] [INFO ] Deduced a trap composed of 39 places in 222 ms of which 3 ms to minimize.
[2024-05-21 22:11:29] [INFO ] Deduced a trap composed of 58 places in 317 ms of which 4 ms to minimize.
[2024-05-21 22:11:29] [INFO ] Deduced a trap composed of 43 places in 252 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:11:33] [INFO ] Deduced a trap composed of 36 places in 197 ms of which 4 ms to minimize.
[2024-05-21 22:11:34] [INFO ] Deduced a trap composed of 41 places in 296 ms of which 4 ms to minimize.
[2024-05-21 22:11:34] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
[2024-05-21 22:11:34] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
[2024-05-21 22:11:34] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 2 ms to minimize.
[2024-05-21 22:11:34] [INFO ] Deduced a trap composed of 41 places in 114 ms of which 1 ms to minimize.
[2024-05-21 22:11:34] [INFO ] Deduced a trap composed of 43 places in 102 ms of which 2 ms to minimize.
[2024-05-21 22:11:35] [INFO ] Deduced a trap composed of 31 places in 186 ms of which 2 ms to minimize.
[2024-05-21 22:11:35] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 2 ms to minimize.
[2024-05-21 22:11:35] [INFO ] Deduced a trap composed of 43 places in 120 ms of which 2 ms to minimize.
[2024-05-21 22:11:35] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-05-21 22:11:36] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 3 ms to minimize.
[2024-05-21 22:11:36] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 3 ms to minimize.
[2024-05-21 22:11:36] [INFO ] Deduced a trap composed of 40 places in 187 ms of which 3 ms to minimize.
[2024-05-21 22:11:36] [INFO ] Deduced a trap composed of 31 places in 182 ms of which 2 ms to minimize.
[2024-05-21 22:11:36] [INFO ] Deduced a trap composed of 41 places in 134 ms of which 2 ms to minimize.
[2024-05-21 22:11:37] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 2 ms to minimize.
[2024-05-21 22:11:37] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 1 ms to minimize.
[2024-05-21 22:11:37] [INFO ] Deduced a trap composed of 32 places in 183 ms of which 3 ms to minimize.
[2024-05-21 22:11:37] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:11:39] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
[2024-05-21 22:11:39] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 2 ms to minimize.
[2024-05-21 22:11:39] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 1 ms to minimize.
[2024-05-21 22:11:39] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/683 variables, and 75 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/236 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 64/75 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:11:43] [INFO ] Deduced a trap composed of 44 places in 278 ms of which 4 ms to minimize.
[2024-05-21 22:11:44] [INFO ] Deduced a trap composed of 43 places in 289 ms of which 3 ms to minimize.
[2024-05-21 22:11:45] [INFO ] Deduced a trap composed of 42 places in 190 ms of which 3 ms to minimize.
[2024-05-21 22:11:45] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 3 ms to minimize.
[2024-05-21 22:11:45] [INFO ] Deduced a trap composed of 41 places in 139 ms of which 2 ms to minimize.
[2024-05-21 22:11:46] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-05-21 22:11:46] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 2 ms to minimize.
[2024-05-21 22:11:46] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 2 ms to minimize.
[2024-05-21 22:11:46] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 3 ms to minimize.
[2024-05-21 22:11:47] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 2 ms to minimize.
[2024-05-21 22:11:47] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2024-05-21 22:11:47] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 12/87 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:11:50] [INFO ] Deduced a trap composed of 15 places in 307 ms of which 4 ms to minimize.
[2024-05-21 22:11:52] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 2 ms to minimize.
[2024-05-21 22:11:52] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:11:57] [INFO ] Deduced a trap composed of 31 places in 229 ms of which 3 ms to minimize.
[2024-05-21 22:11:57] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 7 (OVERLAPS) 447/683 variables, 236/328 constraints. Problems are: Problem set: 2 solved, 444 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/683 variables, 444/772 constraints. Problems are: Problem set: 2 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 683/683 variables, and 772 constraints, problems are : Problem set: 2 solved, 444 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 444/446 constraints, Known Traps: 81/81 constraints]
After SMT, in 61184ms problems are : Problem set: 2 solved, 444 unsolved
Search for dead transitions found 2 dead transitions in 61193ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 236/250 places, 445/605 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 445
Applied a total of 1 rules in 3 ms. Remains 235 /236 variables (removed 1) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 235 cols
[2024-05-21 22:12:10] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 22:12:10] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-21 22:12:10] [INFO ] Invariant cache hit.
[2024-05-21 22:12:10] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 235/250 places, 445/605 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62343 ms. Remains : 235/250 places, 445/605 transitions.
[2024-05-21 22:12:10] [INFO ] Flatten gal took : 22 ms
[2024-05-21 22:12:10] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:12:10] [INFO ] Input system was already deterministic with 445 transitions.
[2024-05-21 22:12:10] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:12:10] [INFO ] Flatten gal took : 24 ms
[2024-05-21 22:12:10] [INFO ] Time to serialize gal into /tmp/CTLFireability2230586416744094177.gal : 5 ms
[2024-05-21 22:12:10] [INFO ] Time to serialize properties into /tmp/CTLFireability2424365200101539295.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/CTLFireability2230586416744094177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2424365200101539295.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 22:12:40] [INFO ] Flatten gal took : 14 ms
[2024-05-21 22:12:40] [INFO ] Applying decomposition
[2024-05-21 22:12:40] [INFO ] Flatten gal took : 14 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/graph9003353522094590068.txt' '-o' '/tmp/graph9003353522094590068.bin' '-w' '/tmp/graph9003353522094590068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9003353522094590068.bin' '-l' '-1' '-v' '-w' '/tmp/graph9003353522094590068.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:12:40] [INFO ] Decomposing Gal with order
[2024-05-21 22:12:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:12:40] [INFO ] Removed a total of 854 redundant transitions.
[2024-05-21 22:12:40] [INFO ] Flatten gal took : 27 ms
[2024-05-21 22:12:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2024-05-21 22:12:40] [INFO ] Time to serialize gal into /tmp/CTLFireability557145802959710244.gal : 3 ms
[2024-05-21 22:12:40] [INFO ] Time to serialize properties into /tmp/CTLFireability17604289562277845892.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/CTLFireability557145802959710244.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17604289562277845892.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.07288e+12,0.421905,11828,891,116,16466,1912,537,20257,85,6937,0


Converting to forward existential form...Done !
original formula: (AX(!(A(EX((((u2.p6==1)&&(u2.p17==1))&&((i7.u27.p89==1)&&(u2.p246==1)))) U ((EX((i14.i0.u64.p200==1)) + (i3.i1.u6.p22!=1)) + (i3.i0.u0.p0...344
=> equivalent forward existential formula: ([FwdG((Init * !(!(EX(!(!(!((E(!(((EX((i14.i0.u64.p200==1)) + (i3.i1.u6.p22!=1)) + (i3.i0.u0.p0==1))) U (!(EX(((...926
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t224, t248, t272, t296, t338, t356, t442, i1.u71.t33, i1.u71.t36, i1.u71.t37, i1....801
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,12.7493,360836,1,0,973206,3643,5138,693867,515,19019,1317717
FORMULA AutonomousCar-PT-06b-CTLFireability-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 605/605 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 237 transition count 592
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 237 transition count 592
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 170 place count 237 transition count 448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 171 place count 236 transition count 447
Iterating global reduction 1 with 1 rules applied. Total rules applied 172 place count 236 transition count 447
Applied a total of 172 rules in 9 ms. Remains 236 /250 variables (removed 14) and now considering 447/605 (removed 158) transitions.
// Phase 1: matrix 447 rows 236 cols
[2024-05-21 22:12:53] [INFO ] Computed 11 invariants in 2 ms
[2024-05-21 22:12:53] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-21 22:12:53] [INFO ] Invariant cache hit.
[2024-05-21 22:12:54] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2024-05-21 22:12:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:13:01] [INFO ] Deduced a trap composed of 22 places in 331 ms of which 5 ms to minimize.
[2024-05-21 22:13:02] [INFO ] Deduced a trap composed of 55 places in 335 ms of which 4 ms to minimize.
[2024-05-21 22:13:02] [INFO ] Deduced a trap composed of 14 places in 286 ms of which 4 ms to minimize.
[2024-05-21 22:13:02] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 2 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 38 places in 318 ms of which 4 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 42 places in 286 ms of which 3 ms to minimize.
[2024-05-21 22:13:03] [INFO ] Deduced a trap composed of 31 places in 273 ms of which 4 ms to minimize.
[2024-05-21 22:13:04] [INFO ] Deduced a trap composed of 45 places in 269 ms of which 3 ms to minimize.
[2024-05-21 22:13:04] [INFO ] Deduced a trap composed of 25 places in 261 ms of which 3 ms to minimize.
[2024-05-21 22:13:04] [INFO ] Deduced a trap composed of 35 places in 267 ms of which 3 ms to minimize.
[2024-05-21 22:13:04] [INFO ] Deduced a trap composed of 41 places in 261 ms of which 3 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 55 places in 271 ms of which 3 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 39 places in 283 ms of which 3 ms to minimize.
[2024-05-21 22:13:05] [INFO ] Deduced a trap composed of 42 places in 294 ms of which 4 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 37 places in 286 ms of which 4 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 41 places in 294 ms of which 3 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 47 places in 293 ms of which 3 ms to minimize.
[2024-05-21 22:13:06] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 4 ms to minimize.
[2024-05-21 22:13:07] [INFO ] Deduced a trap composed of 38 places in 295 ms of which 4 ms to minimize.
[2024-05-21 22:13:07] [INFO ] Deduced a trap composed of 45 places in 275 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:13:08] [INFO ] Deduced a trap composed of 18 places in 306 ms of which 3 ms to minimize.
[2024-05-21 22:13:08] [INFO ] Deduced a trap composed of 36 places in 302 ms of which 4 ms to minimize.
[2024-05-21 22:13:08] [INFO ] Deduced a trap composed of 64 places in 282 ms of which 3 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 37 places in 283 ms of which 3 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 33 places in 300 ms of which 3 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 44 places in 302 ms of which 4 ms to minimize.
[2024-05-21 22:13:09] [INFO ] Deduced a trap composed of 35 places in 279 ms of which 3 ms to minimize.
[2024-05-21 22:13:10] [INFO ] Deduced a trap composed of 40 places in 292 ms of which 4 ms to minimize.
[2024-05-21 22:13:10] [INFO ] Deduced a trap composed of 44 places in 280 ms of which 4 ms to minimize.
[2024-05-21 22:13:10] [INFO ] Deduced a trap composed of 47 places in 286 ms of which 4 ms to minimize.
[2024-05-21 22:13:11] [INFO ] Deduced a trap composed of 43 places in 366 ms of which 4 ms to minimize.
[2024-05-21 22:13:11] [INFO ] Deduced a trap composed of 38 places in 260 ms of which 3 ms to minimize.
[2024-05-21 22:13:11] [INFO ] Deduced a trap composed of 56 places in 251 ms of which 4 ms to minimize.
[2024-05-21 22:13:12] [INFO ] Deduced a trap composed of 36 places in 255 ms of which 3 ms to minimize.
[2024-05-21 22:13:12] [INFO ] Deduced a trap composed of 32 places in 297 ms of which 4 ms to minimize.
[2024-05-21 22:13:12] [INFO ] Deduced a trap composed of 39 places in 285 ms of which 3 ms to minimize.
[2024-05-21 22:13:13] [INFO ] Deduced a trap composed of 45 places in 302 ms of which 4 ms to minimize.
[2024-05-21 22:13:13] [INFO ] Deduced a trap composed of 32 places in 288 ms of which 4 ms to minimize.
[2024-05-21 22:13:13] [INFO ] Deduced a trap composed of 32 places in 280 ms of which 4 ms to minimize.
[2024-05-21 22:13:13] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:13:17] [INFO ] Deduced a trap composed of 32 places in 277 ms of which 3 ms to minimize.
[2024-05-21 22:13:18] [INFO ] Deduced a trap composed of 23 places in 287 ms of which 4 ms to minimize.
[2024-05-21 22:13:18] [INFO ] Deduced a trap composed of 40 places in 258 ms of which 4 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 31 places in 213 ms of which 3 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 31 places in 197 ms of which 2 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 3 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 32 places in 242 ms of which 3 ms to minimize.
[2024-05-21 22:13:19] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 3 ms to minimize.
[2024-05-21 22:13:20] [INFO ] Deduced a trap composed of 40 places in 183 ms of which 3 ms to minimize.
[2024-05-21 22:13:20] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 3 ms to minimize.
[2024-05-21 22:13:20] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 2 ms to minimize.
[2024-05-21 22:13:21] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 2 ms to minimize.
[2024-05-21 22:13:21] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 3 ms to minimize.
[2024-05-21 22:13:21] [INFO ] Deduced a trap composed of 41 places in 174 ms of which 3 ms to minimize.
[2024-05-21 22:13:21] [INFO ] Deduced a trap composed of 41 places in 152 ms of which 2 ms to minimize.
[2024-05-21 22:13:22] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 3 ms to minimize.
[2024-05-21 22:13:22] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 2 ms to minimize.
[2024-05-21 22:13:23] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2024-05-21 22:13:24] [INFO ] Deduced a trap composed of 15 places in 242 ms of which 3 ms to minimize.
[2024-05-21 22:13:24] [INFO ] Deduced a trap composed of 23 places in 269 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/683 variables, and 71 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/236 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:13:29] [INFO ] Deduced a trap composed of 44 places in 285 ms of which 4 ms to minimize.
[2024-05-21 22:13:30] [INFO ] Deduced a trap composed of 43 places in 302 ms of which 4 ms to minimize.
[2024-05-21 22:13:31] [INFO ] Deduced a trap composed of 41 places in 213 ms of which 3 ms to minimize.
[2024-05-21 22:13:32] [INFO ] Deduced a trap composed of 31 places in 176 ms of which 3 ms to minimize.
[2024-05-21 22:13:32] [INFO ] Deduced a trap composed of 44 places in 195 ms of which 2 ms to minimize.
[2024-05-21 22:13:32] [INFO ] Deduced a trap composed of 44 places in 174 ms of which 2 ms to minimize.
[2024-05-21 22:13:33] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 3 ms to minimize.
[2024-05-21 22:13:33] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 2 ms to minimize.
[2024-05-21 22:13:33] [INFO ] Deduced a trap composed of 19 places in 208 ms of which 3 ms to minimize.
[2024-05-21 22:13:35] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 10/81 constraints. Problems are: Problem set: 0 solved, 446 unsolved
[2024-05-21 22:13:38] [INFO ] Deduced a trap composed of 43 places in 191 ms of which 3 ms to minimize.
[2024-05-21 22:13:39] [INFO ] Deduced a trap composed of 32 places in 290 ms of which 3 ms to minimize.
[2024-05-21 22:13:39] [INFO ] Deduced a trap composed of 40 places in 262 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD373 is UNSAT
At refinement iteration 6 (OVERLAPS) 447/683 variables, 236/320 constraints. Problems are: Problem set: 2 solved, 444 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/683 variables, 444/764 constraints. Problems are: Problem set: 2 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 683/683 variables, and 764 constraints, problems are : Problem set: 2 solved, 444 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 444/446 constraints, Known Traps: 73/73 constraints]
After SMT, in 60799ms problems are : Problem set: 2 solved, 444 unsolved
Search for dead transitions found 2 dead transitions in 60805ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 236/250 places, 445/605 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 235 transition count 445
Applied a total of 1 rules in 5 ms. Remains 235 /236 variables (removed 1) and now considering 445/445 (removed 0) transitions.
// Phase 1: matrix 445 rows 235 cols
[2024-05-21 22:13:55] [INFO ] Computed 11 invariants in 3 ms
[2024-05-21 22:13:55] [INFO ] Implicit Places using invariants in 144 ms returned []
[2024-05-21 22:13:55] [INFO ] Invariant cache hit.
[2024-05-21 22:13:55] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 515 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 235/250 places, 445/605 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61802 ms. Remains : 235/250 places, 445/605 transitions.
[2024-05-21 22:13:55] [INFO ] Flatten gal took : 22 ms
[2024-05-21 22:13:55] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:13:55] [INFO ] Input system was already deterministic with 445 transitions.
[2024-05-21 22:13:55] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:13:55] [INFO ] Flatten gal took : 23 ms
[2024-05-21 22:13:55] [INFO ] Time to serialize gal into /tmp/CTLFireability15231312702466476259.gal : 5 ms
[2024-05-21 22:13:55] [INFO ] Time to serialize properties into /tmp/CTLFireability15034608450900066558.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/CTLFireability15231312702466476259.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15034608450900066558.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 22:14:25] [INFO ] Flatten gal took : 14 ms
[2024-05-21 22:14:25] [INFO ] Applying decomposition
[2024-05-21 22:14:25] [INFO ] Flatten gal took : 14 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/graph14780392891130322682.txt' '-o' '/tmp/graph14780392891130322682.bin' '-w' '/tmp/graph14780392891130322682.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14780392891130322682.bin' '-l' '-1' '-v' '-w' '/tmp/graph14780392891130322682.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:14:25] [INFO ] Decomposing Gal with order
[2024-05-21 22:14:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:14:25] [INFO ] Removed a total of 848 redundant transitions.
[2024-05-21 22:14:25] [INFO ] Flatten gal took : 28 ms
[2024-05-21 22:14:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 4 ms.
[2024-05-21 22:14:25] [INFO ] Time to serialize gal into /tmp/CTLFireability1222615118017750677.gal : 4 ms
[2024-05-21 22:14:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13760896165859676537.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/CTLFireability1222615118017750677.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13760896165859676537.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07288e+12,0.380104,11616,844,112,14918,1365,518,18871,86,7738,0


Converting to forward existential form...Done !
original formula: AX(E(A(AX(EX(((((i3.u17.p56==1)&&(i6.u28.p93==1))&&((i7.i1.u38.p124==1)&&(i10.u45.p149==1)))&&(((i2.u54.p180==1)&&(i14.u65.p217==1))&&(i0...401
=> equivalent forward existential formula: [(EY(Init) * !(E(!((E(!(!((!((E(!((((u2.p6==1)&&(u2.p17==1))&&((i13.i1.u58.p206==1)&&(u2.p246==1)))) U (!((i15.i...1367
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t230, t248, t272, t296, t338, t356, t442, i0.u72.t33, i0.u72.t36, i0.u72.t37, i0....789
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
[2024-05-21 22:14:55] [INFO ] Flatten gal took : 20 ms
[2024-05-21 22:14:55] [INFO ] Flatten gal took : 20 ms
[2024-05-21 22:14:55] [INFO ] Applying decomposition
[2024-05-21 22:14:56] [INFO ] Flatten gal took : 23 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/graph17226187862552023037.txt' '-o' '/tmp/graph17226187862552023037.bin' '-w' '/tmp/graph17226187862552023037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17226187862552023037.bin' '-l' '-1' '-v' '-w' '/tmp/graph17226187862552023037.weights' '-q' '0' '-e' '0.001'
[2024-05-21 22:14:56] [INFO ] Decomposing Gal with order
[2024-05-21 22:14:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:14:56] [INFO ] Removed a total of 1216 redundant transitions.
[2024-05-21 22:14:56] [INFO ] Flatten gal took : 45 ms
[2024-05-21 22:14:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 5 ms.
[2024-05-21 22:14:56] [INFO ] Time to serialize gal into /tmp/CTLFireability12539077716491076278.gal : 3 ms
[2024-05-21 22:14:56] [INFO ] Time to serialize properties into /tmp/CTLFireability11220338830569971949.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/CTLFireability12539077716491076278.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11220338830569971949.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 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,1.8934e+12,49.6672,1188384,6663,129,363872,7135,621,1.48577e+07,105,43250,0


Converting to forward existential form...Done !
original formula: AX((((EF(((EX((((i8.u2.p6==0)||(i8.u2.p17==0))||((i4.u28.p113==0)||(i8.u2.p246==0)))) + ((((i8.u2.p6==0)||(i8.u2.p14==0))||((i7.u63.p206=...1075
=> equivalent forward existential formula: ((([(EY(Init) * !(E(TRUE U ((EX((((i8.u2.p6==0)||(i8.u2.p17==0))||((i4.u28.p113==0)||(i8.u2.p246==0)))) + ((((i8...1281
Reverse transition relation is NOT exact ! Due to transitions t43, t91, t118, t135, t146, t173, t200, t226, t233, t235, t239, t287, t383, t455, i0.t37, i0....818
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-21 22:20:46] [INFO ] Applying decomposition
[2024-05-21 22:20:47] [INFO ] Flatten gal took : 26 ms
[2024-05-21 22:20:47] [INFO ] Decomposing Gal with order
[2024-05-21 22:20:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-21 22:20:47] [INFO ] Removed a total of 1559 redundant transitions.
[2024-05-21 22:20:47] [INFO ] Flatten gal took : 40 ms
[2024-05-21 22:20:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 7 ms.
[2024-05-21 22:20:47] [INFO ] Time to serialize gal into /tmp/CTLFireability18181841208982003452.gal : 2 ms
[2024-05-21 22:20:47] [INFO ] Time to serialize properties into /tmp/CTLFireability2446184181089051475.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/CTLFireability18181841208982003452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2446184181089051475.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,1.8934e+12,0.093904,6220,489,786,2811,2229,223,7569,262,11158,0


Converting to forward existential form...Done !
original formula: AX((((EF(((EX((((i0.u2.p6==0)||(i0.u3.p17==0))||((i1.i0.i0.i0.i0.i0.u13.p113==0)||(i1.i0.u17.p246==0)))) + ((((i0.u2.p6==0)||(i0.u3.p14==...1429
=> equivalent forward existential formula: ((([(EY(Init) * !(E(TRUE U ((EX((((i0.u2.p6==0)||(i0.u3.p17==0))||((i1.i0.i0.i0.i0.i0.u13.p113==0)||(i1.i0.u17.p...1635
Reverse transition relation is NOT exact ! Due to transitions t498, t499, i0.u2.t235, i0.u2.t236, i0.u3.t233, i1.i0.u17.t37, i1.i0.u17.t41, i1.i0.u17.t42, ...1428
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Detected timeout of ITS tools.
[2024-05-21 22:48:31] [INFO ] Flatten gal took : 21 ms
[2024-05-21 22:48:31] [INFO ] Input system was already deterministic with 605 transitions.
[2024-05-21 22:48:31] [INFO ] Transformed 250 places.
[2024-05-21 22:48:31] [INFO ] Transformed 605 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-21 22:48:31] [INFO ] Time to serialize gal into /tmp/CTLFireability8854330524800864601.gal : 5 ms
[2024-05-21 22:48:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13950403253559667843.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/CTLFireability8854330524800864601.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13950403253559667843.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 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,1.8934e+12,48.1492,1023016,2,194568,5,4.69661e+06,6,0,1607,2.46801e+06,0


Converting to forward existential form...Done !

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="AutonomousCar-PT-06b"
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 AutonomousCar-PT-06b, 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 r026-smll-171620167400306"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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