Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r356-tall-171683761800769.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 ShieldRVs-PT-005A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761800769
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 17:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Apr 12 17:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 17:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 32K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717035411150

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-005A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-30 02:16:52] [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-30 02:16:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 02:16:52] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2024-05-30 02:16:52] [INFO ] Transformed 73 places.
[2024-05-30 02:16:52] [INFO ] Transformed 98 transitions.
[2024-05-30 02:16:52] [INFO ] Found NUPN structural information;
[2024-05-30 02:16:52] [INFO ] Parsed PT model containing 73 places and 98 transitions and 460 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Support contains 63 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 9 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 73 cols
[2024-05-30 02:16:52] [INFO ] Computed 21 invariants in 5 ms
[2024-05-30 02:16:52] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-05-30 02:16:52] [INFO ] Invariant cache hit.
[2024-05-30 02:16:52] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:16:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 7 places in 172 ms of which 10 ms to minimize.
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 6 ms to minimize.
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 7 places in 136 ms of which 0 ms to minimize.
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 4 ms to minimize.
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:16:54] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:16:55] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:16:55] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:16:55] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:16:55] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:16:55] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 02:16:55] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:16:55] [INFO ] Deduced a trap composed of 13 places in 197 ms of which 2 ms to minimize.
[2024-05-30 02:16:55] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 12 ms to minimize.
[2024-05-30 02:16:55] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:16:56] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:16:56] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:16:56] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-30 02:16:56] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:16:57] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-30 02:16:57] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:16:57] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:16:57] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:16:57] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:16:57] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 13 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:16:57] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:16:57] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:16:58] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:16:58] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:16:58] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 2 ms to minimize.
[2024-05-30 02:16:58] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:16:58] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:16:58] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:16:59] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:16:59] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:16:59] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:16:59] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6964 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2993 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 10061ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 10100ms
Finished structural reductions in LTL mode , in 1 iterations and 10481 ms. Remains : 73/73 places, 98/98 transitions.
Support contains 63 out of 73 places after structural reductions.
[2024-05-30 02:17:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-30 02:17:03] [INFO ] Flatten gal took : 33 ms
[2024-05-30 02:17:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVs-PT-005A-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-005A-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-30 02:17:03] [INFO ] Flatten gal took : 13 ms
[2024-05-30 02:17:03] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 57 out of 73 places (down from 63) after GAL structural reductions.
FORMULA ShieldRVs-PT-005A-CTLCardinality-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Reduction of identical properties reduced properties to check from 60 to 57
RANDOM walk for 824 steps (8 resets) in 110 ms. (7 steps per ms) remains 0/57 properties
[2024-05-30 02:17:03] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:17:03] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:17:03] [INFO ] Input system was already deterministic with 98 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 97
Applied a total of 2 rules in 20 ms. Remains 72 /73 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 72 cols
[2024-05-30 02:17:03] [INFO ] Computed 21 invariants in 4 ms
[2024-05-30 02:17:03] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-30 02:17:03] [INFO ] Invariant cache hit.
[2024-05-30 02:17:03] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-30 02:17:03] [INFO ] Redundant transitions in 47 ms returned [30]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 72 cols
[2024-05-30 02:17:03] [INFO ] Computed 21 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:17:04] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:17:04] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:17:04] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:17:04] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:17:04] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 02:17:04] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:17:04] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:17:04] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:17:04] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:17:04] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 8 ms to minimize.
[2024-05-30 02:17:04] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:17:04] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 02:17:04] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:17:05] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:17:06] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 96/168 variables, 72/198 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:17:06] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:17:07] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:17:07] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:17:07] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-30 02:17:07] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:17:07] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:17:07] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:17:07] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:17:08] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:17:08] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:17:08] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/168 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:17:08] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:17:08] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:17:09] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-30 02:17:09] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:17:09] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:17:09] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:17:09] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:17:09] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 6/217 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:17:09] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/168 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:17:10] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:17:10] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:17:10] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:17:10] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:17:10] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:17:10] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/168 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:17:10] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:17:10] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/168 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/168 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 22 (OVERLAPS) 0/168 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 226 constraints, problems are : Problem set: 0 solved, 95 unsolved in 8068 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 61/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/168 variables, 72/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 95/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:17:14] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/168 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 322 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5086 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 62/62 constraints]
After SMT, in 13190ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 13193ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/73 places, 96/98 transitions.
Applied a total of 0 rules in 9 ms. Remains 72 /72 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 13474 ms. Remains : 72/73 places, 96/98 transitions.
[2024-05-30 02:17:17] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:17:17] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:17:17] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-30 02:17:17] [INFO ] Flatten gal took : 10 ms
[2024-05-30 02:17:17] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:17:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality13544535831618169263.gal : 3 ms
[2024-05-30 02:17:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality16670978524197505151.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/CTLCardinality13544535831618169263.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16670978524197505151.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00264e+10,0.564556,23220,2,2640,5,57370,6,0,386,140167,0


Converting to forward existential form...Done !
original formula: EG((((p69==0)||(p34==1))||((p20==0)||(p57==0))))
=> equivalent forward existential formula: [FwdG(Init,(((p69==0)||(p34==1))||((p20==0)||(p57==0))))] != FALSE
Hit Full ! (commute/partial/dont) 72/0/24
Detected timeout of ITS tools.
[2024-05-30 02:17:47] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:17:47] [INFO ] Applying decomposition
[2024-05-30 02:17:47] [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/graph402507951825225580.txt' '-o' '/tmp/graph402507951825225580.bin' '-w' '/tmp/graph402507951825225580.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph402507951825225580.bin' '-l' '-1' '-v' '-w' '/tmp/graph402507951825225580.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:17:47] [INFO ] Decomposing Gal with order
[2024-05-30 02:17:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:17:47] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-30 02:17:47] [INFO ] Flatten gal took : 35 ms
[2024-05-30 02:17:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 6 ms.
[2024-05-30 02:17:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality14443401757640577932.gal : 3 ms
[2024-05-30 02:17:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality17997549249501437341.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/CTLCardinality14443401757640577932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17997549249501437341.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00264e+10,1.15858,40856,612,29,53056,364,131,268686,33,2143,0


Converting to forward existential form...Done !
original formula: EG((((i4.u20.p69==0)||(i2.u9.p34==1))||((i1.u5.p20==0)||(i3.u16.p57==0))))
=> equivalent forward existential formula: [FwdG(Init,(((i4.u20.p69==0)||(i2.u9.p34==1))||((i1.u5.p20==0)||(i3.u16.p57==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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 96
Applied a total of 2 rules in 15 ms. Remains 71 /73 variables (removed 2) and now considering 96/98 (removed 2) transitions.
// Phase 1: matrix 96 rows 71 cols
[2024-05-30 02:18:17] [INFO ] Computed 21 invariants in 0 ms
[2024-05-30 02:18:17] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 02:18:17] [INFO ] Invariant cache hit.
[2024-05-30 02:18:17] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-30 02:18:17] [INFO ] Redundant transitions in 27 ms returned [29]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 94 sub problems to find dead transitions.
// Phase 1: matrix 95 rows 71 cols
[2024-05-30 02:18:17] [INFO ] Computed 21 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 3 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 1 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 6 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:18:18] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-30 02:18:19] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:18:19] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:19] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-30 02:18:19] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:18:19] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:18:19] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-30 02:18:19] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-05-30 02:18:19] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-30 02:18:19] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-30 02:18:19] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-30 02:18:19] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-05-30 02:18:19] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:18:19] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:20] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-05-30 02:18:20] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-05-30 02:18:20] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 95/166 variables, 71/197 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:21] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:18:21] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:18:21] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-30 02:18:21] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-30 02:18:21] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:18:21] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-30 02:18:21] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/166 variables, 7/204 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:21] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:18:21] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:18:21] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:18:22] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-05-30 02:18:22] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-30 02:18:22] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 6/210 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:22] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:18:22] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:18:22] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-30 02:18:22] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-30 02:18:22] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-30 02:18:22] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-30 02:18:22] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-30 02:18:23] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 8/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:23] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:18:23] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:18:23] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:23] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:18:23] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/166 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:24] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
[2024-05-30 02:18:24] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:18:24] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:18:24] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:18:24] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/166 variables, 5/228 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:24] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:18:24] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-30 02:18:24] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-30 02:18:24] [INFO ] Deduced a trap composed of 10 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:18:24] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/166 variables, 5/233 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:25] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/166 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:25] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/166 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:25] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:18:26] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:18:26] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/166 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:26] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/166 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:26] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/166 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:27] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:18:27] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:18:27] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/166 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:27] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:18:27] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/166 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:28] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/166 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/166 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:28] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/166 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:29] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:18:29] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/166 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:18:29] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/166 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/166 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 28 (OVERLAPS) 0/166 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 250 constraints, problems are : Problem set: 0 solved, 94 unsolved in 12986 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 87/179 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/166 variables, 71/250 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 94/344 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/166 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 344 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2900 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 87/87 constraints]
After SMT, in 15977ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 15980ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/73 places, 95/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 71 /71 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 16238 ms. Remains : 71/73 places, 95/98 transitions.
[2024-05-30 02:18:33] [INFO ] Flatten gal took : 14 ms
[2024-05-30 02:18:33] [INFO ] Flatten gal took : 18 ms
[2024-05-30 02:18:33] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-30 02:18:33] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:18:33] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:18:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality1842196076379807557.gal : 24 ms
[2024-05-30 02:18:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality7257935740309933671.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/CTLCardinality1842196076379807557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7257935740309933671.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00264e+10,0.536275,22756,2,2571,5,57270,6,0,382,140124,0


Converting to forward existential form...Done !
original formula: EF(AG((((p41==1)||(p45==1))&&((p47==0)||(p24==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((((p41==1)||(p45==1))&&((p47==0)||(p24==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...520
(forward)formula 0,1,7.49653,229000,1,0,367,995565,212,146,3122,1.83246e+06,313
FORMULA ShieldRVs-PT-005A-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 73 cols
[2024-05-30 02:18:41] [INFO ] Computed 21 invariants in 4 ms
[2024-05-30 02:18:41] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 02:18:41] [INFO ] Invariant cache hit.
[2024-05-30 02:18:41] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:18:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 0 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 02:18:42] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:18:43] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:18:43] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-30 02:18:43] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:18:43] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:18:43] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-30 02:18:43] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:18:43] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-30 02:18:44] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:18:44] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-05-30 02:18:44] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:18:44] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:18:44] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:18:44] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:18:44] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:18:45] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 6 ms to minimize.
[2024-05-30 02:18:45] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:18:45] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-30 02:18:45] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:18:45] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:18:45] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-30 02:18:45] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:18:45] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:18:45] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:18:45] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:18:46] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:18:46] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:18:46] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:18:46] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6114 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2838 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 9011ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9013ms
Finished structural reductions in LTL mode , in 1 iterations and 9160 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:18:50] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:18:50] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:18:50] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:18:50] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:18:50] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:18:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality7084470341967160802.gal : 18 ms
[2024-05-30 02:18:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality11146407328585280608.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/CTLCardinality7084470341967160802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11146407328585280608.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.524223,23312,2,2700,5,58054,6,0,392,141855,0


Converting to forward existential form...Done !
original formula: EF(((AG(E((p23!=1) U E(((p55==0)||(p64==1)) U ((p9==0)||(p62==1))))) * AF(AX(((p31==0)||(p22==1))))) * (A(A((p42==1) U (p2==1)) U ((p6==0...198
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (!(E(TRUE U !(E((p23!=1) U E(((p55==0)||(p64==1)) U ((p9==0)||(p62==1))))))) * !(EG(!(!(E...549
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Detected timeout of ITS tools.
[2024-05-30 02:19:20] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:19:20] [INFO ] Applying decomposition
[2024-05-30 02:19:20] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15417557960132951670.txt' '-o' '/tmp/graph15417557960132951670.bin' '-w' '/tmp/graph15417557960132951670.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15417557960132951670.bin' '-l' '-1' '-v' '-w' '/tmp/graph15417557960132951670.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:19:20] [INFO ] Decomposing Gal with order
[2024-05-30 02:19:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:19:20] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:19:20] [INFO ] Flatten gal took : 28 ms
[2024-05-30 02:19:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 3 ms.
[2024-05-30 02:19:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality994272769214646138.gal : 1 ms
[2024-05-30 02:19:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality14694869587414239457.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/CTLCardinality994272769214646138.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14694869587414239457.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.40013e+10,1.10577,38216,570,29,51508,411,116,241309,31,2514,0


Converting to forward existential form...Done !
original formula: EF(((AG(E((i1.u7.p23!=1) U E(((i3.u16.p55==0)||(i4.u18.p64==1)) U ((i0.u3.p9==0)||(i4.u17.p62==1))))) * AF(AX(((i2.u9.p31==0)||(i1.u6.p22...283
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (!(E(TRUE U !(E((i1.u7.p23!=1) U E(((i3.u16.p55==0)||(i4.u18.p64==1)) U ((i0.u3.p9==0)||(...717
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-30 02:19:50] [INFO ] Invariant cache hit.
[2024-05-30 02:19:50] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-30 02:19:50] [INFO ] Invariant cache hit.
[2024-05-30 02:19:50] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:19:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:19:51] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-30 02:19:51] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:19:51] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:19:51] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-30 02:19:51] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
[2024-05-30 02:19:51] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-30 02:19:51] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:19:51] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-30 02:19:51] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-30 02:19:51] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-30 02:19:52] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:19:52] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:19:52] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 7 ms to minimize.
[2024-05-30 02:19:52] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 02:19:52] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-30 02:19:52] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-30 02:19:52] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-30 02:19:52] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-30 02:19:52] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:19:52] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:19:52] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-30 02:19:52] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:19:52] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:19:52] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-30 02:19:53] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:19:53] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:19:53] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:19:53] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:19:53] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:19:54] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:19:54] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:19:54] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-30 02:19:54] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:19:54] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-30 02:19:54] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:19:54] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:19:55] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:19:55] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:19:55] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-30 02:19:55] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:19:55] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:19:55] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:19:55] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:19:56] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:19:56] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:19:56] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:19:56] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6251 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2850 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 9151ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9152ms
Finished structural reductions in LTL mode , in 1 iterations and 9303 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:20:00] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:20:00] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:20:00] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:20:00] [INFO ] Flatten gal took : 29 ms
[2024-05-30 02:20:00] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:20:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality7834147706236099246.gal : 14 ms
[2024-05-30 02:20:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality14419945341693226426.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/CTLCardinality7834147706236099246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14419945341693226426.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.587104,23336,2,2700,5,58054,6,0,392,141855,0


Converting to forward existential form...Done !
original formula: AG(AF((((p11==0) + EX((p15==0))) + ((p31==0)&&(p19==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((((p11==0) + EX((p15==0))) + ((p31==0)&&(p19==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
(forward)formula 0,1,11.1779,368756,1,0,399,1.2552e+06,220,104,3320,3.13043e+06,320
FORMULA ShieldRVs-PT-005A-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-30 02:20:11] [INFO ] Invariant cache hit.
[2024-05-30 02:20:11] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 02:20:11] [INFO ] Invariant cache hit.
[2024-05-30 02:20:11] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:20:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 7 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-30 02:20:12] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:20:13] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:20:13] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-30 02:20:13] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:20:13] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:20:13] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:20:13] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:20:14] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2024-05-30 02:20:14] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:20:14] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-30 02:20:14] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:20:14] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:20:14] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:20:14] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-30 02:20:14] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:20:15] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-30 02:20:15] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:20:15] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:20:15] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:20:15] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-30 02:20:15] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-30 02:20:15] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-30 02:20:15] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-30 02:20:15] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:20:16] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:20:16] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:20:16] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:20:16] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:20:16] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6176 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2810 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 9045ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9046ms
Finished structural reductions in LTL mode , in 1 iterations and 9188 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:20:20] [INFO ] Flatten gal took : 17 ms
[2024-05-30 02:20:20] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:20:20] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:20:20] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:20:20] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:20:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality11413814112010835763.gal : 17 ms
[2024-05-30 02:20:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality6207387528424411304.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/CTLCardinality11413814112010835763.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6207387528424411304.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.550089,23336,2,2700,5,58054,6,0,392,141855,0


Converting to forward existential form...Done !
original formula: A(((p15==0)||(p8==1)) U AX(!(EF((p58==0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(!(E(TRUE U (p58==0)))))))))) * !(E(!(!(EX(!(!(E(TRUE U (p58==0))))))) U (!(((p15==0)||(p...213
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Detected timeout of ITS tools.
[2024-05-30 02:20:50] [INFO ] Flatten gal took : 17 ms
[2024-05-30 02:20:50] [INFO ] Applying decomposition
[2024-05-30 02:20:50] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15727373730060033576.txt' '-o' '/tmp/graph15727373730060033576.bin' '-w' '/tmp/graph15727373730060033576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15727373730060033576.bin' '-l' '-1' '-v' '-w' '/tmp/graph15727373730060033576.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:20:50] [INFO ] Decomposing Gal with order
[2024-05-30 02:20:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:20:50] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:20:50] [INFO ] Flatten gal took : 24 ms
[2024-05-30 02:20:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 3 ms.
[2024-05-30 02:20:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality9607700698783487494.gal : 15 ms
[2024-05-30 02:20:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality3835240201027557084.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/CTLCardinality9607700698783487494.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3835240201027557084.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.40013e+10,1.17092,41928,570,29,54765,403,116,275105,31,2421,0


Converting to forward existential form...Done !
original formula: A(((i0.u4.p15==0)||(i0.u2.p8==1)) U AX(!(EF((i3.u16.p58==0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(!(E(TRUE U (i3.u16.p58==0)))))))))) * !(E(!(!(EX(!(!(E(TRUE U (i3.u16.p58==0))))))) U (!...246
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 97
Applied a total of 2 rules in 6 ms. Remains 72 /73 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 72 cols
[2024-05-30 02:21:20] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 02:21:20] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 02:21:20] [INFO ] Invariant cache hit.
[2024-05-30 02:21:21] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-05-30 02:21:21] [INFO ] Redundant transitions in 30 ms returned [30]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 72 cols
[2024-05-30 02:21:21] [INFO ] Computed 21 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:21:21] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:21:21] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:21:21] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:21:21] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:21:21] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:21:21] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 0 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 0 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:21:22] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:21:23] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:21:23] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-30 02:21:23] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-30 02:21:23] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:21:23] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-30 02:21:23] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:21:23] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:21:23] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:21:23] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 96/168 variables, 72/198 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:21:24] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:21:24] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-05-30 02:21:24] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-30 02:21:24] [INFO ] Deduced a trap composed of 11 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:21:24] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:21:24] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-30 02:21:24] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:21:25] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:21:25] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:21:25] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:21:26] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/168 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:21:26] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:21:26] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:21:26] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:21:26] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-30 02:21:26] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 0 ms to minimize.
[2024-05-30 02:21:26] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:21:26] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:21:26] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 6/217 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:21:27] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/168 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:21:27] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:21:28] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:21:28] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:21:28] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:21:28] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:21:28] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/168 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:21:28] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:21:28] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/168 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/168 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 22 (OVERLAPS) 0/168 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 226 constraints, problems are : Problem set: 0 solved, 95 unsolved in 8300 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 61/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/168 variables, 72/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 95/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:21:31] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/168 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 322 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5009 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 62/62 constraints]
After SMT, in 13357ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 13359ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/73 places, 96/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 72 /72 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 13550 ms. Remains : 72/73 places, 96/98 transitions.
[2024-05-30 02:21:34] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:21:34] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:21:34] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-30 02:21:34] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:21:34] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:21:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality7638145051612346540.gal : 1 ms
[2024-05-30 02:21:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality5313604621265102842.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/CTLCardinality7638145051612346540.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5313604621265102842.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00264e+10,0.570695,23324,2,2640,5,57370,6,0,386,140167,0


Converting to forward existential form...Done !
original formula: AG(((EF(EG((p17==1))) + AF(((p54==0)&&(p3==1)))) + (AG((p51==0)) + AF(((p63==0)&&(p55==1))))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !((E(TRUE U EG((p17==1))) + !(EG(!(((p54==0)&&(p3==1)))))))) * !(!(E(TRUE U !((p51==0)...194
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...520
Detected timeout of ITS tools.
[2024-05-30 02:22:04] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:22:04] [INFO ] Applying decomposition
[2024-05-30 02:22:04] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7378803387074002326.txt' '-o' '/tmp/graph7378803387074002326.bin' '-w' '/tmp/graph7378803387074002326.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7378803387074002326.bin' '-l' '-1' '-v' '-w' '/tmp/graph7378803387074002326.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:22:04] [INFO ] Decomposing Gal with order
[2024-05-30 02:22:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:22:04] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-30 02:22:04] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:22:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 2 ms.
[2024-05-30 02:22:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality1112751476520155587.gal : 1 ms
[2024-05-30 02:22:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality11933370186045505641.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/CTLCardinality1112751476520155587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11933370186045505641.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00264e+10,1.15796,41668,595,29,53526,367,132,277247,33,2280,0


Converting to forward existential form...Done !
original formula: AG(((EF(EG((i1.u5.p17==1))) + AF(((i3.u15.p54==0)&&(i0.u1.p3==1)))) + (AG((i3.u15.p51==0)) + AF(((i4.u18.p63==0)&&(i3.u16.p55==1))))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !((E(TRUE U EG((i1.u5.p17==1))) + !(EG(!(((i3.u15.p54==0)&&(i0.u1.p3==1)))))))) * !(!(...234
Reverse transition relation is NOT exact ! Due to transitions t33, t37, t42, t44, t54, t57, t64, t93, i0.t86, i0.t48, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...599
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 73 cols
[2024-05-30 02:22:34] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 02:22:34] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-30 02:22:34] [INFO ] Invariant cache hit.
[2024-05-30 02:22:34] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-30 02:22:34] [INFO ] Redundant transitions in 22 ms returned [33]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 96 sub problems to find dead transitions.
// Phase 1: matrix 97 rows 73 cols
[2024-05-30 02:22:34] [INFO ] Computed 21 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:22:35] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 9/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:22:36] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 97/170 variables, 73/199 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-30 02:22:37] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:22:37] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-05-30 02:22:37] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:22:37] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:22:37] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:22:37] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-30 02:22:38] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:22:38] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:22:38] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-30 02:22:38] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:22:38] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:22:38] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:22:38] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/170 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-30 02:22:38] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/170 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-30 02:22:39] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/170 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/170 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 16 (OVERLAPS) 0/170 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 170/170 variables, and 214 constraints, problems are : Problem set: 0 solved, 96 unsolved in 5803 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-30 02:22:40] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 97/170 variables, 73/215 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/170 variables, 96/311 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-30 02:22:41] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:22:42] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/170 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/170 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-30 02:22:45] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/170 variables, 1/314 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-30 02:22:46] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/170 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/170 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (OVERLAPS) 0/170 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 170/170 variables, and 315 constraints, problems are : Problem set: 0 solved, 96 unsolved in 8927 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 52/52 constraints]
After SMT, in 14763ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 14764ms
Starting structural reductions in SI_CTL mode, iteration 1 : 73/73 places, 97/98 transitions.
Applied a total of 0 rules in 17 ms. Remains 73 /73 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 14966 ms. Remains : 73/73 places, 97/98 transitions.
[2024-05-30 02:22:49] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:22:49] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:22:49] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-30 02:22:49] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:22:49] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:22:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality12944395055398889630.gal : 1 ms
[2024-05-30 02:22:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality3981508130322343573.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/CTLCardinality12944395055398889630.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3981508130322343573.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.574639,23324,2,2700,5,58036,6,0,391,141390,0


Converting to forward existential form...Done !
original formula: E((!(EG(!(AF((p12==1))))) * ((!((!(A(((p1==0)||(p16==1)) U ((p54==0)||(p29==1)))) * EG((((p62==1)||(p30==0))||(p32==1))))) + EF(((A((p44=...472
=> equivalent forward existential formula: ([((FwdU(Init,(!(EG(!(!(EG(!((p12==1))))))) * ((!((!(!((E(!(((p54==0)||(p29==1))) U (!(((p1==0)||(p16==1))) * !(...1358
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...525
Detected timeout of ITS tools.
[2024-05-30 02:23:19] [INFO ] Flatten gal took : 18 ms
[2024-05-30 02:23:19] [INFO ] Applying decomposition
[2024-05-30 02:23:19] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13470765666305958251.txt' '-o' '/tmp/graph13470765666305958251.bin' '-w' '/tmp/graph13470765666305958251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13470765666305958251.bin' '-l' '-1' '-v' '-w' '/tmp/graph13470765666305958251.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:23:19] [INFO ] Decomposing Gal with order
[2024-05-30 02:23:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:23:19] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-30 02:23:19] [INFO ] Flatten gal took : 15 ms
[2024-05-30 02:23:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 3 ms.
[2024-05-30 02:23:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality12481936958722064667.gal : 2 ms
[2024-05-30 02:23:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality1606359169340295370.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/CTLCardinality12481936958722064667.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1606359169340295370.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.07732,41936,654,29,57262,413,130,267549,31,2642,0


Converting to forward existential form...Done !
original formula: E((!(EG(!(AF((i0.u3.p12==1))))) * ((!((!(A(((i0.u0.p1==0)||(i0.u4.p16==1)) U ((i3.u15.p54==0)||(i1.u8.p29==1)))) * EG((((i4.u17.p62==1)||...678
=> equivalent forward existential formula: ([((FwdU(Init,(!(EG(!(!(EG(!((i0.u3.p12==1))))))) * ((!((!(!((E(!(((i3.u15.p54==0)||(i1.u8.p29==1))) U (!(((i0.u...1853
Reverse transition relation is NOT exact ! Due to transitions t35, t42, t43, t50, t57, t60, t66, t69, i0.t92, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...611
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 73 cols
[2024-05-30 02:23:49] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 02:23:49] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 02:23:49] [INFO ] Invariant cache hit.
[2024-05-30 02:23:49] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:23:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:23:50] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-30 02:23:50] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:23:50] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:23:50] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-30 02:23:50] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:23:50] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-30 02:23:50] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:23:50] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:23:50] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:23:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:23:50] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:23:50] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:23:50] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:23:51] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:23:51] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
[2024-05-30 02:23:51] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:23:51] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:23:51] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:23:51] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:23:51] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:23:51] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:23:51] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:23:51] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:23:51] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:23:51] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:23:52] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:23:52] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
[2024-05-30 02:23:52] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-30 02:23:52] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:23:52] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:23:52] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-30 02:23:52] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 1 ms to minimize.
[2024-05-30 02:23:53] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:23:53] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-30 02:23:53] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:23:53] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:23:53] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:23:53] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:23:53] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:23:53] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:23:53] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:23:53] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:23:53] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:23:54] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:23:54] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:23:54] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:23:54] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5666 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2954 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 8644ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8646ms
Finished structural reductions in LTL mode , in 1 iterations and 8772 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:23:58] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:23:58] [INFO ] Flatten gal took : 5 ms
[2024-05-30 02:23:58] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:23:58] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:23:58] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:23:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality2116893148646311703.gal : 1 ms
[2024-05-30 02:23:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality5854111132096321649.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/CTLCardinality2116893148646311703.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5854111132096321649.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.618683,23340,2,2700,5,58054,6,0,392,141855,0


Converting to forward existential form...Done !
original formula: EX(E(E(((AG(((p44==0)||(p66==1))) + !(((p55==0)||(p38==1)))) + (EX((p63==1)) + ((p28==0)&&(p29==0)))) U A((p10==1) U ((p67==0)||(p27==1))...182
=> equivalent forward existential formula: [(FwdU(EY(Init),E(((!(E(TRUE U !(((p44==0)||(p66==1))))) + !(((p55==0)||(p38==1)))) + (EX((p63==1)) + ((p28==0)&...315
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-30 02:24:28] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:24:28] [INFO ] Applying decomposition
[2024-05-30 02:24:28] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3194458946149506566.txt' '-o' '/tmp/graph3194458946149506566.bin' '-w' '/tmp/graph3194458946149506566.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3194458946149506566.bin' '-l' '-1' '-v' '-w' '/tmp/graph3194458946149506566.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:24:28] [INFO ] Decomposing Gal with order
[2024-05-30 02:24:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:24:28] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:24:28] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:24:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 2 ms.
[2024-05-30 02:24:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality2083665083707910820.gal : 1 ms
[2024-05-30 02:24:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality7471859987324578295.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/CTLCardinality2083665083707910820.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7471859987324578295.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.40013e+10,1.04192,38772,570,29,51644,426,116,245259,31,2539,0


Converting to forward existential form...Done !
original formula: EX(E(E(((AG(((i2.u12.p44==0)||(i4.u19.p66==1))) + !(((i3.u16.p55==0)||(i2.u11.p38==1)))) + (EX((i4.u18.p63==1)) + ((i1.u8.p28==0)&&(i1.u8...254
=> equivalent forward existential formula: [(FwdU(EY(Init),E(((!(E(TRUE U !(((i2.u12.p44==0)||(i4.u19.p66==1))))) + !(((i3.u16.p55==0)||(i2.u11.p38==1)))) ...413
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 71 transition count 96
Applied a total of 2 rules in 19 ms. Remains 71 /73 variables (removed 2) and now considering 96/98 (removed 2) transitions.
// Phase 1: matrix 96 rows 71 cols
[2024-05-30 02:24:58] [INFO ] Computed 21 invariants in 1 ms
[2024-05-30 02:24:58] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 02:24:58] [INFO ] Invariant cache hit.
[2024-05-30 02:24:58] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-30 02:24:59] [INFO ] Redundant transitions in 26 ms returned [29]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 94 sub problems to find dead transitions.
// Phase 1: matrix 95 rows 71 cols
[2024-05-30 02:24:59] [INFO ] Computed 21 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:24:59] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-30 02:24:59] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:24:59] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:24:59] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:24:59] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-05-30 02:24:59] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-30 02:24:59] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-30 02:24:59] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:24:59] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:24:59] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:24:59] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-30 02:24:59] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-30 02:24:59] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2024-05-30 02:24:59] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-30 02:25:00] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:01] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-05-30 02:25:01] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-30 02:25:01] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 95/166 variables, 71/197 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/166 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:01] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:25:01] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:25:02] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-30 02:25:02] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-30 02:25:02] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-30 02:25:02] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-30 02:25:02] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/166 variables, 7/204 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:02] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:25:02] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 0 ms to minimize.
[2024-05-30 02:25:02] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:25:02] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-30 02:25:02] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:25:02] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/166 variables, 6/210 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:03] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:25:03] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:25:03] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:25:03] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-30 02:25:03] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-30 02:25:03] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-30 02:25:03] [INFO ] Deduced a trap composed of 24 places in 55 ms of which 0 ms to minimize.
[2024-05-30 02:25:03] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/166 variables, 8/218 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:03] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:25:03] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:25:04] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/166 variables, 3/221 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:04] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:25:04] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/166 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:04] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:25:04] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:25:04] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:25:04] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:25:04] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/166 variables, 5/228 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:05] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:25:05] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:25:05] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:25:05] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:25:05] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/166 variables, 5/233 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:05] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/166 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:06] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/166 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:06] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:25:06] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:25:06] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/166 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:06] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/166 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:07] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/166 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:07] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:25:07] [INFO ] Deduced a trap composed of 11 places in 21 ms of which 1 ms to minimize.
[2024-05-30 02:25:07] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/166 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:08] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:25:08] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/166 variables, 2/245 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:08] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/166 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/166 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:09] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
At refinement iteration 24 (OVERLAPS) 0/166 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:09] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:25:09] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/166 variables, 2/249 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-30 02:25:10] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/166 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/166 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 28 (OVERLAPS) 0/166 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 166/166 variables, and 250 constraints, problems are : Problem set: 0 solved, 94 unsolved in 11984 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 87/87 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 87/179 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 95/166 variables, 71/250 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/166 variables, 94/344 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/166 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 0/166 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 166/166 variables, and 344 constraints, problems are : Problem set: 0 solved, 94 unsolved in 2825 ms.
Refiners :[Domain max(s): 71/71 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 71/71 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 87/87 constraints]
After SMT, in 14866ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 14868ms
Starting structural reductions in SI_CTL mode, iteration 1 : 71/73 places, 95/98 transitions.
Applied a total of 0 rules in 12 ms. Remains 71 /71 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 15118 ms. Remains : 71/73 places, 95/98 transitions.
[2024-05-30 02:25:13] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:25:13] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:25:13] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-30 02:25:13] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:25:13] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:25:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality2791594672329768903.gal : 2 ms
[2024-05-30 02:25:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality14893815443238337015.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/CTLCardinality2791594672329768903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14893815443238337015.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG((EF((p66==0)) + EG(EF((p5==0)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EG(E(TRUE U (p5==0))))) * !(E(TRUE U (p66==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...520
(forward)formula 0,1,1.36571,46348,1,0,276,271666,211,100,3123,273470,203
FORMULA ShieldRVs-PT-005A-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 73 cols
[2024-05-30 02:25:15] [INFO ] Computed 21 invariants in 0 ms
[2024-05-30 02:25:15] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 02:25:15] [INFO ] Invariant cache hit.
[2024-05-30 02:25:15] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:25:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:25:16] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:25:17] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:25:17] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-30 02:25:17] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:25:17] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-30 02:25:17] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-05-30 02:25:17] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:25:18] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:25:18] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
[2024-05-30 02:25:18] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:25:18] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:25:18] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-30 02:25:18] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-30 02:25:18] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-30 02:25:18] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:25:19] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:25:19] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:25:19] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-30 02:25:19] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:25:19] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:25:19] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:25:19] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:25:19] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-30 02:25:19] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:25:19] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:25:20] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:25:20] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:25:20] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:25:20] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6132 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2843 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 9009ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9010ms
Finished structural reductions in LTL mode , in 1 iterations and 9134 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:25:24] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:25:24] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:25:24] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:25:24] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:25:24] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:25:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality9665068882398696716.gal : 14 ms
[2024-05-30 02:25:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality12165492762180399364.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/CTLCardinality9665068882398696716.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12165492762180399364.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.528171,23336,2,2700,5,58054,6,0,392,141855,0


Converting to forward existential form...Done !
original formula: EX(A(((AF((p51==1)) * !(((p50==0)||(p45==1)))) * (A(EG((p23==0)) U (((p67==0)||(p37==1))&&(p53==1))) * ((p19==1) + !((A(((p37==0)||(p22==...234
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(E(TRUE U !(E(TRUE U !(((p67==0)||(p54==1)))))))))) * !(E(!(E(TRUE U !(E(TRUE U !(((p67==0)|...593
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Detected timeout of ITS tools.
[2024-05-30 02:25:54] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:25:54] [INFO ] Applying decomposition
[2024-05-30 02:25:54] [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/graph11190713153081261609.txt' '-o' '/tmp/graph11190713153081261609.bin' '-w' '/tmp/graph11190713153081261609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11190713153081261609.bin' '-l' '-1' '-v' '-w' '/tmp/graph11190713153081261609.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:25:54] [INFO ] Decomposing Gal with order
[2024-05-30 02:25:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:25:54] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:25:54] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:25:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 18 ms.
[2024-05-30 02:25:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality7579381230604143861.gal : 20 ms
[2024-05-30 02:25:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality14315581733071406422.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/CTLCardinality7579381230604143861.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14315581733071406422.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.01381,39292,553,29,52270,425,116,252605,31,2606,0


Converting to forward existential form...Done !
original formula: EX(A(((AF((i3.u15.p51==1)) * !(((i3.u14.p50==0)||(i3.u13.p45==1)))) * (A(EG((i1.u7.p23==0)) U (((i4.u19.p67==0)||(i2.u11.p37==1))&&(i3.u1...333
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(E(TRUE U !(E(TRUE U !(((i4.u19.p67==0)||(i3.u15.p54==1)))))))))) * !(E(!(E(TRUE U !(E(TRUE ...786
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 72 transition count 97
Applied a total of 2 rules in 13 ms. Remains 72 /73 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 72 cols
[2024-05-30 02:26:24] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 02:26:24] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 02:26:24] [INFO ] Invariant cache hit.
[2024-05-30 02:26:24] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-05-30 02:26:24] [INFO ] Redundant transitions in 25 ms returned [30]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 95 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 72 cols
[2024-05-30 02:26:24] [INFO ] Computed 21 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:26:25] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-30 02:26:25] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:26:25] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-30 02:26:25] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:26:25] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:26:25] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-30 02:26:25] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:26:25] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-05-30 02:26:25] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:26:25] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-30 02:26:25] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-30 02:26:25] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:26:25] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 0 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:26:26] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:26:27] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 10/125 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:26:27] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 96/168 variables, 72/198 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:26:28] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:26:28] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:26:28] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:26:28] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-30 02:26:28] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:26:28] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-30 02:26:28] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 6/205 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:26:28] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/168 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:26:29] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 02:26:29] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-30 02:26:29] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/168 variables, 3/209 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:26:29] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:26:30] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/168 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:26:30] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 0 ms to minimize.
[2024-05-30 02:26:30] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-30 02:26:30] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-30 02:26:30] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-30 02:26:30] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-30 02:26:30] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/168 variables, 6/217 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:26:30] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/168 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/168 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:26:31] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-30 02:26:31] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:26:31] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:26:31] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:26:31] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:26:31] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/168 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:26:32] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 0 ms to minimize.
[2024-05-30 02:26:32] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/168 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/168 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 22 (OVERLAPS) 0/168 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 226 constraints, problems are : Problem set: 0 solved, 95 unsolved in 8304 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (OVERLAPS) 1/72 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 61/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (OVERLAPS) 96/168 variables, 72/226 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/168 variables, 95/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/168 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 95 unsolved
[2024-05-30 02:26:35] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/168 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 11 (OVERLAPS) 0/168 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 322 constraints, problems are : Problem set: 0 solved, 95 unsolved in 5132 ms.
Refiners :[Domain max(s): 72/72 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 62/62 constraints]
After SMT, in 13487ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 13488ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/73 places, 96/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 72 /72 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 13675 ms. Remains : 72/73 places, 96/98 transitions.
[2024-05-30 02:26:38] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:26:38] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:26:38] [INFO ] Input system was already deterministic with 96 transitions.
[2024-05-30 02:26:38] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:26:38] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:26:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality17297177415665082277.gal : 1 ms
[2024-05-30 02:26:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality7566866759393722926.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/CTLCardinality17297177415665082277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7566866759393722926.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00264e+10,0.519329,23324,2,2640,5,57370,6,0,386,140167,0


Converting to forward existential form...Done !
original formula: AF(((p12==0)&&(p69==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((p12==0)&&(p69==1))))] = FALSE
Hit Full ! (commute/partial/dont) 84/0/12
Detected timeout of ITS tools.
[2024-05-30 02:27:08] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:27:08] [INFO ] Applying decomposition
[2024-05-30 02:27:08] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15770763604764301723.txt' '-o' '/tmp/graph15770763604764301723.bin' '-w' '/tmp/graph15770763604764301723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15770763604764301723.bin' '-l' '-1' '-v' '-w' '/tmp/graph15770763604764301723.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:27:08] [INFO ] Decomposing Gal with order
[2024-05-30 02:27:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:27:08] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-30 02:27:08] [INFO ] Flatten gal took : 7 ms
[2024-05-30 02:27:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 2 ms.
[2024-05-30 02:27:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality14388714512440516046.gal : 7 ms
[2024-05-30 02:27:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality14766548164815229472.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/CTLCardinality14388714512440516046.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14766548164815229472.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.00264e+10,1.09162,39824,696,29,54771,369,138,251809,33,2156,0


Converting to forward existential form...Done !
original formula: AF(((i0.u3.p12==0)&&(i4.u20.p69==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((i0.u3.p12==0)&&(i4.u20.p69==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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 73 cols
[2024-05-30 02:27:38] [INFO ] Computed 21 invariants in 2 ms
[2024-05-30 02:27:38] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 02:27:38] [INFO ] Invariant cache hit.
[2024-05-30 02:27:38] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:27:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:27:39] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-30 02:27:39] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:27:39] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:27:39] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-30 02:27:39] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:27:39] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-30 02:27:39] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:27:39] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-30 02:27:39] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2024-05-30 02:27:39] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-30 02:27:39] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:27:39] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-30 02:27:39] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2024-05-30 02:27:40] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-30 02:27:40] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:27:40] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 02:27:40] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-30 02:27:40] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-30 02:27:40] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:27:40] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:27:40] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-30 02:27:40] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:27:40] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:27:40] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-30 02:27:40] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:27:41] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 0 ms to minimize.
[2024-05-30 02:27:41] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-30 02:27:41] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-30 02:27:41] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:27:42] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:27:42] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:27:42] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 1 ms to minimize.
[2024-05-30 02:27:42] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:27:42] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:27:42] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:27:42] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:27:42] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:27:43] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:27:43] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
[2024-05-30 02:27:43] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:27:43] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-30 02:27:43] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-30 02:27:43] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:27:44] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:27:44] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-30 02:27:44] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:27:44] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 6331 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2888 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 9258ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9259ms
Finished structural reductions in LTL mode , in 1 iterations and 9403 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:27:48] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:27:48] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:27:48] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:27:48] [INFO ] Flatten gal took : 12 ms
[2024-05-30 02:27:48] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:27:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality5652357297736214906.gal : 1 ms
[2024-05-30 02:27:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality8089267625763225565.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/CTLCardinality5652357297736214906.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8089267625763225565.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.538861,23344,2,2700,5,58054,6,0,392,141855,0


Converting to forward existential form...Done !
original formula: EF((AX(AG((AF((p71==1)) + AF(((p62==0)||(p57==1)))))) * (AF(((((p22==0)&&(p42==1))&&(p3==0))||((p68==0)&&(p10==1)))) + AG(AX((p27==0)))))...156
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((!(EG(!((p71==1)))) + !(EG(!(((p62==0)||(p57==1))))))))))))) * !(EG(!(...377
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Detected timeout of ITS tools.
[2024-05-30 02:28:18] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:28:18] [INFO ] Applying decomposition
[2024-05-30 02:28:18] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4623959165927911355.txt' '-o' '/tmp/graph4623959165927911355.bin' '-w' '/tmp/graph4623959165927911355.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4623959165927911355.bin' '-l' '-1' '-v' '-w' '/tmp/graph4623959165927911355.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:28:18] [INFO ] Decomposing Gal with order
[2024-05-30 02:28:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:28:18] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:28:18] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:28:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 1 ms.
[2024-05-30 02:28:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality484216983692785503.gal : 1 ms
[2024-05-30 02:28:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality5577407518000789748.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/CTLCardinality484216983692785503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5577407518000789748.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.29753,41932,750,29,56933,376,123,266286,31,2318,0


Converting to forward existential form...Done !
original formula: EF((AX(AG((AF((i4.u20.p71==1)) + AF(((i4.u17.p62==0)||(i3.u16.p57==1)))))) * (AF(((((i1.u6.p22==0)&&(i2.u12.p42==1))&&(i0.u1.p3==0))||((i...215
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * !(EX(!(!(E(TRUE U !((!(EG(!((i4.u20.p71==1)))) + !(EG(!(((i4.u17.p62==0)||(i3.u16.p57==1))...457
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 73 /73 variables (removed 0) and now considering 98/98 (removed 0) transitions.
[2024-05-30 02:28:48] [INFO ] Invariant cache hit.
[2024-05-30 02:28:48] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-30 02:28:48] [INFO ] Invariant cache hit.
[2024-05-30 02:28:48] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2024-05-30 02:28:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:28:48] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-05-30 02:28:48] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-30 02:28:48] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 0 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 19/113 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-30 02:28:49] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:28:50] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-30 02:28:50] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-30 02:28:50] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/73 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 98/171 variables, 73/192 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:28:50] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-30 02:28:50] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-30 02:28:50] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-30 02:28:50] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:28:51] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-05-30 02:28:51] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:28:51] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 0 ms to minimize.
[2024-05-30 02:28:51] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:28:51] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-30 02:28:51] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/171 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:28:52] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-30 02:28:52] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-30 02:28:52] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:28:52] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-30 02:28:52] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
[2024-05-30 02:28:52] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-30 02:28:52] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 1 ms to minimize.
[2024-05-30 02:28:52] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/171 variables, 8/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/171 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 97 unsolved
[2024-05-30 02:28:53] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-30 02:28:53] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-30 02:28:53] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-30 02:28:53] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/171 variables, 4/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 16 (OVERLAPS) 0/171 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 171/171 variables, and 214 constraints, problems are : Problem set: 0 solved, 97 unsolved in 5753 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (OVERLAPS) 1/73 variables, 21/93 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 47/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 98/171 variables, 73/214 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/171 variables, 97/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/171 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 171/171 variables, and 311 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2870 ms.
Refiners :[Domain max(s): 73/73 constraints, Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 73/73 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 47/47 constraints]
After SMT, in 8648ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 8650ms
Finished structural reductions in LTL mode , in 1 iterations and 8796 ms. Remains : 73/73 places, 98/98 transitions.
[2024-05-30 02:28:57] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:28:57] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:28:57] [INFO ] Input system was already deterministic with 98 transitions.
[2024-05-30 02:28:57] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:28:57] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:28:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality11469894335945006552.gal : 1 ms
[2024-05-30 02:28:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality9705595122862785778.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/CTLCardinality11469894335945006552.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9705595122862785778.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,0.527666,23336,2,2700,5,58054,6,0,392,141855,0


Converting to forward existential form...Done !
original formula: EG(A(EX(TRUE) U AX(E(A((p14==1) U (p68==1)) U (((p39==1)||(p22==0))||(p70==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EX(!(E(!((E(!((p68==1)) U (!((p14==1)) * !((p68==1)))) + EG(!((p68==1))))) U (((p39==1)||(p2...453
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...530
Detected timeout of ITS tools.
[2024-05-30 02:29:27] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:29:27] [INFO ] Applying decomposition
[2024-05-30 02:29:27] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3947569161939889060.txt' '-o' '/tmp/graph3947569161939889060.bin' '-w' '/tmp/graph3947569161939889060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3947569161939889060.bin' '-l' '-1' '-v' '-w' '/tmp/graph3947569161939889060.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:29:27] [INFO ] Decomposing Gal with order
[2024-05-30 02:29:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:29:27] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:29:27] [INFO ] Flatten gal took : 9 ms
[2024-05-30 02:29:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 1 ms.
[2024-05-30 02:29:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality13848792846186749226.gal : 1 ms
[2024-05-30 02:29:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality1349313779288204650.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/CTLCardinality13848792846186749226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1349313779288204650.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.16864,41408,570,29,53750,366,116,268573,31,2303,0


Converting to forward existential form...Done !
original formula: EG(A(EX(TRUE) U AX(E(A((i0.u4.p14==1) U (i4.u19.p68==1)) U (((i2.u11.p39==1)||(i1.u6.p22==0))||(i4.u20.p70==1))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(!(!(EX(!(E(!((E(!((i4.u19.p68==1)) U (!((i0.u4.p14==1)) * !((i4.u19.p68==1)))) + EG(!((i4.u19.p6...594
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
Detected timeout of ITS tools.
[2024-05-30 02:29:57] [INFO ] Flatten gal took : 6 ms
[2024-05-30 02:29:57] [INFO ] Flatten gal took : 3 ms
[2024-05-30 02:29:57] [INFO ] Applying decomposition
[2024-05-30 02:29:57] [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/graph13236792360855287574.txt' '-o' '/tmp/graph13236792360855287574.bin' '-w' '/tmp/graph13236792360855287574.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13236792360855287574.bin' '-l' '-1' '-v' '-w' '/tmp/graph13236792360855287574.weights' '-q' '0' '-e' '0.001'
[2024-05-30 02:29:57] [INFO ] Decomposing Gal with order
[2024-05-30 02:29:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:29:57] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:29:57] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:29:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 1 ms.
[2024-05-30 02:29:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality11907031903234325028.gal : 1 ms
[2024-05-30 02:29:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality1071428312725364337.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/CTLCardinality11907031903234325028.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1071428312725364337.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.40013e+10,1.06489,39292,570,29,52513,398,116,250202,31,2402,0


Converting to forward existential form...Done !
original formula: EG((((i4.u20.p69==0)||(i2.u9.p34==1))||((i1.u5.p20==0)||(i3.u16.p57==0))))
=> equivalent forward existential formula: [FwdG(Init,(((i4.u20.p69==0)||(i2.u9.p34==1))||((i1.u5.p20==0)||(i3.u16.p57==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
(forward)formula 0,1,336.957,3044108,1,0,2.76176e+06,398,411,1.69695e+07,111,2402,1229033
FORMULA ShieldRVs-PT-005A-CTLCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF(((AG(E((i1.u7.p23!=1) U E(((i3.u16.p55==0)||(i4.u18.p64==1)) U ((i0.u3.p9==0)||(i4.u17.p62==1))))) * AF(AX(((i2.u9.p31==0)||(i1.u6.p22...283
=> equivalent forward existential formula: ([(((FwdU(Init,TRUE) * (!(E(TRUE U !(E((i1.u7.p23!=1) U E(((i3.u16.p55==0)||(i4.u18.p64==1)) U ((i0.u3.p9==0)||(...717
Reverse transition relation is NOT exact ! Due to transitions t37, t41, t47, t50, t58, t64, t67, t69, i0.t93, i0.t53, i0.u1.t0, i0.u1.t1, i0.u3.t2, i0.u3.t...603
(forward)formula 1,1,937.824,3703448,1,0,3.0947e+06,398,317,1.91508e+07,80,2402,331552
FORMULA ShieldRVs-PT-005A-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(((i0.u4.p15==0)||(i0.u2.p8==1)) U AX(!(EF((i3.u16.p58==0)))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(EX(!(!(E(TRUE U (i3.u16.p58==0)))))))))) * !(E(!(!(EX(!(!(E(TRUE U (i3.u16.p58==0))))))) U (!...246
(forward)formula 2,0,1302.82,4070936,1,0,3.0947e+06,398,349,1.99262e+07,82,2402,837232
FORMULA ShieldRVs-PT-005A-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2024-05-30 02:54:18] [INFO ] Applying decomposition
[2024-05-30 02:54:18] [INFO ] Flatten gal took : 4 ms
[2024-05-30 02:54:18] [INFO ] Decomposing Gal with order
[2024-05-30 02:54:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 02:54:18] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 02:54:18] [INFO ] Flatten gal took : 8 ms
[2024-05-30 02:54:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 1 ms.
[2024-05-30 02:54:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality12755257433424858916.gal : 1 ms
[2024-05-30 02:54:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality13775490609251448757.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/CTLCardinality12755257433424858916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13775490609251448757.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 7 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.40013e+10,0.418052,20480,779,28,33450,118,150,66265,29,272,0


Converting to forward existential form...Done !
original formula: AG(((EF(EG((u6.p17==1))) + AF(((u16.p54==0)&&(u2.p3==1)))) + (AG((u16.p51==0)) + AF(((u19.p63==0)&&(u17.p55==1))))))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !((E(TRUE U EG((u6.p17==1))) + !(EG(!(((u16.p54==0)&&(u2.p3==1)))))))) * !(!(E(TRUE U ...216
Reverse transition relation is NOT exact ! Due to transitions t32, t38, t41, t47, t51, t52, t58, t61, t66, t69, t75, t78, t85, t90, t94, u2.t0, u2.t1, u4.t...491
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using 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 21
(forward)formula 0,0,499.99,8609356,1,0,1.31821e+07,147,538,4.43096e+07,80,276,2603534
FORMULA ShieldRVs-PT-005A-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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="ShieldRVs-PT-005A"
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 ShieldRVs-PT-005A, 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 r356-tall-171683761800769"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-005A.tgz
mv ShieldRVs-PT-005A 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 ;