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-171624189900721.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-40b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189900721
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.2K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 12 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 08:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 115K 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-40b-CTLCardinality-2024-00
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-01
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-02
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-03
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-04
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-05
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-06
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-07
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-08
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-09
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-10
FORMULA_NAME DES-PT-40b-CTLCardinality-2024-11
FORMULA_NAME DES-PT-40b-CTLCardinality-2023-12
FORMULA_NAME DES-PT-40b-CTLCardinality-2023-13
FORMULA_NAME DES-PT-40b-CTLCardinality-2023-14
FORMULA_NAME DES-PT-40b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716354465150

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-40b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 05:07:46] [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 05:07:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 05:07:46] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-22 05:07:46] [INFO ] Transformed 439 places.
[2024-05-22 05:07:46] [INFO ] Transformed 390 transitions.
[2024-05-22 05:07:46] [INFO ] Found NUPN structural information;
[2024-05-22 05:07:46] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
FORMULA DES-PT-40b-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 106 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 390/390 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 420 transition count 371
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 420 transition count 371
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 413 transition count 364
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 413 transition count 364
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 57 place count 413 transition count 359
Applied a total of 57 rules in 98 ms. Remains 413 /439 variables (removed 26) and now considering 359/390 (removed 31) transitions.
// Phase 1: matrix 359 rows 413 cols
[2024-05-22 05:07:46] [INFO ] Computed 65 invariants in 44 ms
[2024-05-22 05:07:47] [INFO ] Implicit Places using invariants in 430 ms returned []
[2024-05-22 05:07:47] [INFO ] Invariant cache hit.
[2024-05-22 05:07:47] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2024-05-22 05:07:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 4/413 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:07:55] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 11 ms to minimize.
[2024-05-22 05:07:55] [INFO ] Deduced a trap composed of 19 places in 127 ms of which 4 ms to minimize.
[2024-05-22 05:07:55] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 2 ms to minimize.
[2024-05-22 05:07:55] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2024-05-22 05:07:56] [INFO ] Deduced a trap composed of 65 places in 106 ms of which 2 ms to minimize.
[2024-05-22 05:07:56] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 3 ms to minimize.
[2024-05-22 05:07:56] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 13 ms to minimize.
[2024-05-22 05:07:56] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
[2024-05-22 05:07:56] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2024-05-22 05:07:56] [INFO ] Deduced a trap composed of 79 places in 175 ms of which 2 ms to minimize.
[2024-05-22 05:07:56] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 2 ms to minimize.
[2024-05-22 05:07:56] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:07:56] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 13/78 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:07:57] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:07:57] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 3 ms to minimize.
[2024-05-22 05:07:57] [INFO ] Deduced a trap composed of 30 places in 93 ms of which 3 ms to minimize.
[2024-05-22 05:07:57] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:07:58] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 2 ms to minimize.
[2024-05-22 05:07:58] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 3 ms to minimize.
[2024-05-22 05:07:58] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 3 ms to minimize.
[2024-05-22 05:07:58] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 3 ms to minimize.
[2024-05-22 05:07:58] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:07:58] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 2 ms to minimize.
[2024-05-22 05:07:59] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-22 05:07:59] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 2 ms to minimize.
[2024-05-22 05:07:59] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-05-22 05:07:59] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:07:59] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 2 ms to minimize.
[2024-05-22 05:07:59] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:07:59] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 2 ms to minimize.
[2024-05-22 05:08:01] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-22 05:08:01] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:08:01] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:08:02] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:08:02] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-22 05:08:03] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:08:03] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 2 ms to minimize.
[2024-05-22 05:08:03] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:08:03] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:08:03] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:08:04] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 8/106 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:08:07] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2024-05-22 05:08:07] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 2 ms to minimize.
[2024-05-22 05:08:07] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-05-22 05:08:07] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:08:07] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 5/111 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:08:08] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:08:08] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:08:08] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:08:08] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:08:08] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 2 ms to minimize.
[2024-05-22 05:08:08] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:08:08] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:08:08] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:08:09] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-22 05:08:09] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-22 05:08:09] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:08:10] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 2 ms to minimize.
[2024-05-22 05:08:10] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:08:10] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:08:10] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 15/126 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:08:12] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-22 05:08:12] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:08:12] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:08:12] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-22 05:08:12] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:08:13] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2024-05-22 05:08:13] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-22 05:08:13] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:08:13] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:08:13] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
[2024-05-22 05:08:13] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 (/ 1.0 26.0))
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 11/137 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/772 variables, and 137 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/413 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (OVERLAPS) 4/413 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 15/65 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 72/137 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:08:20] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:08:20] [INFO ] Deduced a trap composed of 65 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:08:21] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:08:21] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:08:21] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 1 ms to minimize.
[2024-05-22 05:08:21] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:08:21] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
[2024-05-22 05:08:22] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:08:22] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:08:22] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:08:22] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:08:22] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 2 ms to minimize.
[2024-05-22 05:08:24] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 13/150 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:08:25] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:08:25] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:08:25] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:08:30] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 2 ms to minimize.
[2024-05-22 05:08:30] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:08:30] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:08:30] [INFO ] Deduced a trap composed of 63 places in 69 ms of which 2 ms to minimize.
[2024-05-22 05:08:30] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:08:30] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:08:30] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:08:30] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:08:30] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:08:30] [INFO ] Deduced a trap composed of 75 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:08:31] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:08:31] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-05-22 05:08:31] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 13/166 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:08:34] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:08:34] [INFO ] Deduced a trap composed of 66 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:08:34] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:08:35] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-05-22 05:08:35] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:08:35] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 6/172 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:08:38] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
[2024-05-22 05:08:39] [INFO ] Deduced a trap composed of 83 places in 99 ms of which 2 ms to minimize.
[2024-05-22 05:08:39] [INFO ] Deduced a trap composed of 93 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:08:39] [INFO ] Deduced a trap composed of 91 places in 82 ms of which 2 ms to minimize.
[2024-05-22 05:08:39] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 5/177 constraints. Problems are: Problem set: 0 solved, 358 unsolved
[2024-05-22 05:08:43] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 2 ms to minimize.
[2024-05-22 05:08:44] [INFO ] Deduced a trap composed of 51 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:08:45] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/772 variables, and 180 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/413 constraints, PredecessorRefiner: 0/358 constraints, Known Traps: 115/115 constraints]
After SMT, in 60314ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 60333ms
Starting structural reductions in LTL mode, iteration 1 : 413/439 places, 359/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61315 ms. Remains : 413/439 places, 359/390 transitions.
Support contains 106 out of 413 places after structural reductions.
[2024-05-22 05:08:48] [INFO ] Flatten gal took : 54 ms
[2024-05-22 05:08:48] [INFO ] Flatten gal took : 29 ms
[2024-05-22 05:08:48] [INFO ] Input system was already deterministic with 359 transitions.
Support contains 100 out of 413 places (down from 106) after GAL structural reductions.
RANDOM walk for 40000 steps (332 resets) in 1746 ms. (22 steps per ms) remains 23/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
[2024-05-22 05:08:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 258/294 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 75/369 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 44/413 variables, 25/65 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 359/772 variables, 413/478 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-22 05:08:50] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-05-22 05:08:50] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:08:50] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/772 variables, 3/481 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/772 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-22 05:08:51] [INFO ] Deduced a trap composed of 42 places in 117 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/772 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/772 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 0/772 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 772/772 variables, and 482 constraints, problems are : Problem set: 0 solved, 23 unsolved in 3419 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 258/294 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-22 05:08:52] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:08:52] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:08:52] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 75/369 variables, 21/43 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-22 05:08:53] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp17 is UNSAT
At refinement iteration 7 (OVERLAPS) 44/413 variables, 25/69 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 4/73 constraints. Problems are: Problem set: 1 solved, 22 unsolved
[2024-05-22 05:08:53] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:08:53] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2024-05-22 05:08:53] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:08:53] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
Problem AtomicPropp11 is UNSAT
[2024-05-22 05:08:54] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:08:54] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:08:54] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-22 05:08:54] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-22 05:08:54] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 6 ms to minimize.
[2024-05-22 05:08:54] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-22 05:08:54] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:08:54] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:08:54] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:08:54] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:08:55] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:08:55] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:08:55] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:08:55] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:08:55] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:08:55] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
Problem AtomicPropp11 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 20/93 constraints. Problems are: Problem set: 2 solved, 21 unsolved
[2024-05-22 05:08:55] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:08:55] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-05-22 05:08:55] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:08:55] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:08:56] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:08:56] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:08:56] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 7/100 constraints. Problems are: Problem set: 2 solved, 21 unsolved
[2024-05-22 05:08:56] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:08:56] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:08:56] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:08:56] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-05-22 05:08:56] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:08:56] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:08:56] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:08:57] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:08:57] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:08:57] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:08:57] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:08:57] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:08:57] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:08:57] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 14/114 constraints. Problems are: Problem set: 2 solved, 21 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/772 variables, and 114 constraints, problems are : Problem set: 2 solved, 21 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 0/413 constraints, PredecessorRefiner: 0/23 constraints, Known Traps: 49/49 constraints]
After SMT, in 8433ms problems are : Problem set: 2 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 359/359 transitions.
Graph (complete) has 929 edges and 413 vertex of which 406 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 406 transition count 338
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 33 place count 391 transition count 338
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 33 place count 391 transition count 327
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 55 place count 380 transition count 327
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 62 place count 373 transition count 320
Iterating global reduction 2 with 7 rules applied. Total rules applied 69 place count 373 transition count 320
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 373 transition count 318
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 71 place count 373 transition count 317
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 73 place count 372 transition count 317
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 77 place count 368 transition count 313
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 368 transition count 313
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 87 place count 368 transition count 307
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 90 place count 366 transition count 306
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 90 place count 366 transition count 305
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 92 place count 365 transition count 305
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 5 with 140 rules applied. Total rules applied 232 place count 295 transition count 235
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 238 place count 292 transition count 240
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 239 place count 292 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 240 place count 291 transition count 239
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 241 place count 291 transition count 238
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 242 place count 290 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 243 place count 289 transition count 237
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 244 place count 288 transition count 237
Applied a total of 244 rules in 175 ms. Remains 288 /413 variables (removed 125) and now considering 237/359 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 176 ms. Remains : 288/413 places, 237/359 transitions.
RANDOM walk for 40000 steps (1452 resets) in 746 ms. (53 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (22 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (24 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (30 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (17 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (23 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (26 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (25 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (24 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (22 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (24 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (25 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (19 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (24 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (27 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (23 resets) in 27 ms. (142 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (27 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (25 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (24 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (21 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 569778 steps, run timeout after 3001 ms. (steps per millisecond=189 ) properties seen :0 out of 21
Probabilistic random walk after 569778 steps, saw 97284 distinct states, run finished after 3004 ms. (steps per millisecond=189 ) properties seen :0
// Phase 1: matrix 237 rows 288 cols
[2024-05-22 05:09:01] [INFO ] Computed 63 invariants in 8 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 7/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 2/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 194/234 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 30/264 variables, 25/48 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 11/275 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 1/276 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 233/509 variables, 276/334 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/509 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 14/523 variables, 10/344 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/523 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/523 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (OVERLAPS) 2/525 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/525 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/525 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 21 (OVERLAPS) 0/525 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 351 constraints, problems are : Problem set: 0 solved, 21 unsolved in 1905 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 7/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 2/40 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 194/234 variables, 19/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 30/264 variables, 25/48 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 11/275 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 1/276 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 233/509 variables, 276/334 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/509 variables, 17/351 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 05:09:04] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/509 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 05:09:05] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/509 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/509 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (OVERLAPS) 14/523 variables, 10/363 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/523 variables, 4/367 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/523 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 05:09:09] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/523 variables, 1/372 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/523 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 23 (OVERLAPS) 2/525 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/525 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/525 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-22 05:09:13] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/525 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/525 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 28 (OVERLAPS) 0/525 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 525/525 variables, and 376 constraints, problems are : Problem set: 0 solved, 21 unsolved in 13899 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 4/4 constraints]
After SMT, in 15818ms problems are : Problem set: 0 solved, 21 unsolved
Parikh walk visited 0 properties in 7254 ms.
Support contains 31 out of 288 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 237/237 transitions.
Applied a total of 0 rules in 12 ms. Remains 288 /288 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 288/288 places, 237/237 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 288/288 places, 237/237 transitions.
Applied a total of 0 rules in 12 ms. Remains 288 /288 variables (removed 0) and now considering 237/237 (removed 0) transitions.
[2024-05-22 05:09:24] [INFO ] Invariant cache hit.
[2024-05-22 05:09:24] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 05:09:24] [INFO ] Invariant cache hit.
[2024-05-22 05:09:24] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-05-22 05:09:24] [INFO ] Redundant transitions in 9 ms returned []
Running 233 sub problems to find dead transitions.
[2024-05-22 05:09:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 233 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 4/288 variables, 18/63 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 237/525 variables, 288/351 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-22 05:09:29] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:09:30] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:09:30] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 3/354 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-22 05:09:34] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/525 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-22 05:09:37] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:09:37] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:09:37] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 3/358 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 11 (OVERLAPS) 0/525 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 525/525 variables, and 358 constraints, problems are : Problem set: 0 solved, 233 unsolved in 17822 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 10/45 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 4/288 variables, 18/68 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-22 05:09:45] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (OVERLAPS) 237/525 variables, 288/359 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 233/592 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 233 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/525 variables, and 592 constraints, problems are : Problem set: 0 solved, 233 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 8/8 constraints]
After SMT, in 47961ms problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 47964ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48513 ms. Remains : 288/288 places, 237/237 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 8 ms. Remains 288 /288 variables (removed 0) and now considering 237/237 (removed 0) transitions.
Running SMT prover for 21 properties.
[2024-05-22 05:10:12] [INFO ] Invariant cache hit.
[2024-05-22 05:10:12] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2024-05-22 05:10:12] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 05:10:13] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 22 ms returned sat
[2024-05-22 05:10:13] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
TRAPS : Iteration 0
[2024-05-22 05:10:13] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:10:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-22 05:10:14] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-22 05:10:14] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-22 05:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
TRAPS : Iteration 1
[2024-05-22 05:10:14] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:10:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
TRAPS : Iteration 2
[2024-05-22 05:10:15] [INFO ] After 2465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
[2024-05-22 05:10:15] [INFO ] After 3134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Over-approximation ignoring read arcs solved 0 properties in 3306 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2024-05-22 05:10:16] [INFO ] Flatten gal took : 35 ms
[2024-05-22 05:10:16] [INFO ] Flatten gal took : 21 ms
[2024-05-22 05:10:16] [INFO ] Input system was already deterministic with 359 transitions.
Support contains 96 out of 413 places (down from 97) after GAL structural reductions.
Computed a total of 219 stabilizing places and 210 stable transitions
Graph (complete) has 929 edges and 413 vertex of which 402 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.13 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 413/413 places, 359/359 transitions.
Graph (complete) has 929 edges and 413 vertex of which 402 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 401 transition count 339
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 387 transition count 339
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 387 transition count 329
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 49 place count 377 transition count 329
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 57 place count 369 transition count 321
Iterating global reduction 2 with 8 rules applied. Total rules applied 65 place count 369 transition count 321
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 69 place count 369 transition count 317
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 69 place count 369 transition count 315
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 73 place count 367 transition count 315
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 76 place count 364 transition count 312
Iterating global reduction 3 with 3 rules applied. Total rules applied 79 place count 364 transition count 312
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 5 rules applied. Total rules applied 84 place count 364 transition count 307
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 87 place count 362 transition count 306
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 5 with 142 rules applied. Total rules applied 229 place count 291 transition count 235
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 231 place count 289 transition count 233
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 232 place count 288 transition count 233
Applied a total of 232 rules in 126 ms. Remains 288 /413 variables (removed 125) and now considering 233/359 (removed 126) transitions.
// Phase 1: matrix 233 rows 288 cols
[2024-05-22 05:10:16] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 05:10:16] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-22 05:10:16] [INFO ] Invariant cache hit.
[2024-05-22 05:10:16] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-05-22 05:10:16] [INFO ] Redundant transitions in 10 ms returned []
Running 230 sub problems to find dead transitions.
[2024-05-22 05:10:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 2/287 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (OVERLAPS) 233/520 variables, 287/345 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-22 05:10:22] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:10:22] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:10:23] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 3/348 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 8 (OVERLAPS) 1/521 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/521 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 10 (OVERLAPS) 0/521 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 230 unsolved
No progress, stopping.
After SMT solving in domain Real declared 521/521 variables, and 349 constraints, problems are : Problem set: 0 solved, 230 unsolved in 17626 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 230 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/285 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (OVERLAPS) 2/287 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 6 (OVERLAPS) 233/520 variables, 287/348 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 230/578 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2024-05-22 05:10:45] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:10:45] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 2/580 constraints. Problems are: Problem set: 0 solved, 230 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/521 variables, and 580 constraints, problems are : Problem set: 0 solved, 230 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 287/288 constraints, PredecessorRefiner: 230/230 constraints, Known Traps: 5/5 constraints]
After SMT, in 47746ms problems are : Problem set: 0 solved, 230 unsolved
Search for dead transitions found 0 dead transitions in 47749ms
Starting structural reductions in SI_CTL mode, iteration 1 : 288/413 places, 233/359 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48517 ms. Remains : 288/413 places, 233/359 transitions.
[2024-05-22 05:11:04] [INFO ] Flatten gal took : 20 ms
[2024-05-22 05:11:04] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:11:04] [INFO ] Input system was already deterministic with 233 transitions.
[2024-05-22 05:11:04] [INFO ] Flatten gal took : 14 ms
[2024-05-22 05:11:04] [INFO ] Flatten gal took : 14 ms
[2024-05-22 05:11:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality1295855825247611597.gal : 10 ms
[2024-05-22 05:11:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality14616058952785607871.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/CTLCardinality1295855825247611597.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14616058952785607871.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 05:11:34] [INFO ] Flatten gal took : 16 ms
[2024-05-22 05:11:34] [INFO ] Applying decomposition
[2024-05-22 05:11:34] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4273552573563725537.txt' '-o' '/tmp/graph4273552573563725537.bin' '-w' '/tmp/graph4273552573563725537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4273552573563725537.bin' '-l' '-1' '-v' '-w' '/tmp/graph4273552573563725537.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:11:35] [INFO ] Decomposing Gal with order
[2024-05-22 05:11:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:11:35] [INFO ] Removed a total of 42 redundant transitions.
[2024-05-22 05:11:35] [INFO ] Flatten gal took : 73 ms
[2024-05-22 05:11:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 15 ms.
[2024-05-22 05:11:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality2613324606552903969.gal : 10 ms
[2024-05-22 05:11:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality88227446804572721.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/CTLCardinality2613324606552903969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality88227446804572721.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 -...260
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.88336e+14,5.61768,135324,21170,4937,318570,15905,373,304901,388,107909,0


Converting to forward existential form...Done !
original formula: EG((i1.i2.u12.p266==0))
=> equivalent forward existential formula: [FwdG(Init,(i1.i2.u12.p266==0))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 359/359 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 411 transition count 359
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 402 transition count 350
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 402 transition count 350
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 24 place count 402 transition count 346
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 29 place count 397 transition count 341
Iterating global reduction 2 with 5 rules applied. Total rules applied 34 place count 397 transition count 341
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 38 place count 397 transition count 337
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 396 transition count 336
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 396 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 396 transition count 335
Applied a total of 41 rules in 55 ms. Remains 396 /413 variables (removed 17) and now considering 335/359 (removed 24) transitions.
// Phase 1: matrix 335 rows 396 cols
[2024-05-22 05:12:05] [INFO ] Computed 63 invariants in 13 ms
[2024-05-22 05:12:05] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-22 05:12:05] [INFO ] Invariant cache hit.
[2024-05-22 05:12:06] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 885 ms to find 0 implicit places.
Running 334 sub problems to find dead transitions.
[2024-05-22 05:12:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 2/396 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 334 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (OVERLAPS) 335/731 variables, 396/459 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:12:13] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 5 ms to minimize.
[2024-05-22 05:12:13] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-22 05:12:13] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:12:13] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 2 ms to minimize.
[2024-05-22 05:12:13] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-22 05:12:13] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:12:13] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-22 05:12:14] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:12:14] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:12:14] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:12:14] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:12:14] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:12:14] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:12:14] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:12:14] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:12:14] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-22 05:12:15] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
[2024-05-22 05:12:15] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:12:15] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
[2024-05-22 05:12:15] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/731 variables, 20/479 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:12:17] [INFO ] Deduced a trap composed of 34 places in 78 ms of which 1 ms to minimize.
[2024-05-22 05:12:17] [INFO ] Deduced a trap composed of 41 places in 75 ms of which 1 ms to minimize.
[2024-05-22 05:12:17] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/731 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:12:22] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:12:22] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:12:22] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:12:22] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/731 variables, 4/486 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:12:25] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:12:25] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:12:25] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:12:25] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:12:25] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:12:26] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-22 05:12:26] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:12:26] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:12:26] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:12:26] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/731 variables, 10/496 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:12:31] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:12:31] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/731 variables, 2/498 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 731/731 variables, and 498 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/394 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 2/396 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 39/102 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:12:38] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:12:38] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:12:39] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:12:39] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-22 05:12:39] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-05-22 05:12:39] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-22 05:12:41] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 7/109 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:12:41] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:12:41] [INFO ] Deduced a trap composed of 7 places in 109 ms of which 3 ms to minimize.
[2024-05-22 05:12:42] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:12:42] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:12:42] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:12:42] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:12:42] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:12:42] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:12:42] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:12:42] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:12:42] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 11/120 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:12:45] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 9 (OVERLAPS) 335/731 variables, 396/517 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/731 variables, 334/851 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 731/731 variables, and 851 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 58/58 constraints]
After SMT, in 60142ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in LTL mode, iteration 1 : 396/413 places, 335/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61086 ms. Remains : 396/413 places, 335/359 transitions.
[2024-05-22 05:13:06] [INFO ] Flatten gal took : 15 ms
[2024-05-22 05:13:06] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:13:06] [INFO ] Input system was already deterministic with 335 transitions.
[2024-05-22 05:13:06] [INFO ] Flatten gal took : 19 ms
[2024-05-22 05:13:06] [INFO ] Flatten gal took : 11 ms
[2024-05-22 05:13:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality3414628073926428115.gal : 2 ms
[2024-05-22 05:13:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality10432863704232485668.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/CTLCardinality3414628073926428115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10432863704232485668.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 05:13:36] [INFO ] Flatten gal took : 16 ms
[2024-05-22 05:13:36] [INFO ] Applying decomposition
[2024-05-22 05:13:36] [INFO ] Flatten gal took : 11 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/graph726619167170991144.txt' '-o' '/tmp/graph726619167170991144.bin' '-w' '/tmp/graph726619167170991144.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph726619167170991144.bin' '-l' '-1' '-v' '-w' '/tmp/graph726619167170991144.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:13:36] [INFO ] Decomposing Gal with order
[2024-05-22 05:13:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:13:36] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-22 05:13:36] [INFO ] Flatten gal took : 21 ms
[2024-05-22 05:13:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 05:13:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality14288145763451214151.gal : 4 ms
[2024-05-22 05:13:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality14442428705381366151.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/CTLCardinality14288145763451214151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14442428705381366151.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.79931e+20,8.76077,268824,24974,4372,687352,21773,695,451257,396,131411,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 413/413 places, 359/359 transitions.
Graph (complete) has 929 edges and 413 vertex of which 402 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 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 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 401 transition count 341
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 389 transition count 340
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 388 transition count 340
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 27 place count 388 transition count 331
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 45 place count 379 transition count 331
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 53 place count 371 transition count 323
Iterating global reduction 3 with 8 rules applied. Total rules applied 61 place count 371 transition count 323
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 64 place count 371 transition count 320
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 64 place count 371 transition count 318
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 68 place count 369 transition count 318
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 72 place count 365 transition count 314
Iterating global reduction 4 with 4 rules applied. Total rules applied 76 place count 365 transition count 314
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 6 rules applied. Total rules applied 82 place count 365 transition count 308
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 85 place count 363 transition count 307
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 6 with 126 rules applied. Total rules applied 211 place count 300 transition count 244
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 213 place count 298 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 214 place count 297 transition count 242
Applied a total of 214 rules in 60 ms. Remains 297 /413 variables (removed 116) and now considering 242/359 (removed 117) transitions.
// Phase 1: matrix 242 rows 297 cols
[2024-05-22 05:14:06] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 05:14:07] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-22 05:14:07] [INFO ] Invariant cache hit.
[2024-05-22 05:14:07] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2024-05-22 05:14:07] [INFO ] Redundant transitions in 3 ms returned []
Running 239 sub problems to find dead transitions.
[2024-05-22 05:14:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 1/295 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 239 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 2/297 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (OVERLAPS) 242/539 variables, 297/355 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-22 05:14:14] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2024-05-22 05:14:14] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:14:14] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:14:15] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:14:15] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2024-05-22 05:14:15] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-05-22 05:14:16] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
[2024-05-22 05:14:16] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:14:16] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 9/364 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-22 05:14:18] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:14:18] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 2/366 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-22 05:14:20] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 239 unsolved
[2024-05-22 05:14:27] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:14:27] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/539 variables, 2/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/539 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 15 (OVERLAPS) 0/539 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 539/539 variables, and 369 constraints, problems are : Problem set: 0 solved, 239 unsolved in 26792 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/294 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/294 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (OVERLAPS) 1/295 variables, 25/49 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 8 (OVERLAPS) 2/297 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/297 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 11 (OVERLAPS) 242/539 variables, 297/369 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 239/608 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 539/539 variables, and 608 constraints, problems are : Problem set: 0 solved, 239 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 14/14 constraints]
After SMT, in 56921ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 56923ms
Starting structural reductions in SI_CTL mode, iteration 1 : 297/413 places, 242/359 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57658 ms. Remains : 297/413 places, 242/359 transitions.
[2024-05-22 05:15:04] [INFO ] Flatten gal took : 11 ms
[2024-05-22 05:15:04] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:15:04] [INFO ] Input system was already deterministic with 242 transitions.
[2024-05-22 05:15:04] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:15:04] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:15:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality12658136510937614908.gal : 2 ms
[2024-05-22 05:15:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality13465050620149088817.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/CTLCardinality12658136510937614908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13465050620149088817.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 05:15:34] [INFO ] Flatten gal took : 10 ms
[2024-05-22 05:15:34] [INFO ] Applying decomposition
[2024-05-22 05:15:34] [INFO ] Flatten gal took : 9 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/graph5147266172229856754.txt' '-o' '/tmp/graph5147266172229856754.bin' '-w' '/tmp/graph5147266172229856754.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5147266172229856754.bin' '-l' '-1' '-v' '-w' '/tmp/graph5147266172229856754.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:15:34] [INFO ] Decomposing Gal with order
[2024-05-22 05:15:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:15:34] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 05:15:34] [INFO ] Flatten gal took : 18 ms
[2024-05-22 05:15:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 05:15:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality9379061759312839828.gal : 8 ms
[2024-05-22 05:15:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality3558117995156790009.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/CTLCardinality9379061759312839828.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3558117995156790009.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.1205e+15,4.17755,149600,25065,6221,402865,18978,427,246922,395,152730,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 359/359 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 410 transition count 359
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 400 transition count 349
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 400 transition count 349
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 27 place count 400 transition count 345
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 33 place count 394 transition count 339
Iterating global reduction 2 with 6 rules applied. Total rules applied 39 place count 394 transition count 339
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 393 transition count 334
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 393 transition count 333
Applied a total of 46 rules in 27 ms. Remains 393 /413 variables (removed 20) and now considering 333/359 (removed 26) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 05:16:04] [INFO ] Computed 62 invariants in 8 ms
[2024-05-22 05:16:04] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-22 05:16:04] [INFO ] Invariant cache hit.
[2024-05-22 05:16:05] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:16:05] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:16:10] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:16:10] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 3 ms to minimize.
[2024-05-22 05:16:10] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 3 ms to minimize.
[2024-05-22 05:16:11] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-05-22 05:16:11] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-22 05:16:11] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 2 ms to minimize.
[2024-05-22 05:16:11] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:16:11] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:16:11] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:16:12] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:16:12] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:16:13] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:16:13] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:16:13] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:16:14] [INFO ] Deduced a trap composed of 43 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:16:18] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 05:16:19] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-05-22 05:16:19] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:16:19] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 2 ms to minimize.
[2024-05-22 05:16:19] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:16:19] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:16:19] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:16:19] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:16:19] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:16:23] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:16:23] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:16:23] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:16:23] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-22 05:16:23] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-05-22 05:16:23] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:16:23] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:16:23] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:16:25] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:16:29] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:16:32] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:16:32] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:16:32] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:16:32] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:16:32] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-22 05:16:32] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:16:32] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:16:32] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:16:33] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:16:33] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:16:33] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:16:33] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:16:38] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:16:38] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:16:38] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:16:38] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:16:38] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:16:38] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:16:39] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 2 ms to minimize.
[2024-05-22 05:16:39] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:16:39] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:16:40] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:16:41] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:16:41] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:16:41] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:16:42] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:16:44] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:16:46] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:16:47] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:16:47] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 393/413 places, 333/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60881 ms. Remains : 393/413 places, 333/359 transitions.
[2024-05-22 05:17:05] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:17:05] [INFO ] Flatten gal took : 11 ms
[2024-05-22 05:17:05] [INFO ] Input system was already deterministic with 333 transitions.
[2024-05-22 05:17:05] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:17:05] [INFO ] Flatten gal took : 10 ms
[2024-05-22 05:17:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality8358937293760762754.gal : 11 ms
[2024-05-22 05:17:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality3894016700670924512.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/CTLCardinality8358937293760762754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3894016700670924512.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 05:17:35] [INFO ] Flatten gal took : 14 ms
[2024-05-22 05:17:35] [INFO ] Applying decomposition
[2024-05-22 05:17:35] [INFO ] Flatten gal took : 9 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/graph17404221575918636684.txt' '-o' '/tmp/graph17404221575918636684.bin' '-w' '/tmp/graph17404221575918636684.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17404221575918636684.bin' '-l' '-1' '-v' '-w' '/tmp/graph17404221575918636684.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:17:35] [INFO ] Decomposing Gal with order
[2024-05-22 05:17:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:17:35] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-22 05:17:35] [INFO ] Flatten gal took : 27 ms
[2024-05-22 05:17:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 05:17:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality7637764124601444914.gal : 4 ms
[2024-05-22 05:17:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality10237926347321076616.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/CTLCardinality7637764124601444914.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10237926347321076616.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 359/359 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 410 transition count 359
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 10 place count 403 transition count 352
Iterating global reduction 1 with 7 rules applied. Total rules applied 17 place count 403 transition count 352
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 403 transition count 350
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 24 place count 398 transition count 345
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 398 transition count 345
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 398 transition count 342
Applied a total of 32 rules in 22 ms. Remains 398 /413 variables (removed 15) and now considering 342/359 (removed 17) transitions.
// Phase 1: matrix 342 rows 398 cols
[2024-05-22 05:18:05] [INFO ] Computed 62 invariants in 6 ms
[2024-05-22 05:18:06] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-22 05:18:06] [INFO ] Invariant cache hit.
[2024-05-22 05:18:06] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 607 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2024-05-22 05:18:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (OVERLAPS) 342/740 variables, 398/460 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:18:13] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 3 ms to minimize.
[2024-05-22 05:18:13] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 2 ms to minimize.
[2024-05-22 05:18:13] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:18:13] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 2 ms to minimize.
[2024-05-22 05:18:13] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:18:13] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:18:14] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:18:14] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:18:14] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:18:14] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-05-22 05:18:14] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:18:14] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-22 05:18:14] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 2 ms to minimize.
[2024-05-22 05:18:15] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-22 05:18:15] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 1 ms to minimize.
[2024-05-22 05:18:15] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:18:15] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:18:16] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:18:16] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:18:16] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/740 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:18:20] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-22 05:18:21] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:18:21] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:18:21] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:18:21] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/740 variables, 5/485 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:18:24] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-22 05:18:25] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/740 variables, 2/487 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:18:29] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/740 variables, 1/488 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:18:36] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/740 variables, and 489 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/397 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (OVERLAPS) 1/398 variables, 34/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 29/91 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:18:39] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-22 05:18:39] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:18:39] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:18:39] [INFO ] Deduced a trap composed of 34 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:18:39] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:18:39] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-22 05:18:39] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-22 05:18:39] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-22 05:18:39] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-22 05:18:40] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-22 05:18:40] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-22 05:18:40] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-22 05:18:40] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-22 05:18:40] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 1 ms to minimize.
[2024-05-22 05:18:40] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-22 05:18:41] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:18:41] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:18:41] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:18:41] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 19/110 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:18:43] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:18:45] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-05-22 05:18:45] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:18:45] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-05-22 05:18:46] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:18:46] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-22 05:18:46] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-22 05:18:46] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 6/118 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 9 (OVERLAPS) 342/740 variables, 398/516 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/740 variables, 341/857 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/740 variables, and 857 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 56/56 constraints]
After SMT, in 60154ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 398/413 places, 342/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60788 ms. Remains : 398/413 places, 342/359 transitions.
[2024-05-22 05:19:06] [INFO ] Flatten gal took : 15 ms
[2024-05-22 05:19:06] [INFO ] Flatten gal took : 11 ms
[2024-05-22 05:19:06] [INFO ] Input system was already deterministic with 342 transitions.
[2024-05-22 05:19:06] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:19:06] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:19:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality14569396511131663313.gal : 2 ms
[2024-05-22 05:19:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality3125643455979598386.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/CTLCardinality14569396511131663313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3125643455979598386.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 05:19:36] [INFO ] Flatten gal took : 12 ms
[2024-05-22 05:19:36] [INFO ] Applying decomposition
[2024-05-22 05:19:36] [INFO ] Flatten gal took : 9 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/graph13054092704445346039.txt' '-o' '/tmp/graph13054092704445346039.bin' '-w' '/tmp/graph13054092704445346039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13054092704445346039.bin' '-l' '-1' '-v' '-w' '/tmp/graph13054092704445346039.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:19:36] [INFO ] Decomposing Gal with order
[2024-05-22 05:19:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:19:36] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-22 05:19:36] [INFO ] Flatten gal took : 16 ms
[2024-05-22 05:19:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2024-05-22 05:19:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality3392509383969414033.gal : 3 ms
[2024-05-22 05:19:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality14823138991115111681.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/CTLCardinality3392509383969414033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14823138991115111681.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.76705e+20,27.8892,867516,93608,4112,2.36109e+06,20896,680,2.12931e+06,382,126821,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 359/359 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 410 transition count 359
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 400 transition count 349
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 400 transition count 349
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 27 place count 400 transition count 345
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 33 place count 394 transition count 339
Iterating global reduction 2 with 6 rules applied. Total rules applied 39 place count 394 transition count 339
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 43 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 44 place count 393 transition count 334
Iterating global reduction 3 with 1 rules applied. Total rules applied 45 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 46 place count 393 transition count 333
Applied a total of 46 rules in 26 ms. Remains 393 /413 variables (removed 20) and now considering 333/359 (removed 26) transitions.
// Phase 1: matrix 333 rows 393 cols
[2024-05-22 05:20:06] [INFO ] Computed 62 invariants in 9 ms
[2024-05-22 05:20:07] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 05:20:07] [INFO ] Invariant cache hit.
[2024-05-22 05:20:07] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-22 05:20:07] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 333/726 variables, 393/455 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:12] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:20:13] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 3 ms to minimize.
[2024-05-22 05:20:13] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-05-22 05:20:13] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:20:13] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:20:13] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:20:13] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:20:14] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:20:14] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:20:14] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:20:14] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:20:15] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-05-22 05:20:15] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 2 ms to minimize.
[2024-05-22 05:20:15] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-22 05:20:16] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 15/470 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:21] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-22 05:20:21] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
[2024-05-22 05:20:21] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:20:21] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:20:22] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:20:22] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:20:22] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:20:22] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:20:22] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 9/479 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:25] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-22 05:20:25] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:20:25] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-22 05:20:25] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 1 ms to minimize.
[2024-05-22 05:20:25] [INFO ] Deduced a trap composed of 11 places in 18 ms of which 0 ms to minimize.
[2024-05-22 05:20:25] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 2 ms to minimize.
[2024-05-22 05:20:25] [INFO ] Deduced a trap composed of 49 places in 69 ms of which 2 ms to minimize.
[2024-05-22 05:20:26] [INFO ] Deduced a trap composed of 49 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:20:27] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/726 variables, 9/488 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:31] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/726 variables, 1/489 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:35] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:20:35] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:20:35] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:20:35] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-22 05:20:35] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:20:35] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:20:35] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-22 05:20:35] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:20:35] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:20:35] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:20:36] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:20:36] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 726/726 variables, and 501 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/392 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/393 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 46/108 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:40] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:20:40] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:20:40] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 2 ms to minimize.
[2024-05-22 05:20:40] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:20:40] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-22 05:20:40] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-22 05:20:41] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2024-05-22 05:20:41] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:20:41] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-22 05:20:43] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-22 05:20:43] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:43] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:20:43] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:20:44] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:46] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 2 ms to minimize.
[2024-05-22 05:20:49] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
[2024-05-22 05:20:49] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-22 05:20:49] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 10 (OVERLAPS) 333/726 variables, 393/519 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/726 variables, 332/851 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 851 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 64/64 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60134ms
Starting structural reductions in LTL mode, iteration 1 : 393/413 places, 333/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60770 ms. Remains : 393/413 places, 333/359 transitions.
[2024-05-22 05:21:07] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:21:07] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:21:07] [INFO ] Input system was already deterministic with 333 transitions.
[2024-05-22 05:21:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:21:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:21:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality3344085255767578645.gal : 2 ms
[2024-05-22 05:21:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality524080856417131482.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/CTLCardinality3344085255767578645.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality524080856417131482.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 05:21:37] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:21:37] [INFO ] Applying decomposition
[2024-05-22 05:21:37] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11615256392867810224.txt' '-o' '/tmp/graph11615256392867810224.bin' '-w' '/tmp/graph11615256392867810224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11615256392867810224.bin' '-l' '-1' '-v' '-w' '/tmp/graph11615256392867810224.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:21:37] [INFO ] Decomposing Gal with order
[2024-05-22 05:21:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:21:37] [INFO ] Removed a total of 12 redundant transitions.
[2024-05-22 05:21:37] [INFO ] Flatten gal took : 15 ms
[2024-05-22 05:21:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 05:21:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality14323006859058884795.gal : 3 ms
[2024-05-22 05:21:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality5390501907188720309.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/CTLCardinality14323006859058884795.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5390501907188720309.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.7246e+20,5.12167,163132,16638,3754,382859,30495,696,340285,347,175758,0


Converting to forward existential form...Done !
original formula: EF(EX(EG(EX((i3.u8.p132==0)))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),EX((i3.u8.p132==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t52, t247, t294, t295, t327, u30.t79, u32.t76, i2.t119, i2.u6.t124, i2.u6.t125, i2.u7.t12...1184
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 413/413 places, 359/359 transitions.
Graph (complete) has 929 edges and 413 vertex of which 402 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.3 ms
Discarding 11 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 401 transition count 339
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 387 transition count 339
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 29 place count 387 transition count 330
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 47 place count 378 transition count 330
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 54 place count 371 transition count 323
Iterating global reduction 2 with 7 rules applied. Total rules applied 61 place count 371 transition count 323
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 65 place count 371 transition count 319
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 65 place count 371 transition count 318
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 370 transition count 318
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 70 place count 367 transition count 315
Iterating global reduction 3 with 3 rules applied. Total rules applied 73 place count 367 transition count 315
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 3 with 4 rules applied. Total rules applied 77 place count 367 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 78 place count 366 transition count 311
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 place count 366 transition count 310
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 80 place count 365 transition count 310
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 5 with 140 rules applied. Total rules applied 220 place count 295 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 221 place count 295 transition count 239
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 293 transition count 237
Applied a total of 223 rules in 96 ms. Remains 293 /413 variables (removed 120) and now considering 237/359 (removed 122) transitions.
// Phase 1: matrix 237 rows 293 cols
[2024-05-22 05:22:08] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 05:22:08] [INFO ] Implicit Places using invariants in 250 ms returned []
[2024-05-22 05:22:08] [INFO ] Invariant cache hit.
[2024-05-22 05:22:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 05:22:08] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2024-05-22 05:22:08] [INFO ] Redundant transitions in 3 ms returned []
Running 233 sub problems to find dead transitions.
[2024-05-22 05:22:08] [INFO ] Invariant cache hit.
[2024-05-22 05:22:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/289 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (OVERLAPS) 3/292 variables, 14/59 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (OVERLAPS) 237/529 variables, 292/351 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/529 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-22 05:22:15] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-22 05:22:17] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-22 05:22:18] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 2 ms to minimize.
[2024-05-22 05:22:18] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 3/356 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (OVERLAPS) 1/530 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 233 unsolved
[2024-05-22 05:22:25] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/530 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/530 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 13 (OVERLAPS) 0/530 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 233 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 358 constraints, problems are : Problem set: 0 solved, 233 unsolved in 24265 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 293/293 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 233/233 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 233 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/289 variables, 12/45 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 4 (OVERLAPS) 3/292 variables, 14/63 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 7 (OVERLAPS) 237/529 variables, 292/356 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/529 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/529 variables, 233/590 constraints. Problems are: Problem set: 0 solved, 233 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/529 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 233 unsolved
SMT process timed out in 54382ms, After SMT, problems are : Problem set: 0 solved, 233 unsolved
Search for dead transitions found 0 dead transitions in 54386ms
Starting structural reductions in SI_CTL mode, iteration 1 : 293/413 places, 237/359 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55039 ms. Remains : 293/413 places, 237/359 transitions.
[2024-05-22 05:23:03] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:23:03] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:23:03] [INFO ] Input system was already deterministic with 237 transitions.
[2024-05-22 05:23:03] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:23:03] [INFO ] Flatten gal took : 17 ms
[2024-05-22 05:23:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality6456872015331493432.gal : 1 ms
[2024-05-22 05:23:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality10441621612300160849.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/CTLCardinality6456872015331493432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10441621612300160849.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 05:23:33] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:23:33] [INFO ] Applying decomposition
[2024-05-22 05:23:33] [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/graph6454413634065632983.txt' '-o' '/tmp/graph6454413634065632983.bin' '-w' '/tmp/graph6454413634065632983.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6454413634065632983.bin' '-l' '-1' '-v' '-w' '/tmp/graph6454413634065632983.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:23:33] [INFO ] Decomposing Gal with order
[2024-05-22 05:23:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:23:33] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-22 05:23:33] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:23:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-22 05:23:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality13325774059237923233.gal : 2 ms
[2024-05-22 05:23:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality12107017629821876768.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/CTLCardinality13325774059237923233.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12107017629821876768.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.95956e+14,2.2875,78072,5477,5756,173347,16806,354,136578,399,93671,0


Converting to forward existential form...Done !
original formula: AF((((i0.u3.p194==0)&&(u15.p294==1))||((u15.p38==0)&&(i5.i3.u23.p313==1))))
=> equivalent forward existential formula: [FwdG(Init,!((((i0.u3.p194==0)&&(u15.p294==1))||((u15.p38==0)&&(i5.i3.u23.p313==1)))))] = 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
Using 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 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,6.40322,169152,1,0,265123,111352,1250,493463,2721,773737,209012
FORMULA DES-PT-40b-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 413/413 places, 359/359 transitions.
Graph (complete) has 929 edges and 413 vertex of which 404 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 403 transition count 341
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 389 transition count 341
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 389 transition count 331
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 49 place count 379 transition count 331
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 58 place count 370 transition count 322
Iterating global reduction 2 with 9 rules applied. Total rules applied 67 place count 370 transition count 322
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 370 transition count 318
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 71 place count 370 transition count 316
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 368 transition count 316
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 79 place count 364 transition count 312
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 364 transition count 312
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 89 place count 364 transition count 306
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 92 place count 362 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 92 place count 362 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 94 place count 361 transition count 304
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 236 place count 290 transition count 233
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 238 place count 288 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 239 place count 287 transition count 231
Applied a total of 239 rules in 72 ms. Remains 287 /413 variables (removed 126) and now considering 231/359 (removed 128) transitions.
// Phase 1: matrix 231 rows 287 cols
[2024-05-22 05:23:39] [INFO ] Computed 58 invariants in 2 ms
[2024-05-22 05:23:40] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-22 05:23:40] [INFO ] Invariant cache hit.
[2024-05-22 05:23:40] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-05-22 05:23:40] [INFO ] Redundant transitions in 1 ms returned []
Running 228 sub problems to find dead transitions.
[2024-05-22 05:23:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 228 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/286 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (OVERLAPS) 231/517 variables, 286/344 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-22 05:23:45] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:23:45] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:23:45] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-22 05:23:45] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 4/348 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (OVERLAPS) 1/518 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-22 05:23:49] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/518 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 228 unsolved
[2024-05-22 05:23:51] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/518 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/518 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 12 (OVERLAPS) 0/518 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 228 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 351 constraints, problems are : Problem set: 0 solved, 228 unsolved in 17899 ms.
Refiners :[Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 228/228 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/284 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 4/54 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 2/286 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 231/517 variables, 286/350 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 228/578 constraints. Problems are: Problem set: 0 solved, 228 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 228 unsolved
SMT process timed out in 48013ms, After SMT, problems are : Problem set: 0 solved, 228 unsolved
Search for dead transitions found 0 dead transitions in 48015ms
Starting structural reductions in SI_CTL mode, iteration 1 : 287/413 places, 231/359 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48648 ms. Remains : 287/413 places, 231/359 transitions.
[2024-05-22 05:24:28] [INFO ] Flatten gal took : 11 ms
[2024-05-22 05:24:28] [INFO ] Flatten gal took : 11 ms
[2024-05-22 05:24:28] [INFO ] Input system was already deterministic with 231 transitions.
[2024-05-22 05:24:28] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:24:28] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:24:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality602379772902739710.gal : 1 ms
[2024-05-22 05:24:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality13647365321978940589.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/CTLCardinality602379772902739710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13647365321978940589.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 05:24:58] [INFO ] Flatten gal took : 12 ms
[2024-05-22 05:24:58] [INFO ] Applying decomposition
[2024-05-22 05:24:58] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12060104411024819654.txt' '-o' '/tmp/graph12060104411024819654.bin' '-w' '/tmp/graph12060104411024819654.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12060104411024819654.bin' '-l' '-1' '-v' '-w' '/tmp/graph12060104411024819654.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:24:58] [INFO ] Decomposing Gal with order
[2024-05-22 05:24:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:24:58] [INFO ] Removed a total of 39 redundant transitions.
[2024-05-22 05:24:58] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:24:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 1 ms.
[2024-05-22 05:24:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality5239794374658640562.gal : 6 ms
[2024-05-22 05:24:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality16508258386171616580.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/CTLCardinality5239794374658640562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16508258386171616580.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.99218e+14,5.18967,126336,20937,4937,302436,15115,349,266631,393,102194,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 359/359 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 411 transition count 359
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 403 transition count 351
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 403 transition count 351
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 22 place count 403 transition count 347
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 26 place count 399 transition count 343
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 399 transition count 343
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 34 place count 399 transition count 339
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 398 transition count 338
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 398 transition count 338
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 398 transition count 337
Applied a total of 37 rules in 22 ms. Remains 398 /413 variables (removed 15) and now considering 337/359 (removed 22) transitions.
// Phase 1: matrix 337 rows 398 cols
[2024-05-22 05:25:28] [INFO ] Computed 63 invariants in 8 ms
[2024-05-22 05:25:28] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-22 05:25:28] [INFO ] Invariant cache hit.
[2024-05-22 05:25:29] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-05-22 05:25:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 2/398 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 336 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (OVERLAPS) 337/735 variables, 398/461 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-22 05:25:36] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2024-05-22 05:25:36] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:25:36] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:25:36] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:25:37] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:25:37] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:25:37] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 1 ms to minimize.
[2024-05-22 05:25:37] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:25:37] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:25:37] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:25:37] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:25:37] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:25:37] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-22 05:25:37] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:25:38] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:25:38] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-22 05:25:38] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:25:38] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2024-05-22 05:25:38] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-22 05:25:38] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 20/481 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-22 05:25:39] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:25:39] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:25:40] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:25:40] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:25:40] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:25:40] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:25:40] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:25:41] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/735 variables, 8/489 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-22 05:25:45] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:25:45] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:25:45] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:25:45] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-05-22 05:25:45] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-22 05:25:46] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-05-22 05:25:47] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 2 ms to minimize.
[2024-05-22 05:25:48] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-22 05:25:48] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-22 05:25:48] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/735 variables, 10/499 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-22 05:25:50] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-22 05:25:50] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:25:50] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:25:51] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2024-05-22 05:25:51] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:25:51] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-05-22 05:25:51] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 3 ms to minimize.
[2024-05-22 05:25:51] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/735 variables, 8/507 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 735/735 variables, and 507 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 2/398 variables, 34/51 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 46/109 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-22 05:26:02] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:26:02] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:26:02] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:26:02] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:26:02] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:26:02] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:26:02] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:26:02] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:26:03] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:26:03] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:26:03] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:26:03] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:26:03] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:26:03] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 2 ms to minimize.
[2024-05-22 05:26:03] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-22 05:26:03] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 1 ms to minimize.
[2024-05-22 05:26:03] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-22 05:26:03] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:26:03] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:26:05] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-22 05:26:05] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:26:06] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-22 05:26:06] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-22 05:26:06] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-22 05:26:06] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:26:06] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-05-22 05:26:06] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:26:06] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-22 05:26:06] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 2 ms to minimize.
[2024-05-22 05:26:06] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:26:07] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:26:08] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-22 05:26:08] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-22 05:26:08] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 14/143 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-22 05:26:10] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:26:11] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 2/145 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-05-22 05:26:12] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-22 05:26:12] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/398 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/398 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (OVERLAPS) 337/735 variables, 398/545 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/735 variables, 336/881 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 735/735 variables, and 881 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 84/84 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 60141ms
Starting structural reductions in LTL mode, iteration 1 : 398/413 places, 337/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60745 ms. Remains : 398/413 places, 337/359 transitions.
[2024-05-22 05:26:29] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:26:29] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:26:29] [INFO ] Input system was already deterministic with 337 transitions.
[2024-05-22 05:26:29] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:26:29] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:26:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality17589715080762654740.gal : 1 ms
[2024-05-22 05:26:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality1699518900213309578.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/CTLCardinality17589715080762654740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1699518900213309578.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 05:26:59] [INFO ] Flatten gal took : 14 ms
[2024-05-22 05:26:59] [INFO ] Applying decomposition
[2024-05-22 05:26:59] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph378862588977236474.txt' '-o' '/tmp/graph378862588977236474.bin' '-w' '/tmp/graph378862588977236474.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph378862588977236474.bin' '-l' '-1' '-v' '-w' '/tmp/graph378862588977236474.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:26:59] [INFO ] Decomposing Gal with order
[2024-05-22 05:26:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:26:59] [INFO ] Removed a total of 11 redundant transitions.
[2024-05-22 05:26:59] [INFO ] Flatten gal took : 14 ms
[2024-05-22 05:26:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-22 05:26:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality15170118250040186977.gal : 3 ms
[2024-05-22 05:26:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality13843819596686462245.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/CTLCardinality15170118250040186977.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13843819596686462245.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 413/413 places, 359/359 transitions.
Graph (complete) has 929 edges and 413 vertex of which 402 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.2 ms
Discarding 11 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 401 transition count 339
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 387 transition count 339
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 387 transition count 329
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 49 place count 377 transition count 329
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 58 place count 368 transition count 320
Iterating global reduction 2 with 9 rules applied. Total rules applied 67 place count 368 transition count 320
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 368 transition count 316
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 71 place count 368 transition count 314
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 366 transition count 314
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 79 place count 362 transition count 310
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 362 transition count 310
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 89 place count 362 transition count 304
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 92 place count 360 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 92 place count 360 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 94 place count 359 transition count 302
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 5 with 140 rules applied. Total rules applied 234 place count 289 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 236 place count 287 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 237 place count 286 transition count 230
Applied a total of 237 rules in 40 ms. Remains 286 /413 variables (removed 127) and now considering 230/359 (removed 129) transitions.
// Phase 1: matrix 230 rows 286 cols
[2024-05-22 05:27:29] [INFO ] Computed 58 invariants in 3 ms
[2024-05-22 05:27:29] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 05:27:29] [INFO ] Invariant cache hit.
[2024-05-22 05:27:30] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
[2024-05-22 05:27:30] [INFO ] Redundant transitions in 1 ms returned []
Running 226 sub problems to find dead transitions.
[2024-05-22 05:27:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 1/283 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 2/285 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 230/515 variables, 285/343 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:27:37] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:27:38] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/515 variables, 2/345 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:27:40] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-22 05:27:40] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 2/347 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (OVERLAPS) 1/516 variables, 1/348 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/516 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:27:50] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/516 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 15 (OVERLAPS) 0/516 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 349 constraints, problems are : Problem set: 0 solved, 226 unsolved in 27987 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/50 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 1/283 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 2/285 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/285 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (OVERLAPS) 230/515 variables, 285/348 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/515 variables, 226/574 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:28:23] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/515 variables, 1/575 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 515/516 variables, and 575 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/286 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 6/6 constraints]
After SMT, in 58100ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 58102ms
Starting structural reductions in SI_CTL mode, iteration 1 : 286/413 places, 230/359 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58608 ms. Remains : 286/413 places, 230/359 transitions.
[2024-05-22 05:28:28] [INFO ] Flatten gal took : 10 ms
[2024-05-22 05:28:28] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:28:28] [INFO ] Input system was already deterministic with 230 transitions.
[2024-05-22 05:28:28] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:28:28] [INFO ] Flatten gal took : 6 ms
[2024-05-22 05:28:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality13913605443548010910.gal : 1 ms
[2024-05-22 05:28:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality5232034257694093687.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/CTLCardinality13913605443548010910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5232034257694093687.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 05:28:58] [INFO ] Flatten gal took : 10 ms
[2024-05-22 05:28:58] [INFO ] Applying decomposition
[2024-05-22 05:28:58] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph831260387405017115.txt' '-o' '/tmp/graph831260387405017115.bin' '-w' '/tmp/graph831260387405017115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph831260387405017115.bin' '-l' '-1' '-v' '-w' '/tmp/graph831260387405017115.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:28:58] [INFO ] Decomposing Gal with order
[2024-05-22 05:28:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:28:58] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-22 05:28:58] [INFO ] Flatten gal took : 14 ms
[2024-05-22 05:28:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 5 ms.
[2024-05-22 05:28:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality2550269450548964206.gal : 5 ms
[2024-05-22 05:28:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality7573437087765692446.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/CTLCardinality2550269450548964206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7573437087765692446.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.0734e+14,5.52028,132672,21249,4958,315573,14943,353,290268,398,101962,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 359/359 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 411 transition count 359
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 402 transition count 350
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 402 transition count 350
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 23 place count 402 transition count 347
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 28 place count 397 transition count 342
Iterating global reduction 2 with 5 rules applied. Total rules applied 33 place count 397 transition count 342
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 36 place count 397 transition count 339
Applied a total of 36 rules in 12 ms. Remains 397 /413 variables (removed 16) and now considering 339/359 (removed 20) transitions.
// Phase 1: matrix 339 rows 397 cols
[2024-05-22 05:29:28] [INFO ] Computed 63 invariants in 6 ms
[2024-05-22 05:29:28] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-22 05:29:28] [INFO ] Invariant cache hit.
[2024-05-22 05:29:28] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 338 sub problems to find dead transitions.
[2024-05-22 05:29:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 2/397 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:29:35] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-22 05:29:35] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:29:35] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-22 05:29:35] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:29:35] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 1 ms to minimize.
[2024-05-22 05:29:35] [INFO ] Deduced a trap composed of 46 places in 66 ms of which 2 ms to minimize.
[2024-05-22 05:29:35] [INFO ] Deduced a trap composed of 49 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:29:35] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 8/71 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:29:37] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:29:37] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:29:37] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:29:37] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-05-22 05:29:37] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-22 05:29:38] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-05-22 05:29:38] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:29:38] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-05-22 05:29:38] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:29:38] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-22 05:29:38] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:29:38] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:29:38] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-05-22 05:29:38] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:29:38] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 2 ms to minimize.
[2024-05-22 05:29:38] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 3 ms to minimize.
[2024-05-22 05:29:39] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 2 ms to minimize.
[2024-05-22 05:29:39] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:29:39] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-22 05:29:39] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:29:39] [INFO ] Deduced a trap composed of 7 places in 111 ms of which 2 ms to minimize.
[2024-05-22 05:29:39] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 2 ms to minimize.
[2024-05-22 05:29:39] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 2 ms to minimize.
[2024-05-22 05:29:40] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:29:40] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-22 05:29:40] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-22 05:29:40] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2024-05-22 05:29:40] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 2 ms to minimize.
[2024-05-22 05:29:41] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-22 05:29:41] [INFO ] Deduced a trap composed of 74 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:29:41] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:29:41] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-05-22 05:29:42] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-22 05:29:42] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-05-22 05:29:42] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:29:42] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:29:42] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 2 ms to minimize.
[2024-05-22 05:29:42] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2024-05-22 05:29:43] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 1 ms to minimize.
[2024-05-22 05:29:43] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:29:45] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 2 ms to minimize.
[2024-05-22 05:29:45] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:29:46] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:29:46] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:29:46] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:29:48] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2024-05-22 05:29:48] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:29:48] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:29:48] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 4/120 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:29:50] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:29:50] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-22 05:29:51] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:29:56] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-22 05:29:56] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
[2024-05-22 05:29:57] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/397 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:29:58] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 397/736 variables, and 127 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 0/397 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 64/64 constraints]
Escalating to Integer solving :Problem set: 0 solved, 338 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/395 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 2 (OVERLAPS) 2/397 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 15/63 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 64/127 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:30:01] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:30:01] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-22 05:30:02] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-22 05:30:02] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:30:02] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:30:02] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2024-05-22 05:30:02] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:30:02] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
[2024-05-22 05:30:02] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:30:03] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:30:03] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-22 05:30:03] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 12/139 constraints. Problems are: Problem set: 0 solved, 338 unsolved
[2024-05-22 05:30:05] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-05-22 05:30:05] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-05-22 05:30:06] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:30:06] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-22 05:30:08] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 5/144 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 8 (OVERLAPS) 339/736 variables, 397/541 constraints. Problems are: Problem set: 0 solved, 338 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/736 variables, 338/879 constraints. Problems are: Problem set: 0 solved, 338 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 736/736 variables, and 879 constraints, problems are : Problem set: 0 solved, 338 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 338/338 constraints, Known Traps: 81/81 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 338 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in LTL mode, iteration 1 : 397/413 places, 339/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60691 ms. Remains : 397/413 places, 339/359 transitions.
[2024-05-22 05:30:29] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:30:29] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:30:29] [INFO ] Input system was already deterministic with 339 transitions.
[2024-05-22 05:30:29] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:30:29] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:30:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality4623916175459410590.gal : 1 ms
[2024-05-22 05:30:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality4537444714543330736.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/CTLCardinality4623916175459410590.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4537444714543330736.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 05:30:59] [INFO ] Flatten gal took : 10 ms
[2024-05-22 05:30:59] [INFO ] Applying decomposition
[2024-05-22 05:30:59] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8159012045756894543.txt' '-o' '/tmp/graph8159012045756894543.bin' '-w' '/tmp/graph8159012045756894543.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8159012045756894543.bin' '-l' '-1' '-v' '-w' '/tmp/graph8159012045756894543.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:30:59] [INFO ] Decomposing Gal with order
[2024-05-22 05:30:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:30:59] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 05:30:59] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:30:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2024-05-22 05:30:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality15827529449530175464.gal : 2 ms
[2024-05-22 05:30:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality4601211116779821486.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/CTLCardinality15827529449530175464.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4601211116779821486.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,7.31194e+20,12.1604,357532,17643,4243,786684,22559,687,701661,404,211324,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 413/413 places, 359/359 transitions.
Graph (complete) has 929 edges and 413 vertex of which 402 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 401 transition count 339
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 387 transition count 339
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 387 transition count 329
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 49 place count 377 transition count 329
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 56 place count 370 transition count 322
Iterating global reduction 2 with 7 rules applied. Total rules applied 63 place count 370 transition count 322
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 67 place count 370 transition count 318
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 370 transition count 317
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 369 transition count 317
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 72 place count 366 transition count 314
Iterating global reduction 3 with 3 rules applied. Total rules applied 75 place count 366 transition count 314
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 3 with 4 rules applied. Total rules applied 79 place count 366 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 80 place count 365 transition count 310
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 80 place count 365 transition count 309
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 82 place count 364 transition count 309
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 5 with 142 rules applied. Total rules applied 224 place count 293 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 225 place count 293 transition count 237
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 293 transition count 237
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 291 transition count 235
Applied a total of 229 rules in 45 ms. Remains 291 /413 variables (removed 122) and now considering 235/359 (removed 124) transitions.
// Phase 1: matrix 235 rows 291 cols
[2024-05-22 05:31:29] [INFO ] Computed 59 invariants in 2 ms
[2024-05-22 05:31:29] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-22 05:31:29] [INFO ] Invariant cache hit.
[2024-05-22 05:31:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 05:31:29] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
[2024-05-22 05:31:29] [INFO ] Redundant transitions in 1 ms returned []
Running 231 sub problems to find dead transitions.
[2024-05-22 05:31:29] [INFO ] Invariant cache hit.
[2024-05-22 05:31:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (OVERLAPS) 3/290 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (OVERLAPS) 235/525 variables, 290/349 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-22 05:31:36] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:31:37] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/525 variables, 2/352 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-22 05:31:39] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:31:39] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-22 05:31:40] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 3/355 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 10 (OVERLAPS) 1/526 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-22 05:31:46] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/526 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/526 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 13 (OVERLAPS) 0/526 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 231 unsolved
No progress, stopping.
After SMT solving in domain Real declared 526/526 variables, and 357 constraints, problems are : Problem set: 0 solved, 231 unsolved in 25642 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 291/291 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 231 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 4 (OVERLAPS) 3/290 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 7 (OVERLAPS) 235/525 variables, 290/355 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/525 variables, 1/356 constraints. Problems are: Problem set: 0 solved, 231 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/525 variables, 231/587 constraints. Problems are: Problem set: 0 solved, 231 unsolved
[2024-05-22 05:32:12] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-22 05:32:12] [INFO ] Deduced a trap composed of 29 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:32:12] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/525 variables, 3/590 constraints. Problems are: Problem set: 0 solved, 231 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 525/526 variables, and 590 constraints, problems are : Problem set: 0 solved, 231 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 290/291 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 231/231 constraints, Known Traps: 9/9 constraints]
After SMT, in 55752ms problems are : Problem set: 0 solved, 231 unsolved
Search for dead transitions found 0 dead transitions in 55755ms
Starting structural reductions in SI_CTL mode, iteration 1 : 291/413 places, 235/359 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56246 ms. Remains : 291/413 places, 235/359 transitions.
[2024-05-22 05:32:25] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:32:25] [INFO ] Flatten gal took : 15 ms
[2024-05-22 05:32:25] [INFO ] Input system was already deterministic with 235 transitions.
[2024-05-22 05:32:25] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:32:25] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:32:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality12655403171430437097.gal : 2 ms
[2024-05-22 05:32:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality12517511042734466111.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/CTLCardinality12655403171430437097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12517511042734466111.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 05:32:55] [INFO ] Flatten gal took : 15 ms
[2024-05-22 05:32:55] [INFO ] Applying decomposition
[2024-05-22 05:32:55] [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/graph345039921316633097.txt' '-o' '/tmp/graph345039921316633097.bin' '-w' '/tmp/graph345039921316633097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph345039921316633097.bin' '-l' '-1' '-v' '-w' '/tmp/graph345039921316633097.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:32:55] [INFO ] Decomposing Gal with order
[2024-05-22 05:32:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:32:55] [INFO ] Removed a total of 17 redundant transitions.
[2024-05-22 05:32:55] [INFO ] Flatten gal took : 10 ms
[2024-05-22 05:32:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-22 05:32:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality8409776558365627507.gal : 2 ms
[2024-05-22 05:32:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality11969659030579416537.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/CTLCardinality8409776558365627507.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11969659030579416537.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,7.32298e+14,2.66735,86588,6841,6158,200625,15894,329,164119,388,113913,0


Converting to forward existential form...Done !
original formula: EG(((AF(E((i13.i0.u51.p427==1) U !(AF((i1.u9.p261==1))))) + (i2.u2.p199==0)) + (i2.u2.p152==1)))
=> equivalent forward existential formula: [FwdG(Init,((!(EG(!(E((i13.i0.u51.p427==1) U !(!(EG(!((i1.u9.p261==1))))))))) + (i2.u2.p199==0)) + (i2.u2.p152==...169
Reverse transition relation is NOT exact ! Due to transitions t74, t133, t183, t188, t191, u14.t54, u15.t161, u52.t0, u52.t193, i0.u0.t81, i0.u7.t6, i1.t13...774
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 413/413 places, 359/359 transitions.
Graph (complete) has 929 edges and 413 vertex of which 402 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 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 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 401 transition count 339
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 387 transition count 339
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 387 transition count 329
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 49 place count 377 transition count 329
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 58 place count 368 transition count 320
Iterating global reduction 2 with 9 rules applied. Total rules applied 67 place count 368 transition count 320
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 71 place count 368 transition count 316
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 71 place count 368 transition count 314
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 366 transition count 314
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 79 place count 362 transition count 310
Iterating global reduction 3 with 4 rules applied. Total rules applied 83 place count 362 transition count 310
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 6 rules applied. Total rules applied 89 place count 362 transition count 304
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 92 place count 360 transition count 303
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 92 place count 360 transition count 302
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 94 place count 359 transition count 302
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 5 with 142 rules applied. Total rules applied 236 place count 288 transition count 231
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 238 place count 286 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 239 place count 285 transition count 229
Applied a total of 239 rules in 43 ms. Remains 285 /413 variables (removed 128) and now considering 229/359 (removed 130) transitions.
// Phase 1: matrix 229 rows 285 cols
[2024-05-22 05:33:25] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 05:33:26] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-22 05:33:26] [INFO ] Invariant cache hit.
[2024-05-22 05:33:26] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-05-22 05:33:26] [INFO ] Redundant transitions in 1 ms returned []
Running 226 sub problems to find dead transitions.
[2024-05-22 05:33:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (OVERLAPS) 2/284 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (OVERLAPS) 229/513 variables, 284/342 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:33:30] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 2 ms to minimize.
[2024-05-22 05:33:31] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 2/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (OVERLAPS) 1/514 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:33:38] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/514 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:33:42] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/514 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 13 (OVERLAPS) 0/514 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 226 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 347 constraints, problems are : Problem set: 0 solved, 226 unsolved in 24763 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 226 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/282 variables, 3/54 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 4 (OVERLAPS) 2/284 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 7 (OVERLAPS) 229/513 variables, 284/346 constraints. Problems are: Problem set: 0 solved, 226 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 226/572 constraints. Problems are: Problem set: 0 solved, 226 unsolved
[2024-05-22 05:34:06] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:34:08] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:34:11] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/513 variables, 3/575 constraints. Problems are: Problem set: 0 solved, 226 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/514 variables, and 575 constraints, problems are : Problem set: 0 solved, 226 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 284/285 constraints, PredecessorRefiner: 226/226 constraints, Known Traps: 7/7 constraints]
After SMT, in 54871ms problems are : Problem set: 0 solved, 226 unsolved
Search for dead transitions found 0 dead transitions in 54874ms
Starting structural reductions in SI_CTL mode, iteration 1 : 285/413 places, 229/359 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55343 ms. Remains : 285/413 places, 229/359 transitions.
[2024-05-22 05:34:21] [INFO ] Flatten gal took : 6 ms
[2024-05-22 05:34:21] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:34:21] [INFO ] Input system was already deterministic with 229 transitions.
[2024-05-22 05:34:21] [INFO ] Flatten gal took : 6 ms
[2024-05-22 05:34:21] [INFO ] Flatten gal took : 7 ms
[2024-05-22 05:34:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality10892212501441115468.gal : 5 ms
[2024-05-22 05:34:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality15443870079977291018.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/CTLCardinality10892212501441115468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15443870079977291018.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 05:34:51] [INFO ] Flatten gal took : 10 ms
[2024-05-22 05:34:51] [INFO ] Applying decomposition
[2024-05-22 05:34:51] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4773122702318502986.txt' '-o' '/tmp/graph4773122702318502986.bin' '-w' '/tmp/graph4773122702318502986.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4773122702318502986.bin' '-l' '-1' '-v' '-w' '/tmp/graph4773122702318502986.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:34:51] [INFO ] Decomposing Gal with order
[2024-05-22 05:34:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:34:51] [INFO ] Removed a total of 8 redundant transitions.
[2024-05-22 05:34:51] [INFO ] Flatten gal took : 10 ms
[2024-05-22 05:34:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 1 ms.
[2024-05-22 05:34:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality13850464744387103824.gal : 2 ms
[2024-05-22 05:34:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality4895798066733463576.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/CTLCardinality13850464744387103824.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4895798066733463576.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.89455e+14,2.00198,66212,5498,6492,150099,16114,305,116615,389,110108,0


Converting to forward existential form...Done !
original formula: EF(EG((i0.u2.p166==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(i0.u2.p166==1))] != 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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,4.57645,120596,1,0,181471,89988,1178,385822,2845,549116,199865
FORMULA DES-PT-40b-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 359/359 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 410 transition count 359
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 401 transition count 350
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 401 transition count 350
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 401 transition count 347
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 30 place count 395 transition count 341
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 395 transition count 341
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 395 transition count 337
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 394 transition count 336
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 394 transition count 336
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 394 transition count 335
Applied a total of 43 rules in 24 ms. Remains 394 /413 variables (removed 19) and now considering 335/359 (removed 24) transitions.
// Phase 1: matrix 335 rows 394 cols
[2024-05-22 05:34:56] [INFO ] Computed 62 invariants in 6 ms
[2024-05-22 05:34:56] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-22 05:34:56] [INFO ] Invariant cache hit.
[2024-05-22 05:34:56] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 334 sub problems to find dead transitions.
[2024-05-22 05:34:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (OVERLAPS) 335/729 variables, 394/456 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:35:02] [INFO ] Deduced a trap composed of 7 places in 113 ms of which 2 ms to minimize.
[2024-05-22 05:35:02] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-05-22 05:35:02] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-22 05:35:03] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-22 05:35:03] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:35:03] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-22 05:35:03] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:35:03] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 2 ms to minimize.
[2024-05-22 05:35:03] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:35:03] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-05-22 05:35:03] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 2 ms to minimize.
[2024-05-22 05:35:03] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-22 05:35:03] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-22 05:35:03] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-05-22 05:35:04] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:35:04] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:35:04] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-22 05:35:04] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/729 variables, 18/474 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:35:09] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:35:09] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-22 05:35:09] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 05:35:09] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:35:09] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-22 05:35:10] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 2 ms to minimize.
[2024-05-22 05:35:10] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/729 variables, 7/481 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:35:13] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:35:13] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-22 05:35:13] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-22 05:35:13] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-22 05:35:13] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:35:14] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-22 05:35:14] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-22 05:35:14] [INFO ] Deduced a trap composed of 26 places in 94 ms of which 2 ms to minimize.
[2024-05-22 05:35:14] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-22 05:35:15] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-22 05:35:15] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 1 ms to minimize.
[2024-05-22 05:35:16] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-05-22 05:35:16] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2024-05-22 05:35:16] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/729 variables, 14/495 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/729 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:35:25] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 729/729 variables, and 496 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (OVERLAPS) 1/394 variables, 33/50 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 40/102 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:35:29] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-22 05:35:29] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 05:35:29] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-22 05:35:29] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:35:32] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-22 05:35:32] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-22 05:35:33] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-22 05:35:33] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:35:34] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2024-05-22 05:35:35] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-22 05:35:35] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-05-22 05:35:37] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 10 (OVERLAPS) 335/729 variables, 394/508 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/729 variables, 334/842 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 729/729 variables, and 842 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 394/394 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 52/52 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 394/413 places, 335/359 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60828 ms. Remains : 394/413 places, 335/359 transitions.
[2024-05-22 05:35:56] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:35:56] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:35:56] [INFO ] Input system was already deterministic with 335 transitions.
[2024-05-22 05:35:56] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:35:56] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:35:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality17738011141987618374.gal : 1 ms
[2024-05-22 05:35:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality18089620739626745515.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/CTLCardinality17738011141987618374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18089620739626745515.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 05:36:26] [INFO ] Flatten gal took : 15 ms
[2024-05-22 05:36:26] [INFO ] Applying decomposition
[2024-05-22 05:36:26] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10197922486276199328.txt' '-o' '/tmp/graph10197922486276199328.bin' '-w' '/tmp/graph10197922486276199328.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10197922486276199328.bin' '-l' '-1' '-v' '-w' '/tmp/graph10197922486276199328.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:36:26] [INFO ] Decomposing Gal with order
[2024-05-22 05:36:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:36:26] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-22 05:36:26] [INFO ] Flatten gal took : 13 ms
[2024-05-22 05:36:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 2 ms.
[2024-05-22 05:36:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality6420473992779787320.gal : 3 ms
[2024-05-22 05:36:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality14112684263627820242.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/CTLCardinality6420473992779787320.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14112684263627820242.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.
Detected timeout of ITS tools.
[2024-05-22 05:36:57] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:36:57] [INFO ] Flatten gal took : 9 ms
[2024-05-22 05:36:57] [INFO ] Applying decomposition
[2024-05-22 05:36:57] [INFO ] Flatten gal took : 9 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/graph7073083822055119258.txt' '-o' '/tmp/graph7073083822055119258.bin' '-w' '/tmp/graph7073083822055119258.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7073083822055119258.bin' '-l' '-1' '-v' '-w' '/tmp/graph7073083822055119258.weights' '-q' '0' '-e' '0.001'
[2024-05-22 05:36:57] [INFO ] Decomposing Gal with order
[2024-05-22 05:36:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:36:57] [INFO ] Removed a total of 27 redundant transitions.
[2024-05-22 05:36:57] [INFO ] Flatten gal took : 15 ms
[2024-05-22 05:36:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 9 labels/synchronizations in 1 ms.
[2024-05-22 05:36:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality10541404467948468047.gal : 2 ms
[2024-05-22 05:36:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality5289337498582822600.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/CTLCardinality10541404467948468047.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5289337498582822600.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,1.87074e+21,54.3211,1389328,11370,4060,3.75206e+06,31542,695,2.32601e+06,391,268306,0


Converting to forward existential form...Done !
original formula: EG((i4.u34.p266==0))
=> equivalent forward existential formula: [FwdG(Init,(i4.u34.p266==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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 132
[2024-05-22 05:39:46] [INFO ] Applying decomposition
[2024-05-22 05:39:46] [INFO ] Flatten gal took : 8 ms
[2024-05-22 05:39:46] [INFO ] Decomposing Gal with order
[2024-05-22 05:39:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 05:39:46] [INFO ] Removed a total of 171 redundant transitions.
[2024-05-22 05:39:46] [INFO ] Flatten gal took : 19 ms
[2024-05-22 05:39:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 574 labels/synchronizations in 9 ms.
[2024-05-22 05:39:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality614992678732419821.gal : 2 ms
[2024-05-22 05:39:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality8948297238459292283.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/CTLCardinality614992678732419821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8948297238459292283.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 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,1.87074e+21,756.269,8104344,66976,1112,9.50345e+06,16895,632,6.93471e+07,286,71652,0


Converting to forward existential form...Done !
original formula: EG((i1.i0.i1.i0.i1.i1.u134.p266==0))
=> equivalent forward existential formula: [FwdG(Init,(i1.i0.i1.i0.i1.i1.u134.p266==0))] != FALSE
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-22 06:00:21] [INFO ] Flatten gal took : 13 ms
[2024-05-22 06:00:21] [INFO ] Input system was already deterministic with 359 transitions.
[2024-05-22 06:00:21] [INFO ] Transformed 413 places.
[2024-05-22 06:00:21] [INFO ] Transformed 359 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
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 06:00:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality9513120516308547844.gal : 2 ms
[2024-05-22 06:00:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality4700461951679427052.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/CTLCardinality9513120516308547844.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4700461951679427052.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 -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-40b"
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-40b, 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-171624189900721"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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