Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Apr 12 08:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 08:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 12 08:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 79K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716343288172

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 02:01:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 02:01:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 02:01:29] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2024-05-22 02:01:29] [INFO ] Transformed 320 places.
[2024-05-22 02:01:29] [INFO ] Transformed 271 transitions.
[2024-05-22 02:01:29] [INFO ] Found NUPN structural information;
[2024-05-22 02:01:29] [INFO ] Parsed PT model containing 320 places and 271 transitions and 827 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 124 out of 320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 320/320 places, 271/271 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 318 transition count 271
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 309 transition count 262
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 309 transition count 262
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 306 transition count 259
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 306 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 306 transition count 258
Applied a total of 27 rules in 70 ms. Remains 306 /320 variables (removed 14) and now considering 258/271 (removed 13) transitions.
// Phase 1: matrix 258 rows 306 cols
[2024-05-22 02:01:29] [INFO ] Computed 63 invariants in 31 ms
[2024-05-22 02:01:29] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-05-22 02:01:29] [INFO ] Invariant cache hit.
[2024-05-22 02:01:30] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
Running 257 sub problems to find dead transitions.
[2024-05-22 02:01:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 2 (OVERLAPS) 2/306 variables, 34/49 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/306 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 258/564 variables, 306/369 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-22 02:01:35] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 22 ms to minimize.
[2024-05-22 02:01:35] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 3 ms to minimize.
[2024-05-22 02:01:35] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:01:35] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:01:35] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-05-22 02:01:35] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-05-22 02:01:35] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 2 ms to minimize.
[2024-05-22 02:01:35] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-22 02:01:35] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:01:35] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:01:36] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:01:36] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 1 ms to minimize.
[2024-05-22 02:01:36] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:01:36] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:01:36] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:01:36] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:01:36] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:01:36] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:01:36] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:01:37] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/564 variables, 20/389 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-22 02:01:39] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:01:40] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-05-22 02:01:40] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/564 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-22 02:01:42] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:01:42] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:01:42] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:01:42] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-05-22 02:01:43] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-22 02:01:43] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:01:43] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:01:43] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:01:43] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-22 02:01:43] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-22 02:01:43] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:01:43] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-22 02:01:43] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-22 02:01:43] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:01:44] [INFO ] Deduced a trap composed of 47 places in 81 ms of which 2 ms to minimize.
[2024-05-22 02:01:44] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-22 02:01:44] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:01:44] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-22 02:01:44] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:01:44] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-22 02:01:45] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-05-22 02:01:45] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 3 ms to minimize.
[2024-05-22 02:01:45] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-22 02:01:45] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-22 02:01:45] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
[2024-05-22 02:01:45] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-22 02:01:46] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:01:46] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-05-22 02:01:46] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:01:47] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:01:47] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 11/423 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-22 02:01:50] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:01:50] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-22 02:01:52] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:01:52] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-22 02:01:52] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 0 ms to minimize.
[2024-05-22 02:01:52] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 4/429 constraints. Problems are: Problem set: 0 solved, 257 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 257 unsolved
[2024-05-22 02:02:00] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-05-22 02:02:00] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
SMT process timed out in 30125ms, After SMT, problems are : Problem set: 0 solved, 257 unsolved
Search for dead transitions found 0 dead transitions in 30139ms
Starting structural reductions in LTL mode, iteration 1 : 306/320 places, 258/271 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30911 ms. Remains : 306/320 places, 258/271 transitions.
Support contains 124 out of 306 places after structural reductions.
[2024-05-22 02:02:00] [INFO ] Flatten gal took : 47 ms
[2024-05-22 02:02:00] [INFO ] Flatten gal took : 19 ms
[2024-05-22 02:02:00] [INFO ] Input system was already deterministic with 258 transitions.
Support contains 117 out of 306 places (down from 124) after GAL structural reductions.
RANDOM walk for 40000 steps (340 resets) in 1994 ms. (20 steps per ms) remains 10/80 properties
BEST_FIRST walk for 40003 steps (48 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (41 resets) in 171 ms. (232 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (42 resets) in 140 ms. (283 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (47 resets) in 158 ms. (251 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (46 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (48 resets) in 80 ms. (493 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (47 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (47 resets) in 115 ms. (344 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (54 resets) in 73 ms. (540 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (49 resets) in 60 ms. (655 steps per ms) remains 9/9 properties
[2024-05-22 02:02:01] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 134/155 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 47/202 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 94/296 variables, 27/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 3/299 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 253/552 variables, 299/362 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 9/561 variables, 5/367 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/561 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 3/564 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/564 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/564 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 369 constraints, problems are : Problem set: 0 solved, 9 unsolved in 675 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 134/155 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 47/202 variables, 7/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp47 is UNSAT
At refinement iteration 6 (OVERLAPS) 94/296 variables, 27/62 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 3/299 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 253/552 variables, 299/362 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/552 variables, 8/370 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/552 variables, 0/370 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 9/561 variables, 5/375 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/561 variables, 0/375 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 3/564 variables, 2/377 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-22 02:02:03] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-22 02:02:03] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/564 variables, 2/379 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-22 02:02:04] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:02:04] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/564 variables, 2/381 constraints. Problems are: Problem set: 1 solved, 8 unsolved
[2024-05-22 02:02:04] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/564 variables, 1/382 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/564 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 0/564 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 382 constraints, problems are : Problem set: 1 solved, 8 unsolved in 2611 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 306/306 constraints, PredecessorRefiner: 8/9 constraints, Known Traps: 5/5 constraints]
After SMT, in 3301ms problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 1 properties in 12305 ms.
Support contains 15 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 303 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 303 transition count 236
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 284 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 283 transition count 235
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 42 place count 283 transition count 228
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 56 place count 276 transition count 228
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 69 place count 263 transition count 215
Iterating global reduction 3 with 13 rules applied. Total rules applied 82 place count 263 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 87 place count 263 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 88 place count 262 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 88 place count 262 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 92 place count 260 transition count 208
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 99 place count 253 transition count 201
Iterating global reduction 5 with 7 rules applied. Total rules applied 106 place count 253 transition count 201
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 114 place count 253 transition count 193
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 116 place count 252 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 116 place count 252 transition count 191
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 118 place count 251 transition count 191
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 7 with 146 rules applied. Total rules applied 264 place count 178 transition count 118
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 270 place count 175 transition count 126
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 272 place count 175 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 274 place count 173 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 275 place count 172 transition count 123
Applied a total of 275 rules in 98 ms. Remains 172 /306 variables (removed 134) and now considering 123/258 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 172/306 places, 123/258 transitions.
RANDOM walk for 40000 steps (1550 resets) in 507 ms. (78 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (286 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (309 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (288 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (269 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (267 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (273 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (317 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 1187051 steps, run timeout after 3001 ms. (steps per millisecond=395 ) properties seen :5 out of 7
Probabilistic random walk after 1187051 steps, saw 170884 distinct states, run finished after 3004 ms. (steps per millisecond=395 ) properties seen :5
// Phase 1: matrix 123 rows 172 cols
[2024-05-22 02:02:21] [INFO ] Computed 63 invariants in 9 ms
[2024-05-22 02:02:21] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/64 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 74/138 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/145 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 19/164 variables, 5/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 121/285 variables, 164/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 16/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 10/295 variables, 8/248 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/295 variables, 3/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/295 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/295 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 251 constraints, problems are : Problem set: 0 solved, 2 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 172/172 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/10 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 54/64 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 74/138 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 02:02:21] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/145 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 19/164 variables, 5/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 121/285 variables, 164/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/285 variables, 16/241 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/285 variables, 2/243 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 02:02:21] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/285 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 10/295 variables, 8/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/295 variables, 3/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/295 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/295 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 255 constraints, problems are : Problem set: 0 solved, 2 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 30/30 constraints, State Equation: 172/172 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 475ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 166 ms.
Support contains 1 out of 172 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 172/172 places, 123/123 transitions.
Graph (complete) has 505 edges and 172 vertex of which 171 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 171 transition count 121
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 171 transition count 120
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 170 transition count 120
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 12 place count 166 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 165 transition count 115
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 165 transition count 115
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 22 place count 165 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 164 transition count 106
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 162 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 161 transition count 104
Applied a total of 27 rules in 24 ms. Remains 161 /172 variables (removed 11) and now considering 104/123 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 161/172 places, 104/123 transitions.
RANDOM walk for 40000 steps (1886 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (384 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 186979 steps, run visited all 1 properties in 303 ms. (steps per millisecond=617 )
Probabilistic random walk after 186979 steps, saw 48499 distinct states, run finished after 306 ms. (steps per millisecond=611 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-22 02:02:22] [INFO ] Flatten gal took : 21 ms
[2024-05-22 02:02:22] [INFO ] Flatten gal took : 15 ms
[2024-05-22 02:02:22] [INFO ] Input system was already deterministic with 258 transitions.
Computed a total of 102 stabilizing places and 94 stable transitions
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 258
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 286 transition count 239
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 286 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 286 transition count 235
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 51 place count 278 transition count 227
Iterating global reduction 2 with 8 rules applied. Total rules applied 59 place count 278 transition count 227
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 66 place count 278 transition count 220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 277 transition count 219
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 277 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 277 transition count 218
Applied a total of 69 rules in 98 ms. Remains 277 /306 variables (removed 29) and now considering 218/258 (removed 40) transitions.
// Phase 1: matrix 218 rows 277 cols
[2024-05-22 02:02:22] [INFO ] Computed 62 invariants in 10 ms
[2024-05-22 02:02:22] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 02:02:22] [INFO ] Invariant cache hit.
[2024-05-22 02:02:22] [INFO ] Implicit Places using invariants and state equation in 258 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 409 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 276/306 places, 218/258 transitions.
Applied a total of 0 rules in 5 ms. Remains 276 /276 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 512 ms. Remains : 276/306 places, 218/258 transitions.
[2024-05-22 02:02:22] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:02:22] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:02:22] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-22 02:02:22] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:02:22] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:02:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality4850018790276349574.gal : 6 ms
[2024-05-22 02:02:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality9431447834873120990.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/CTLCardinality4850018790276349574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9431447834873120990.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:02:52] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:02:52] [INFO ] Applying decomposition
[2024-05-22 02:02:52] [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/graph16047729001796952378.txt' '-o' '/tmp/graph16047729001796952378.bin' '-w' '/tmp/graph16047729001796952378.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16047729001796952378.bin' '-l' '-1' '-v' '-w' '/tmp/graph16047729001796952378.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:02:52] [INFO ] Decomposing Gal with order
[2024-05-22 02:02:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:02:52] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 02:02:53] [INFO ] Flatten gal took : 43 ms
[2024-05-22 02:02:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 8 ms.
[2024-05-22 02:02:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality9739129781136004984.gal : 8 ms
[2024-05-22 02:02:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality11574772710020174230.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/CTLCardinality9739129781136004984.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11574772710020174230.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.67262e+19,10.8469,222832,18896,542,553480,3365,697,564481,180,11224,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 296 transition count 233
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 277 transition count 233
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 39 place count 277 transition count 224
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 57 place count 268 transition count 224
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 70 place count 255 transition count 211
Iterating global reduction 2 with 13 rules applied. Total rules applied 83 place count 255 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 87 place count 255 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 254 transition count 207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 88 place count 254 transition count 206
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 90 place count 253 transition count 206
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 98 place count 245 transition count 198
Iterating global reduction 4 with 8 rules applied. Total rules applied 106 place count 245 transition count 198
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 9 rules applied. Total rules applied 115 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 117 place count 244 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 117 place count 244 transition count 186
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 121 place count 242 transition count 186
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 261 place count 172 transition count 116
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 262 place count 172 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 264 place count 170 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 265 place count 169 transition count 114
Applied a total of 265 rules in 61 ms. Remains 169 /306 variables (removed 137) and now considering 114/258 (removed 144) transitions.
// Phase 1: matrix 114 rows 169 cols
[2024-05-22 02:03:23] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 02:03:23] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-22 02:03:23] [INFO ] Invariant cache hit.
[2024-05-22 02:03:23] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 353 ms to find 0 implicit places.
[2024-05-22 02:03:23] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-22 02:03:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 110 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 3/168 variables, 11/58 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 114/282 variables, 168/226 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:03:24] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:03:24] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-22 02:03:25] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:03:25] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 4/230 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:03:25] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 1/283 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 110 unsolved
[2024-05-22 02:03:26] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 3 ms to minimize.
[2024-05-22 02:03:26] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:03:26] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:03:26] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:03:26] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:03:27] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/283 variables, 6/238 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/283 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 238 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5290 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 14/47 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 10/57 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 3/168 variables, 11/68 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 114/282 variables, 168/237 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 110/347 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 1/283 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/283 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 348 constraints, problems are : Problem set: 0 solved, 110 unsolved in 15840 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 11/11 constraints]
After SMT, in 21152ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 21153ms
Starting structural reductions in SI_CTL mode, iteration 1 : 169/306 places, 114/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21575 ms. Remains : 169/306 places, 114/258 transitions.
[2024-05-22 02:03:44] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:03:44] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:03:44] [INFO ] Input system was already deterministic with 114 transitions.
RANDOM walk for 13 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
FORMULA DES-PT-10b-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 02:03:44] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:03:44] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:03:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6002880989164744849.gal : 1 ms
[2024-05-22 02:03:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15652158907441368035.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/ReachabilityCardinality6002880989164744849.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15652158907441368035.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 SI_CTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 296 transition count 234
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 278 transition count 234
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 37 place count 278 transition count 226
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 53 place count 270 transition count 226
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 66 place count 257 transition count 213
Iterating global reduction 2 with 13 rules applied. Total rules applied 79 place count 257 transition count 213
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 84 place count 257 transition count 208
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 256 transition count 208
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 85 place count 256 transition count 206
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 89 place count 254 transition count 206
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 96 place count 247 transition count 199
Iterating global reduction 4 with 7 rules applied. Total rules applied 103 place count 247 transition count 199
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 8 rules applied. Total rules applied 111 place count 247 transition count 191
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 113 place count 246 transition count 190
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 113 place count 246 transition count 188
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 117 place count 244 transition count 188
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 6 with 130 rules applied. Total rules applied 247 place count 179 transition count 123
Applied a total of 247 rules in 38 ms. Remains 179 /306 variables (removed 127) and now considering 123/258 (removed 135) transitions.
// Phase 1: matrix 123 rows 179 cols
[2024-05-22 02:03:44] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 02:03:44] [INFO ] Implicit Places using invariants in 107 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 178/306 places, 123/258 transitions.
Applied a total of 0 rules in 4 ms. Remains 178 /178 variables (removed 0) and now considering 123/123 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 151 ms. Remains : 178/306 places, 123/258 transitions.
[2024-05-22 02:03:44] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:03:44] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:03:44] [INFO ] Input system was already deterministic with 123 transitions.
[2024-05-22 02:03:44] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:03:44] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:03:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality11033668161084639812.gal : 2 ms
[2024-05-22 02:03:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality3410536058804495616.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/CTLCardinality11033668161084639812.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3410536058804495616.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.82388e+13,0.655848,30724,4204,681,76427,2671,430,57676,164,12061,0


Converting to forward existential form...Done !
original formula: A(((i10.u4.p50==1)&&(i7.i1.u28.p259!=1)) U A(EF(((i2.i2.u6.p110==0)||(u16.p13==1))) U E(!((((((i7.i3.u34.p261==0)||(i2.i0.u9.p138==1))||(...253
=> equivalent forward existential formula: [((Init * !(EG(!(!((E(!(E(!((((((i7.i3.u34.p261==0)||(i2.i0.u9.p138==1))||((i2.i1.u10.p135==0)||(i0.u2.p38==1)))...1699
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t76, t80, t82, t103, t108, t111, u15.t40, u16.t90, u47.t3, u47.t113, i0.t13, i0.u2.t2...461
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 296 transition count 234
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 278 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 277 transition count 233
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 39 place count 277 transition count 224
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 57 place count 268 transition count 224
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 71 place count 254 transition count 210
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 254 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 90 place count 254 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 91 place count 253 transition count 205
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 91 place count 253 transition count 203
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 95 place count 251 transition count 203
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 103 place count 243 transition count 195
Iterating global reduction 5 with 8 rules applied. Total rules applied 111 place count 243 transition count 195
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 9 rules applied. Total rules applied 120 place count 243 transition count 186
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 122 place count 242 transition count 185
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 122 place count 242 transition count 183
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 126 place count 240 transition count 183
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 7 with 142 rules applied. Total rules applied 268 place count 169 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 270 place count 167 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 271 place count 166 transition count 110
Applied a total of 271 rules in 37 ms. Remains 166 /306 variables (removed 140) and now considering 110/258 (removed 148) transitions.
// Phase 1: matrix 110 rows 166 cols
[2024-05-22 02:04:45] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 02:04:45] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-22 02:04:45] [INFO ] Invariant cache hit.
[2024-05-22 02:04:45] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-05-22 02:04:45] [INFO ] Redundant transitions in 1 ms returned []
Running 107 sub problems to find dead transitions.
[2024-05-22 02:04:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 2/165 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 110/275 variables, 165/223 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:04:46] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:04:47] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-05-22 02:04:47] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-22 02:04:47] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/275 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:04:47] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:04:48] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/276 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
[2024-05-22 02:04:49] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/276 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 13 (OVERLAPS) 0/276 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 231 constraints, problems are : Problem set: 0 solved, 107 unsolved in 6592 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 2/165 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 110/275 variables, 165/230 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 107/337 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/276 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/276 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/276 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 338 constraints, problems are : Problem set: 0 solved, 107 unsolved in 12117 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 166/166 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 7/7 constraints]
After SMT, in 18730ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 18732ms
Starting structural reductions in SI_CTL mode, iteration 1 : 166/306 places, 110/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19020 ms. Remains : 166/306 places, 110/258 transitions.
[2024-05-22 02:05:04] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:05:04] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:05:04] [INFO ] Input system was already deterministic with 110 transitions.
[2024-05-22 02:05:04] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:05:04] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:05:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality3566075023842074991.gal : 3 ms
[2024-05-22 02:05:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality18446452880831632170.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/CTLCardinality3566075023842074991.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18446452880831632170.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:05:34] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:05:34] [INFO ] Applying decomposition
[2024-05-22 02:05:34] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14325018771624739317.txt' '-o' '/tmp/graph14325018771624739317.bin' '-w' '/tmp/graph14325018771624739317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14325018771624739317.bin' '-l' '-1' '-v' '-w' '/tmp/graph14325018771624739317.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:05:34] [INFO ] Decomposing Gal with order
[2024-05-22 02:05:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:05:34] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 02:05:34] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:05:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2024-05-22 02:05:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality9451018711031080222.gal : 2 ms
[2024-05-22 02:05:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality15369694374210543438.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/CTLCardinality9451018711031080222.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15369694374210543438.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.78053e+13,0.391442,19144,2086,469,43193,1362,337,30941,154,5384,0


Converting to forward existential form...Done !
original formula: EG((i8.u39.p264==0))
=> equivalent forward existential formula: [FwdG(Init,(i8.u39.p264==0))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,1.45132,59536,1,0,150719,4748,1274,172912,822,19764,181762
FORMULA DES-PT-10b-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 296 transition count 233
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 277 transition count 233
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 39 place count 277 transition count 226
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 53 place count 270 transition count 226
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 67 place count 256 transition count 212
Iterating global reduction 2 with 14 rules applied. Total rules applied 81 place count 256 transition count 212
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 86 place count 256 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 255 transition count 207
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 87 place count 255 transition count 205
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 91 place count 253 transition count 205
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 99 place count 245 transition count 197
Iterating global reduction 4 with 8 rules applied. Total rules applied 107 place count 245 transition count 197
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 9 rules applied. Total rules applied 116 place count 245 transition count 188
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 118 place count 244 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 118 place count 244 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 122 place count 242 transition count 185
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 6 with 138 rules applied. Total rules applied 260 place count 173 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 262 place count 171 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 263 place count 170 transition count 114
Applied a total of 263 rules in 30 ms. Remains 170 /306 variables (removed 136) and now considering 114/258 (removed 144) transitions.
// Phase 1: matrix 114 rows 170 cols
[2024-05-22 02:05:35] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 02:05:35] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-22 02:05:35] [INFO ] Invariant cache hit.
[2024-05-22 02:05:36] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2024-05-22 02:05:36] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-22 02:05:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 1/168 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 13/57 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (OVERLAPS) 1/169 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 114/283 variables, 169/227 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/283 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 1/284 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-22 02:05:39] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:05:39] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:05:39] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:05:39] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-22 02:05:39] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:05:39] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:05:39] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 7/235 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 13 (OVERLAPS) 0/284 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 235 constraints, problems are : Problem set: 0 solved, 111 unsolved in 5255 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 1/168 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 1/169 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 114/283 variables, 169/234 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/283 variables, 111/345 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-22 02:05:44] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/283 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 111 unsolved
[2024-05-22 02:05:49] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/283 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/283 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 15 (OVERLAPS) 1/284 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/284 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 17 (OVERLAPS) 0/284 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 348 constraints, problems are : Problem set: 0 solved, 111 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 9/9 constraints]
After SMT, in 35283ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 35284ms
Starting structural reductions in SI_CTL mode, iteration 1 : 170/306 places, 114/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35574 ms. Remains : 170/306 places, 114/258 transitions.
[2024-05-22 02:06:11] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:06:11] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:06:11] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-22 02:06:11] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:06:11] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:06:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality4117483533773167996.gal : 1 ms
[2024-05-22 02:06:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality2473111527778693575.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/CTLCardinality4117483533773167996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2473111527778693575.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:06:41] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:06:41] [INFO ] Applying decomposition
[2024-05-22 02:06:41] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11832756445566195538.txt' '-o' '/tmp/graph11832756445566195538.bin' '-w' '/tmp/graph11832756445566195538.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11832756445566195538.bin' '-l' '-1' '-v' '-w' '/tmp/graph11832756445566195538.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:06:41] [INFO ] Decomposing Gal with order
[2024-05-22 02:06:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:06:41] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-22 02:06:41] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:06:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 6 ms.
[2024-05-22 02:06:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality15747854453629506084.gal : 2 ms
[2024-05-22 02:06:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality3470593614977669481.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/CTLCardinality15747854453629506084.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3470593614977669481.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.22246e+13,0.317854,17664,2174,470,39089,1934,366,28886,150,5724,0


Converting to forward existential form...Done !
original formula: (AG(((i15.u16.p168==0)&&(i15.u53.p20==1))) + AG(((i1.u8.p123==0)||(i2.u11.p143==1))))
=> equivalent forward existential formula: [(FwdU((Init * !(!(E(TRUE U !(((i15.u16.p168==0)&&(i15.u53.p20==1))))))),TRUE) * !(((i1.u8.p123==0)||(i2.u11.p14...172
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t74, t95, t96, t99, t102, u15.t39, i0.t14, i0.u2.t20, i0.u2.t24, i0.u2.t25, i0.u2.t26...396
(forward)formula 0,0,3.30145,128544,1,0,292757,7461,2238,384528,1159,30195,384661
FORMULA DES-PT-10b-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 258
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 290 transition count 243
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 290 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 290 transition count 239
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 41 place count 284 transition count 233
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 284 transition count 233
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 53 place count 284 transition count 227
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 283 transition count 226
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 283 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 283 transition count 225
Applied a total of 56 rules in 22 ms. Remains 283 /306 variables (removed 23) and now considering 225/258 (removed 33) transitions.
// Phase 1: matrix 225 rows 283 cols
[2024-05-22 02:06:44] [INFO ] Computed 62 invariants in 3 ms
[2024-05-22 02:06:45] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-22 02:06:45] [INFO ] Invariant cache hit.
[2024-05-22 02:06:45] [INFO ] Implicit Places using invariants and state equation in 256 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 529 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 282/306 places, 225/258 transitions.
Applied a total of 0 rules in 13 ms. Remains 282 /282 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 564 ms. Remains : 282/306 places, 225/258 transitions.
[2024-05-22 02:06:45] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:06:45] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:06:45] [INFO ] Input system was already deterministic with 225 transitions.
[2024-05-22 02:06:45] [INFO ] Flatten gal took : 20 ms
[2024-05-22 02:06:45] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:06:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality12693192695026072946.gal : 1 ms
[2024-05-22 02:06:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality13077934939982356246.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/CTLCardinality12693192695026072946.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13077934939982356246.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-22 02:07:15] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:07:15] [INFO ] Applying decomposition
[2024-05-22 02:07:15] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17368434677439722520.txt' '-o' '/tmp/graph17368434677439722520.bin' '-w' '/tmp/graph17368434677439722520.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17368434677439722520.bin' '-l' '-1' '-v' '-w' '/tmp/graph17368434677439722520.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:07:15] [INFO ] Decomposing Gal with order
[2024-05-22 02:07:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:07:15] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 02:07:15] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:07:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 02:07:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality8020128084369122193.gal : 4 ms
[2024-05-22 02:07:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality11919367782484341964.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/CTLCardinality8020128084369122193.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11919367782484341964.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.07153e+19,10.064,263080,10385,640,578412,6336,742,782044,188,21648,0


Converting to forward existential form...Done !
original formula: A(((AG((!(((EX((i4.i0.u16.p102==0)) * ((i2.u9.p64==0)||(u36.p173==1))) * (i3.u10.p39==0))) + AF((i10.i0.u68.p285!=1)))) * (i7.u19.p111==1...490
=> equivalent forward existential formula: [((Init * !(EG(!(((E(((i2.u8.p65==0)||(u36.p13==1)) U !(((i1.u2.p27==1)&&(!((i10.i0.u69.p286==0)||(i13.u78.p316=...1702
Reverse transition relation is NOT exact ! Due to transitions t0, t9, t57, t88, t124, t166, t185, t186, t218, u36.t77, i0.u17.t107, i0.u17.t108, i1.u34.t80...920
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 258
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 286 transition count 239
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 286 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 286 transition count 235
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 52 place count 277 transition count 226
Iterating global reduction 2 with 9 rules applied. Total rules applied 61 place count 277 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 68 place count 277 transition count 219
Applied a total of 68 rules in 17 ms. Remains 277 /306 variables (removed 29) and now considering 219/258 (removed 39) transitions.
// Phase 1: matrix 219 rows 277 cols
[2024-05-22 02:07:45] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 02:07:45] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 02:07:45] [INFO ] Invariant cache hit.
[2024-05-22 02:07:46] [INFO ] Implicit Places using invariants and state equation in 245 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 370 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 276/306 places, 219/258 transitions.
Applied a total of 0 rules in 3 ms. Remains 276 /276 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 390 ms. Remains : 276/306 places, 219/258 transitions.
[2024-05-22 02:07:46] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:07:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:07:46] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-22 02:07:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:07:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:07:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality5440718319935720378.gal : 1 ms
[2024-05-22 02:07:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality17037132944049608794.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/CTLCardinality5440718319935720378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17037132944049608794.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.16042e+19,3.60423,105304,5183,543,211519,4066,659,257761,173,12194,0


Converting to forward existential form...Done !
original formula: EG(EF(AX((i2.u11.p80==0))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(EX(!((i2.u11.p80==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t162, t180, t181, t213, u32.t79, i0.u75.t17, i0.u75.t143, i1.u14.t109, i2.t115, i2.u...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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 296 transition count 234
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 278 transition count 234
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 37 place count 278 transition count 224
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 57 place count 268 transition count 224
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 70 place count 255 transition count 211
Iterating global reduction 2 with 13 rules applied. Total rules applied 83 place count 255 transition count 211
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 88 place count 255 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 254 transition count 206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 89 place count 254 transition count 204
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 93 place count 252 transition count 204
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 100 place count 245 transition count 197
Iterating global reduction 4 with 7 rules applied. Total rules applied 107 place count 245 transition count 197
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 8 rules applied. Total rules applied 115 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 117 place count 244 transition count 188
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 117 place count 244 transition count 187
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 119 place count 243 transition count 187
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 6 with 140 rules applied. Total rules applied 259 place count 173 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 261 place count 171 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 262 place count 170 transition count 115
Applied a total of 262 rules in 27 ms. Remains 170 /306 variables (removed 136) and now considering 115/258 (removed 143) transitions.
// Phase 1: matrix 115 rows 170 cols
[2024-05-22 02:08:46] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 02:08:46] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-22 02:08:46] [INFO ] Invariant cache hit.
[2024-05-22 02:08:46] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-05-22 02:08:46] [INFO ] Redundant transitions in 2 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-22 02:08:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 112 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/169 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 115/284 variables, 169/227 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-22 02:08:47] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:08:48] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-22 02:08:49] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:08:49] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-22 02:08:49] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:08:50] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:08:50] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/285 variables, 3/235 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-22 02:08:50] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/285 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/285 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 236 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5837 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 2/169 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 115/284 variables, 169/235 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 112/347 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-22 02:08:54] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 1/285 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/285 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 0/285 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 349 constraints, problems are : Problem set: 0 solved, 112 unsolved in 19973 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 9/9 constraints]
After SMT, in 25830ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 25832ms
Starting structural reductions in SI_CTL mode, iteration 1 : 170/306 places, 115/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26157 ms. Remains : 170/306 places, 115/258 transitions.
[2024-05-22 02:09:12] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:09:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 02:09:12] [INFO ] Input system was already deterministic with 115 transitions.
[2024-05-22 02:09:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 02:09:12] [INFO ] Flatten gal took : 3 ms
[2024-05-22 02:09:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality2890829936149012761.gal : 1 ms
[2024-05-22 02:09:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality9714779588046810694.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/CTLCardinality2890829936149012761.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9714779588046810694.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.13411e+13,0.406397,22916,5767,613,55329,1341,345,34587,150,5074,0


Converting to forward existential form...Done !
original formula: !(A(!(A((u16.p34==1) U !(A((i4.u14.p155==0) U (i6.u46.p280==0))))) U (i12.i3.u44.p249==1)))
=> equivalent forward existential formula: ([(((FwdU(Init,!((i12.i3.u44.p249==1))) * !((i12.i3.u44.p249==1))) * !(EG(!(!(!((E(!((i6.u46.p280==0)) U (!((i4....527
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t76, t97, t100, t103, u16.t34, u17.t84, u51.t2, u51.t105, i0.t9, i0.u2.t15, i0.u2.t19...394
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 258
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 287 transition count 240
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 287 transition count 240
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 41 place count 287 transition count 236
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 50 place count 278 transition count 227
Iterating global reduction 2 with 9 rules applied. Total rules applied 59 place count 278 transition count 227
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 66 place count 278 transition count 220
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 67 place count 277 transition count 219
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 277 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 277 transition count 218
Applied a total of 69 rules in 10 ms. Remains 277 /306 variables (removed 29) and now considering 218/258 (removed 40) transitions.
// Phase 1: matrix 218 rows 277 cols
[2024-05-22 02:10:12] [INFO ] Computed 62 invariants in 3 ms
[2024-05-22 02:10:12] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-22 02:10:12] [INFO ] Invariant cache hit.
[2024-05-22 02:10:12] [INFO ] Implicit Places using invariants and state equation in 223 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 344 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 276/306 places, 218/258 transitions.
Applied a total of 0 rules in 3 ms. Remains 276 /276 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 358 ms. Remains : 276/306 places, 218/258 transitions.
[2024-05-22 02:10:12] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:10:12] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:10:13] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-22 02:10:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:10:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:10:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality3100153756508940736.gal : 2 ms
[2024-05-22 02:10:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality11071412486908898273.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/CTLCardinality3100153756508940736.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11071412486908898273.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:10:43] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:10:43] [INFO ] Applying decomposition
[2024-05-22 02:10:43] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14823757579678248838.txt' '-o' '/tmp/graph14823757579678248838.bin' '-w' '/tmp/graph14823757579678248838.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14823757579678248838.bin' '-l' '-1' '-v' '-w' '/tmp/graph14823757579678248838.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:10:43] [INFO ] Decomposing Gal with order
[2024-05-22 02:10:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:10:43] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 02:10:43] [INFO ] Flatten gal took : 14 ms
[2024-05-22 02:10:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 1 ms.
[2024-05-22 02:10:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality7263728634135989740.gal : 2 ms
[2024-05-22 02:10:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality8423734830403435028.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/CTLCardinality7263728634135989740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8423734830403435028.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,2.98707e+19,8.5809,198472,7047,463,459049,3418,673,579715,166,12462,0


Converting to forward existential form...Done !
original formula: (EF(((((i4.u7.p66==0)&&(i6.u71.p299==1))||(i10.u75.p318==0)) * AG((AX(FALSE) * ((EG((i10.u76.p312==0)) + (i6.u65.p285==0)) + (i7.u67.p284...378
=> equivalent forward existential formula: (([FwdG(FwdU((Init * E(TRUE U ((((i4.u7.p66==0)&&(i6.u71.p299==1))||(i10.u75.p318==0)) * !(E(TRUE U !((!(EX(!(FA...880
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t121, t161, t179, t212, i0.u30.t81, i1.u6.t127, i1.u6.t128, i1.u11.t114, i1.u13.t111...777
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 258
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 286 transition count 239
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 286 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 286 transition count 235
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 51 place count 278 transition count 227
Iterating global reduction 2 with 8 rules applied. Total rules applied 59 place count 278 transition count 227
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 65 place count 278 transition count 221
Applied a total of 65 rules in 10 ms. Remains 278 /306 variables (removed 28) and now considering 221/258 (removed 37) transitions.
// Phase 1: matrix 221 rows 278 cols
[2024-05-22 02:11:13] [INFO ] Computed 62 invariants in 5 ms
[2024-05-22 02:11:13] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 02:11:13] [INFO ] Invariant cache hit.
[2024-05-22 02:11:13] [INFO ] Implicit Places using invariants and state equation in 261 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 391 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 277/306 places, 221/258 transitions.
Applied a total of 0 rules in 5 ms. Remains 277 /277 variables (removed 0) and now considering 221/221 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 407 ms. Remains : 277/306 places, 221/258 transitions.
[2024-05-22 02:11:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:11:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:11:13] [INFO ] Input system was already deterministic with 221 transitions.
[2024-05-22 02:11:13] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:11:13] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:11:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality8571775067865643142.gal : 1 ms
[2024-05-22 02:11:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality15444315863139870633.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/CTLCardinality8571775067865643142.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15444315863139870633.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.28719e+19,6.95076,196012,6656,598,464851,4598,745,364123,186,12563,0


Converting to forward existential form...Done !
original formula: EG((EX((i6.i0.u19.p114==1)) + E(((i11.i0.u45.p197==0)||(i3.u10.p81==1)) U (((A(((i9.i1.u41.p189==0)||(i9.i0.u39.p187==1)) U ((i10.i0.u43....254
=> equivalent forward existential formula: [FwdG(Init,(EX((i6.i0.u19.p114==1)) + E(((i11.i0.u45.p197==0)||(i3.u10.p81==1)) U (((!((E(!(((i10.i0.u43.p194==0...412
Reverse transition relation is NOT exact ! Due to transitions t0, t50, t58, t87, t163, t182, t183, t215, i0.u32.t79, i2.t124, i2.u6.t129, i2.u6.t130, i2.u7...841
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 : 306/306 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 258
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 286 transition count 239
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 286 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 43 place count 286 transition count 235
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 52 place count 277 transition count 226
Iterating global reduction 2 with 9 rules applied. Total rules applied 61 place count 277 transition count 226
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 68 place count 277 transition count 219
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 69 place count 276 transition count 218
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 276 transition count 218
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 276 transition count 217
Applied a total of 71 rules in 9 ms. Remains 276 /306 variables (removed 30) and now considering 217/258 (removed 41) transitions.
// Phase 1: matrix 217 rows 276 cols
[2024-05-22 02:12:13] [INFO ] Computed 62 invariants in 4 ms
[2024-05-22 02:12:13] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-22 02:12:13] [INFO ] Invariant cache hit.
[2024-05-22 02:12:14] [INFO ] Implicit Places using invariants and state equation in 233 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 367 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 275/306 places, 217/258 transitions.
Applied a total of 0 rules in 3 ms. Remains 275 /275 variables (removed 0) and now considering 217/217 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 380 ms. Remains : 275/306 places, 217/258 transitions.
[2024-05-22 02:12:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:12:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:12:14] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-22 02:12:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:12:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:12:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality1894449726438476118.gal : 1 ms
[2024-05-22 02:12:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality12020615434453866175.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/CTLCardinality1894449726438476118.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12020615434453866175.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:12:44] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:12:44] [INFO ] Applying decomposition
[2024-05-22 02:12:44] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13891382626058095701.txt' '-o' '/tmp/graph13891382626058095701.bin' '-w' '/tmp/graph13891382626058095701.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13891382626058095701.bin' '-l' '-1' '-v' '-w' '/tmp/graph13891382626058095701.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:12:44] [INFO ] Decomposing Gal with order
[2024-05-22 02:12:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:12:44] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 02:12:44] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:12:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 02:12:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality4464142703228314781.gal : 3 ms
[2024-05-22 02:12:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality5190302097932494282.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/CTLCardinality4464142703228314781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5190302097932494282.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,2.67262e+19,1.54013,58648,4901,593,137851,4446,691,130669,182,14208,0


Converting to forward existential form...Done !
original formula: AG(EX(!(A((i5.u28.p155!=1) U (u74.p18==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!((E(!((u74.p18==1)) U (!((i5.u28.p155!=1)) * !((u74.p18==1)))) + EG(!((u74.p18==1)))...170
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t160, t177, t178, t210, u33.t76, u31.t79, u74.t17, u74.t141, i2.i0.u10.t114, i2.i0.u...837
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 290 transition count 242
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 290 transition count 242
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 290 transition count 240
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 283 transition count 233
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 283 transition count 233
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 55 place count 283 transition count 226
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 282 transition count 225
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 282 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 282 transition count 224
Applied a total of 58 rules in 20 ms. Remains 282 /306 variables (removed 24) and now considering 224/258 (removed 34) transitions.
// Phase 1: matrix 224 rows 282 cols
[2024-05-22 02:13:14] [INFO ] Computed 63 invariants in 5 ms
[2024-05-22 02:13:14] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 02:13:14] [INFO ] Invariant cache hit.
[2024-05-22 02:13:14] [INFO ] Implicit Places using invariants and state equation in 251 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 390 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 281/306 places, 224/258 transitions.
Applied a total of 0 rules in 3 ms. Remains 281 /281 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 413 ms. Remains : 281/306 places, 224/258 transitions.
[2024-05-22 02:13:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:13:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:13:14] [INFO ] Input system was already deterministic with 224 transitions.
[2024-05-22 02:13:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:13:14] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:13:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality5390254150637636364.gal : 1 ms
[2024-05-22 02:13:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality5458861070951144730.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/CTLCardinality5390254150637636364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5458861070951144730.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.48542e+19,8.81254,233480,9608,617,457685,4893,708,1.13469e+06,178,16573,0


Converting to forward existential form...Done !
original formula: A((EF((EF((i8.u3.p49!=1)) + AG(((u78.p21==0)||(i11.i1.u71.p290==1))))) + !(((i1.i1.u21.p118==1) * A(((EF(((i6.u31.p154==0)||(i3.u68.p278=...578
=> equivalent forward existential formula: [((Init * !(EG(!((!(E(TRUE U !(((!(EX(!(!(((i10.i0.u46.p207==0)||(i1.i0.u7.p58==1)))))) * (((((i11.i0.u39.p181==...1458
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t88, t123, t164, t183, t184, t216, u78.t17, u78.t145, i0.i0.u9.t125, i0.i0.u9.t126, ...898
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 296 transition count 233
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 39 place count 277 transition count 233
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 39 place count 277 transition count 224
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 57 place count 268 transition count 224
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 70 place count 255 transition count 211
Iterating global reduction 2 with 13 rules applied. Total rules applied 83 place count 255 transition count 211
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 87 place count 255 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 254 transition count 207
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 88 place count 254 transition count 206
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 90 place count 253 transition count 206
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 98 place count 245 transition count 198
Iterating global reduction 4 with 8 rules applied. Total rules applied 106 place count 245 transition count 198
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 9 rules applied. Total rules applied 115 place count 245 transition count 189
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 117 place count 244 transition count 188
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 117 place count 244 transition count 186
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 121 place count 242 transition count 186
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 6 with 134 rules applied. Total rules applied 255 place count 175 transition count 119
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 256 place count 175 transition count 119
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 258 place count 173 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 259 place count 172 transition count 117
Applied a total of 259 rules in 38 ms. Remains 172 /306 variables (removed 134) and now considering 117/258 (removed 141) transitions.
// Phase 1: matrix 117 rows 172 cols
[2024-05-22 02:14:15] [INFO ] Computed 58 invariants in 1 ms
[2024-05-22 02:14:15] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-22 02:14:15] [INFO ] Invariant cache hit.
[2024-05-22 02:14:15] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-05-22 02:14:15] [INFO ] Redundant transitions in 2 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-22 02:14:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (OVERLAPS) 1/168 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-22 02:14:16] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-22 02:14:16] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-22 02:14:16] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 3/171 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 117/288 variables, 171/232 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-22 02:14:17] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 02:14:18] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:14:18] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-22 02:14:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-22 02:14:18] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 1/289 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-22 02:14:19] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:14:19] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-22 02:14:19] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:14:19] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:14:19] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 5/243 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-22 02:14:21] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 1/244 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-22 02:14:22] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:14:22] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/289 variables, 2/246 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/289 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 17 (OVERLAPS) 0/289 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 246 constraints, problems are : Problem set: 0 solved, 112 unsolved in 8921 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 1/168 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 3/171 variables, 12/69 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-22 02:14:25] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 117/288 variables, 171/246 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 112/358 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 13 (OVERLAPS) 1/289 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 15 (OVERLAPS) 0/289 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 359 constraints, problems are : Problem set: 0 solved, 112 unsolved in 21582 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 172/172 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 17/17 constraints]
After SMT, in 30522ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 30524ms
Starting structural reductions in SI_CTL mode, iteration 1 : 172/306 places, 117/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30813 ms. Remains : 172/306 places, 117/258 transitions.
[2024-05-22 02:14:45] [INFO ] Flatten gal took : 3 ms
[2024-05-22 02:14:45] [INFO ] Flatten gal took : 3 ms
[2024-05-22 02:14:45] [INFO ] Input system was already deterministic with 117 transitions.
[2024-05-22 02:14:45] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:14:45] [INFO ] Flatten gal took : 3 ms
[2024-05-22 02:14:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality8976619915673392828.gal : 1 ms
[2024-05-22 02:14:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality13677032761450148303.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/CTLCardinality8976619915673392828.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13677032761450148303.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.98166e+13,0.375623,19780,2390,675,44425,1790,387,33600,160,7053,0


Converting to forward existential form...Done !
original formula: EF((EF(((i6.i0.i0.u33.p257==0)&&(i6.i1.i0.u25.p217==1))) + ((i11.u5.p99==0)&&(i7.u21.p206==1))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),TRUE) * ((i6.i0.i0.u33.p257==0)&&(i6.i1.i0.u25.p217==1)))] != FALSE + [(FwdU(Init,TRUE) ...204
(forward)formula 0,1,0.463517,19780,1,0,44425,1790,740,33600,321,7053,34851
FORMULA DES-PT-10b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Graph (complete) has 593 edges and 306 vertex of which 297 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 296 transition count 235
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 279 transition count 235
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 279 transition count 225
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 269 transition count 225
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 69 place count 255 transition count 211
Iterating global reduction 2 with 14 rules applied. Total rules applied 83 place count 255 transition count 211
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 88 place count 255 transition count 206
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 89 place count 254 transition count 206
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 89 place count 254 transition count 205
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 91 place count 253 transition count 205
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 99 place count 245 transition count 197
Iterating global reduction 4 with 8 rules applied. Total rules applied 107 place count 245 transition count 197
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 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 9 rules applied. Total rules applied 116 place count 245 transition count 188
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 118 place count 244 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 118 place count 244 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 122 place count 242 transition count 185
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 6 with 142 rules applied. Total rules applied 264 place count 171 transition count 114
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 266 place count 169 transition count 112
Applied a total of 266 rules in 34 ms. Remains 169 /306 variables (removed 137) and now considering 112/258 (removed 146) transitions.
// Phase 1: matrix 112 rows 169 cols
[2024-05-22 02:15:16] [INFO ] Computed 59 invariants in 1 ms
[2024-05-22 02:15:16] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 02:15:16] [INFO ] Invariant cache hit.
[2024-05-22 02:15:16] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-22 02:15:16] [INFO ] Redundant transitions in 1 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-22 02:15:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (OVERLAPS) 1/166 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/166 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (OVERLAPS) 2/168 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 108 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/168 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 112/280 variables, 168/227 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 02:15:19] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 02:15:19] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 02:15:19] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-22 02:15:19] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-22 02:15:19] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 3/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 1/281 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/281 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 02:15:21] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:15:21] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:15:21] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/281 variables, 3/236 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 02:15:21] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/281 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-22 02:15:22] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/281 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/281 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 17 (OVERLAPS) 0/281 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 281/281 variables, and 238 constraints, problems are : Problem set: 0 solved, 108 unsolved in 7678 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 1/166 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 2/168 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 112/280 variables, 168/237 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 108/345 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (OVERLAPS) 1/281 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/281 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (OVERLAPS) 0/281 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 281/281 variables, and 346 constraints, problems are : Problem set: 0 solved, 108 unsolved in 18883 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 169/169 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 10/10 constraints]
After SMT, in 26576ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 26577ms
Starting structural reductions in SI_CTL mode, iteration 1 : 169/306 places, 112/258 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26872 ms. Remains : 169/306 places, 112/258 transitions.
[2024-05-22 02:15:43] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:15:43] [INFO ] Flatten gal took : 3 ms
[2024-05-22 02:15:43] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-22 02:15:43] [INFO ] Flatten gal took : 3 ms
[2024-05-22 02:15:43] [INFO ] Flatten gal took : 3 ms
[2024-05-22 02:15:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality2478161927903283949.gal : 1 ms
[2024-05-22 02:15:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality1331969901336607857.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/CTLCardinality2478161927903283949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1331969901336607857.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.45028e+13,0.360189,18380,2104,624,41101,1533,314,29816,151,6084,0


Converting to forward existential form...Done !
original formula: AF((AF((i0.u2.p85==1)) + (u6.p106==1)))
=> equivalent forward existential formula: [FwdG(Init,!((!(EG(!((i0.u2.p85==1)))) + (u6.p106==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t73, t94, t97, t100, u16.t35, u17.t80, u52.t2, u52.t102, i0.t9, i0.u2.t16, i0.u2.t20,...382
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 289 transition count 241
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 289 transition count 241
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 289 transition count 238
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 46 place count 280 transition count 229
Iterating global reduction 1 with 9 rules applied. Total rules applied 55 place count 280 transition count 229
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 63 place count 280 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 279 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 279 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 279 transition count 219
Applied a total of 66 rules in 18 ms. Remains 279 /306 variables (removed 27) and now considering 219/258 (removed 39) transitions.
// Phase 1: matrix 219 rows 279 cols
[2024-05-22 02:16:43] [INFO ] Computed 63 invariants in 2 ms
[2024-05-22 02:16:43] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-22 02:16:43] [INFO ] Invariant cache hit.
[2024-05-22 02:16:43] [INFO ] Implicit Places using invariants and state equation in 240 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 368 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 278/306 places, 219/258 transitions.
Applied a total of 0 rules in 3 ms. Remains 278 /278 variables (removed 0) and now considering 219/219 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 390 ms. Remains : 278/306 places, 219/258 transitions.
[2024-05-22 02:16:43] [INFO ] Flatten gal took : 8 ms
[2024-05-22 02:16:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 02:16:43] [INFO ] Input system was already deterministic with 219 transitions.
[2024-05-22 02:16:43] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:16:43] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:16:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality2159512537836222851.gal : 1 ms
[2024-05-22 02:16:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality4790216722427101169.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/CTLCardinality2159512537836222851.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4790216722427101169.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:17:13] [INFO ] Flatten gal took : 10 ms
[2024-05-22 02:17:13] [INFO ] Applying decomposition
[2024-05-22 02:17:13] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3636707572282210335.txt' '-o' '/tmp/graph3636707572282210335.bin' '-w' '/tmp/graph3636707572282210335.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3636707572282210335.bin' '-l' '-1' '-v' '-w' '/tmp/graph3636707572282210335.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:17:14] [INFO ] Decomposing Gal with order
[2024-05-22 02:17:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:17:14] [INFO ] Removed a total of 13 redundant transitions.
[2024-05-22 02:17:14] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:17:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-22 02:17:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality6681076364717641872.gal : 2 ms
[2024-05-22 02:17:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality12110291666181280026.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/CTLCardinality6681076364717641872.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12110291666181280026.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.87217e+19,4.07879,132580,6313,461,319525,3428,721,305492,172,11711,0


Converting to forward existential form...Done !
original formula: !(E((i7.i1.u67.p295==0) U (((i8.u33.p6==1) * EX(A(((i8.u33.p15==0)||(i11.u63.p259==1)) U (i10.i0.u38.p214==1)))) + ((EX((((i4.u20.p118==0...322
=> equivalent forward existential formula: ([((EY((FwdU(Init,(i7.i1.u67.p295==0)) * (i8.u33.p6==1))) * !(EG(!((i10.i0.u38.p214==1))))) * !(E(!((i10.i0.u38....493
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t87, t161, t179, t180, u30.t79, i1.t118, i1.u8.t156, i1.u8.t157, i1.u8.t158, i1.u8.t...831
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 258/258 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 258
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 288 transition count 241
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 288 transition count 241
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 288 transition count 238
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 46 place count 280 transition count 230
Iterating global reduction 2 with 8 rules applied. Total rules applied 54 place count 280 transition count 230
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 61 place count 280 transition count 223
Applied a total of 61 rules in 16 ms. Remains 280 /306 variables (removed 26) and now considering 223/258 (removed 35) transitions.
// Phase 1: matrix 223 rows 280 cols
[2024-05-22 02:17:44] [INFO ] Computed 62 invariants in 2 ms
[2024-05-22 02:17:44] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-22 02:17:44] [INFO ] Invariant cache hit.
[2024-05-22 02:17:44] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2024-05-22 02:17:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 5 (OVERLAPS) 223/503 variables, 280/342 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:17:48] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
[2024-05-22 02:17:48] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:17:48] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:17:48] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:17:48] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 2 ms to minimize.
[2024-05-22 02:17:48] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:17:48] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:17:49] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 02:17:49] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:17:49] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:17:49] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:17:49] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:17:49] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:17:49] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-22 02:17:49] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 02:17:49] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:17:49] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:17:49] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 02:17:49] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:17:49] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/362 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:17:51] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-22 02:17:52] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 02:17:52] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:17:52] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:17:52] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-22 02:17:52] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:17:52] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:17:52] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-22 02:17:52] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-22 02:17:53] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:17:53] [INFO ] Deduced a trap composed of 47 places in 55 ms of which 2 ms to minimize.
[2024-05-22 02:17:53] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 12/374 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:17:54] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-22 02:17:55] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 2 ms to minimize.
[2024-05-22 02:17:55] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-05-22 02:17:55] [INFO ] Deduced a trap composed of 41 places in 77 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 4/378 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:17:56] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:18:00] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:18:00] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:18:00] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:18:00] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 1 ms to minimize.
[2024-05-22 02:18:00] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 02:18:01] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 6/385 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:18:02] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-22 02:18:02] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-22 02:18:02] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 02:18:03] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
[2024-05-22 02:18:03] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
[2024-05-22 02:18:03] [INFO ] Deduced a trap composed of 35 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 6/391 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:18:04] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-05-22 02:18:04] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-22 02:18:04] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-22 02:18:05] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/503 variables, 4/395 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 14 (OVERLAPS) 0/503 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 222 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 395 constraints, problems are : Problem set: 0 solved, 222 unsolved in 27321 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/279 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/279 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 2 (OVERLAPS) 1/280 variables, 33/48 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/280 variables, 14/62 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 53/115 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:18:13] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 1 ms to minimize.
[2024-05-22 02:18:13] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:18:13] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 2 ms to minimize.
[2024-05-22 02:18:13] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-22 02:18:13] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-22 02:18:13] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 02:18:13] [INFO ] Deduced a trap composed of 11 places in 17 ms of which 0 ms to minimize.
[2024-05-22 02:18:14] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-22 02:18:14] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-22 02:18:14] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:18:15] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 8 (OVERLAPS) 223/503 variables, 280/406 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 222/628 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-05-22 02:18:22] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:18:22] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2024-05-22 02:18:22] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-05-22 02:18:25] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-22 02:18:29] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 5/633 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/503 variables, and 633 constraints, problems are : Problem set: 0 solved, 222 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 69/69 constraints]
After SMT, in 57363ms problems are : Problem set: 0 solved, 222 unsolved
Search for dead transitions found 0 dead transitions in 57365ms
Starting structural reductions in LTL mode, iteration 1 : 280/306 places, 223/258 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57755 ms. Remains : 280/306 places, 223/258 transitions.
[2024-05-22 02:18:41] [INFO ] Flatten gal took : 4 ms
[2024-05-22 02:18:41] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:18:41] [INFO ] Input system was already deterministic with 223 transitions.
[2024-05-22 02:18:41] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:18:41] [INFO ] Flatten gal took : 5 ms
[2024-05-22 02:18:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality5884394331977076499.gal : 1 ms
[2024-05-22 02:18:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality11784346892131634013.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/CTLCardinality5884394331977076499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11784346892131634013.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 02:19:11] [INFO ] Flatten gal took : 14 ms
[2024-05-22 02:19:11] [INFO ] Applying decomposition
[2024-05-22 02:19:11] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14696831066155590136.txt' '-o' '/tmp/graph14696831066155590136.bin' '-w' '/tmp/graph14696831066155590136.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14696831066155590136.bin' '-l' '-1' '-v' '-w' '/tmp/graph14696831066155590136.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:19:11] [INFO ] Decomposing Gal with order
[2024-05-22 02:19:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:19:11] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-22 02:19:11] [INFO ] Flatten gal took : 11 ms
[2024-05-22 02:19:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-22 02:19:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality13649728578528993040.gal : 2 ms
[2024-05-22 02:19:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality10789161133091283914.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/CTLCardinality13649728578528993040.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10789161133091283914.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.27286e+19,12.4193,330120,8431,574,684543,5429,704,1.30948e+06,167,18554,0


Converting to forward existential form...Done !
original formula: EF((((AG(!(A(((i8.i1.u48.p214==0)||(i6.u33.p162==1)) U (i3.u12.p77==1)))) + ((i7.i0.u47.p207==1)&&(i12.u79.p17==1))) + (AG(((i7.i0.u42.p2...571
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * ((!(E(TRUE U !(!(!((E(!((i3.u12.p77==1)) U (!(((i8.i1.u48.p214==0)||(i6.u33.p162==1))) * ...1891
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t124, t165, t184, t185, t217, u36.t76, i0.u34.t79, i1.i1.t106, i1.i1.u18.t108, i2.u9...894
Detected timeout of ITS tools.
[2024-05-22 02:19:42] [INFO ] Flatten gal took : 9 ms
[2024-05-22 02:19:42] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:19:42] [INFO ] Applying decomposition
[2024-05-22 02:19:42] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10681204443383511789.txt' '-o' '/tmp/graph10681204443383511789.bin' '-w' '/tmp/graph10681204443383511789.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10681204443383511789.bin' '-l' '-1' '-v' '-w' '/tmp/graph10681204443383511789.weights' '-q' '0' '-e' '0.001'
[2024-05-22 02:19:42] [INFO ] Decomposing Gal with order
[2024-05-22 02:19:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:19:42] [INFO ] Removed a total of 34 redundant transitions.
[2024-05-22 02:19:42] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:19:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 1 ms.
[2024-05-22 02:19:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality9022934695422472805.gal : 2 ms
[2024-05-22 02:19:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality13156551187410116552.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/CTLCardinality9022934695422472805.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13156551187410116552.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 12 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.87214e+20,4.57293,142252,5814,566,345874,4690,709,289409,186,15970,0


Converting to forward existential form...Done !
original formula: E(A((i6.u23.p110==1) U AG(AF((i7.u36.p149==0)))) U EX((((i6.u31.p130==1) * EG((i1.u2.p5==1))) * (EF(((i3.u28.p123==0)||(i5.u21.p105==1)))...214
=> equivalent forward existential formula: [(((EY(FwdU(Init,!((E(!(!(E(TRUE U !(!(EG(!((i7.u36.p149==0)))))))) U (!((i6.u23.p110==1)) * !(!(E(TRUE U !(!(EG...403
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t56, t96, t144, t189, t214, u40.t81, i1.u42.t78, i2.t150, i2.u9.t146, i2.u9.t148, i3...933
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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-22 02:21:53] [INFO ] Applying decomposition
[2024-05-22 02:21:53] [INFO ] Flatten gal took : 6 ms
[2024-05-22 02:21:53] [INFO ] Decomposing Gal with order
[2024-05-22 02:21:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 02:21:53] [INFO ] Removed a total of 55 redundant transitions.
[2024-05-22 02:21:53] [INFO ] Flatten gal took : 14 ms
[2024-05-22 02:21:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 7 ms.
[2024-05-22 02:21:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality10074294283248557536.gal : 3 ms
[2024-05-22 02:21:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality14004451980573913994.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/CTLCardinality10074294283248557536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14004451980573913994.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 12 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 02:36:45] [INFO ] Flatten gal took : 20 ms
[2024-05-22 02:36:45] [INFO ] Input system was already deterministic with 258 transitions.
[2024-05-22 02:36:45] [INFO ] Transformed 306 places.
[2024-05-22 02:36:45] [INFO ] Transformed 258 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-22 02:36:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality17346299710228364063.gal : 2 ms
[2024-05-22 02:36:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality7373309674943083530.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/CTLCardinality17346299710228364063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7373309674943083530.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 12 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.87214e+20,167.811,2504460,2,319449,5,1.09016e+07,6,0,1480,1.16789e+07,0


Converting to forward existential form...Done !
original formula: E(A((p110==1) U AG(AF((p149==0)))) U EX((((p130==1) * EG((p5==1))) * (EF(((p123==0)||(p105==1))) * AF(((p218==0)||(p229==1)))))))
=> equivalent forward existential formula: [(((EY(FwdU(Init,!((E(!(!(E(TRUE U !(!(EG(!((p149==0)))))))) U (!((p110==1)) * !(!(E(TRUE U !(!(EG(!((p149==0)))...322
Reverse transition relation is NOT exact ! Due to transitions t0, t17, t25, t31, t34, t36, t39, t50, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, t62,...524

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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10b.tgz
mv DES-PT-10b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;