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-171683761500617.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 ShieldPPPt-PT-010B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761500617
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 11 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 11 14:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 185K 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 ShieldPPPt-PT-010B-CTLCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-010B-CTLCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-010B-CTLCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-010B-CTLCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-010B-CTLCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-010B-CTLCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-010B-CTLCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-010B-CTLCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-010B-CTLCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-010B-CTLCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-010B-CTLCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-010B-CTLCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-010B-CTLCardinality-2023-12
FORMULA_NAME ShieldPPPt-PT-010B-CTLCardinality-2023-13
FORMULA_NAME ShieldPPPt-PT-010B-CTLCardinality-2023-14
FORMULA_NAME ShieldPPPt-PT-010B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717009021107

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 18:57:02] [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-29 18:57:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:57:02] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-29 18:57:02] [INFO ] Transformed 783 places.
[2024-05-29 18:57:02] [INFO ] Transformed 713 transitions.
[2024-05-29 18:57:02] [INFO ] Found NUPN structural information;
[2024-05-29 18:57:02] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
FORMULA ShieldPPPt-PT-010B-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 81 out of 783 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 783/783 places, 713/713 transitions.
Discarding 93 places :
Symmetric choice reduction at 0 with 93 rule applications. Total rules 93 place count 690 transition count 620
Iterating global reduction 0 with 93 rules applied. Total rules applied 186 place count 690 transition count 620
Applied a total of 186 rules in 124 ms. Remains 690 /783 variables (removed 93) and now considering 620/713 (removed 93) transitions.
// Phase 1: matrix 620 rows 690 cols
[2024-05-29 18:57:02] [INFO ] Computed 111 invariants in 23 ms
[2024-05-29 18:57:03] [INFO ] Implicit Places using invariants in 394 ms returned []
[2024-05-29 18:57:03] [INFO ] Invariant cache hit.
[2024-05-29 18:57:03] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 841 ms to find 0 implicit places.
Running 619 sub problems to find dead transitions.
[2024-05-29 18:57:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/689 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/690 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 619 unsolved
[2024-05-29 18:57:15] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 10 ms to minimize.
[2024-05-29 18:57:15] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:57:15] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:57:15] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:57:16] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:57:16] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:57:16] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:57:16] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:57:16] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:57:16] [INFO ] Deduced a trap composed of 16 places in 177 ms of which 4 ms to minimize.
[2024-05-29 18:57:16] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:57:16] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 2 ms to minimize.
[2024-05-29 18:57:16] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:57:16] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:57:17] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:57:17] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:57:17] [INFO ] Deduced a trap composed of 25 places in 154 ms of which 4 ms to minimize.
[2024-05-29 18:57:17] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:57:17] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:57:17] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/690 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 619 unsolved
[2024-05-29 18:57:19] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:57:19] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:57:19] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:57:19] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:57:20] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-29 18:57:20] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:57:20] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:57:20] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:57:20] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:57:20] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:57:20] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:57:20] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:57:20] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:57:21] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 4 ms to minimize.
[2024-05-29 18:57:21] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 3 ms to minimize.
[2024-05-29 18:57:21] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:57:21] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:57:21] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:57:21] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:57:21] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/690 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 619 unsolved
[2024-05-29 18:57:30] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:57:30] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:57:30] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 3 ms to minimize.
[2024-05-29 18:57:30] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:57:31] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:57:31] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:57:31] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:57:31] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:57:31] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:57:31] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-29 18:57:31] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 2 ms to minimize.
[2024-05-29 18:57:31] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:57:32] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:57:32] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:57:32] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:57:32] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-29 18:57:32] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:57:32] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:57:32] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:57:32] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/690 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 619 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 690/1310 variables, and 171 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/690 constraints, PredecessorRefiner: 619/619 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 619 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/689 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (OVERLAPS) 1/690 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/690 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 619 unsolved
[2024-05-29 18:57:42] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:57:43] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:57:43] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:57:43] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:57:43] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:57:44] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:57:44] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:57:44] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:57:44] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:57:44] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:57:44] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:57:44] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:57:45] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:57:45] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:57:45] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:57:45] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:57:45] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:57:45] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:57:45] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:57:45] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/690 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 619 unsolved
[2024-05-29 18:57:48] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:57:49] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:57:49] [INFO ] Deduced a trap composed of 24 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:57:50] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:57:51] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/690 variables, 11/202 constraints. Problems are: Problem set: 0 solved, 619 unsolved
[2024-05-29 18:57:55] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:57:58] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:57:58] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 619 unsolved
[2024-05-29 18:58:03] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 690/1310 variables, and 206 constraints, problems are : Problem set: 0 solved, 619 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/690 constraints, PredecessorRefiner: 0/619 constraints, Known Traps: 95/95 constraints]
After SMT, in 60176ms problems are : Problem set: 0 solved, 619 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Starting structural reductions in LTL mode, iteration 1 : 690/783 places, 620/713 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61194 ms. Remains : 690/783 places, 620/713 transitions.
Support contains 81 out of 690 places after structural reductions.
[2024-05-29 18:58:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 18:58:03] [INFO ] Flatten gal took : 67 ms
[2024-05-29 18:58:03] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldPPPt-PT-010B-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 18:58:04] [INFO ] Flatten gal took : 31 ms
[2024-05-29 18:58:04] [INFO ] Input system was already deterministic with 620 transitions.
Support contains 53 out of 690 places (down from 81) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1480 ms. (27 steps per ms) remains 2/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
[2024-05-29 18:58:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 59/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 627/690 variables, 106/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 18:58:04] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:58:04] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:58:05] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:58:05] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:58:05] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/690 variables, 5/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 620/1310 variables, 690/806 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 18:58:05] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:58:05] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:58:05] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:58:05] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1310 variables, 4/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1310 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1310 variables, 0/810 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1310/1310 variables, and 810 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1011 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 690/690 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 59/63 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 627/690 variables, 106/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/690 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 18:58:05] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:58:05] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 7/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 620/1310 variables, 690/817 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1310 variables, 2/819 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 2 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 2 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:58:06] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1310 variables, 6/825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1310 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1310 variables, 0/825 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1310/1310 variables, and 825 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1311 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 690/690 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 22/22 constraints]
After SMT, in 2330ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 497 ms.
Support contains 4 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 620/620 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 690 transition count 480
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 142 rules applied. Total rules applied 282 place count 550 transition count 478
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 285 place count 549 transition count 476
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 287 place count 547 transition count 476
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 71 Pre rules applied. Total rules applied 287 place count 547 transition count 405
Deduced a syphon composed of 71 places in 2 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 429 place count 476 transition count 405
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 442 place count 463 transition count 392
Iterating global reduction 4 with 13 rules applied. Total rules applied 455 place count 463 transition count 392
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 455 place count 463 transition count 382
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 475 place count 453 transition count 382
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 4 with 338 rules applied. Total rules applied 813 place count 284 transition count 213
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 869 place count 256 transition count 213
Partial Free-agglomeration rule applied 27 times.
Drop transitions (Partial Free agglomeration) removed 27 transitions
Iterating global reduction 4 with 27 rules applied. Total rules applied 896 place count 256 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 897 place count 255 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 898 place count 254 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 898 place count 254 transition count 210
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 902 place count 252 transition count 210
Applied a total of 902 rules in 157 ms. Remains 252 /690 variables (removed 438) and now considering 210/620 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 252/690 places, 210/620 transitions.
RANDOM walk for 40000 steps (8 resets) in 600 ms. (66 steps per ms) remains 1/2 properties
BEST_FIRST walk for 24136 steps (5 resets) in 77 ms. (309 steps per ms) remains 0/1 properties
[2024-05-29 18:58:07] [INFO ] Flatten gal took : 26 ms
[2024-05-29 18:58:07] [INFO ] Flatten gal took : 25 ms
[2024-05-29 18:58:08] [INFO ] Input system was already deterministic with 620 transitions.
Computed a total of 164 stabilizing places and 164 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 620/620 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 672 transition count 602
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 672 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 671 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 671 transition count 601
Applied a total of 38 rules in 90 ms. Remains 671 /690 variables (removed 19) and now considering 601/620 (removed 19) transitions.
// Phase 1: matrix 601 rows 671 cols
[2024-05-29 18:58:08] [INFO ] Computed 111 invariants in 8 ms
[2024-05-29 18:58:08] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-29 18:58:08] [INFO ] Invariant cache hit.
[2024-05-29 18:58:08] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 18:58:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 18:58:19] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:58:19] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:58:19] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:58:19] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:58:19] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:58:19] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:58:20] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:58:20] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:58:20] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 4 ms to minimize.
[2024-05-29 18:58:20] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:58:20] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:58:20] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:58:20] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 17 places in 154 ms of which 4 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 18:58:23] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:58:23] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:58:23] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:58:23] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 3 ms to minimize.
[2024-05-29 18:58:23] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:58:23] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:58:23] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:58:24] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:58:24] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:58:24] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:58:24] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 3 ms to minimize.
[2024-05-29 18:58:24] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:58:24] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:58:24] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:58:24] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:58:25] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:58:25] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:58:25] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-29 18:58:25] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:58:25] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 18:58:33] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:58:33] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:58:34] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:58:34] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:58:34] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:58:34] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:58:34] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:58:34] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:58:34] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:58:34] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:58:34] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:58:35] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:58:35] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-29 18:58:35] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:58:35] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:58:35] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:58:35] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:58:35] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:58:35] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:58:36] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 18:58:38] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 172 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 18:58:44] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:58:47] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:58:48] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:58:48] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:58:48] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:58:48] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:58:48] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:58:48] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:58:48] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:58:49] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:58:49] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:58:49] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:58:49] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:58:49] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:58:49] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 15/187 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 18:58:54] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:58:54] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:58:55] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:58:56] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (OVERLAPS) 601/1272 variables, 671/862 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1272 variables, 600/1462 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 18:59:07] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:59:07] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:59:08] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 1465 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 671/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 83/83 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 671/690 places, 601/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60750 ms. Remains : 671/690 places, 601/620 transitions.
[2024-05-29 18:59:08] [INFO ] Flatten gal took : 21 ms
[2024-05-29 18:59:08] [INFO ] Flatten gal took : 22 ms
[2024-05-29 18:59:08] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 18:59:08] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:59:08] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:59:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality7264438745706453488.gal : 10 ms
[2024-05-29 18:59:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality16071126234955563014.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/CTLCardinality7264438745706453488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16071126234955563014.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 690/690 places, 620/620 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 689 transition count 477
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 144 rules applied. Total rules applied 286 place count 547 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 287 place count 546 transition count 475
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 71 Pre rules applied. Total rules applied 287 place count 546 transition count 404
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 429 place count 475 transition count 404
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 442 place count 462 transition count 391
Iterating global reduction 3 with 13 rules applied. Total rules applied 455 place count 462 transition count 391
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 455 place count 462 transition count 381
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 475 place count 452 transition count 381
Performed 158 Post agglomeration using F-continuation condition.Transition count delta: 158
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 3 with 316 rules applied. Total rules applied 791 place count 294 transition count 223
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 793 place count 292 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 794 place count 291 transition count 221
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 794 place count 291 transition count 219
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 798 place count 289 transition count 219
Applied a total of 798 rules in 102 ms. Remains 289 /690 variables (removed 401) and now considering 219/620 (removed 401) transitions.
// Phase 1: matrix 219 rows 289 cols
[2024-05-29 19:00:09] [INFO ] Computed 110 invariants in 1 ms
[2024-05-29 19:00:09] [INFO ] Implicit Places using invariants in 145 ms returned [267, 271]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 146 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 287/690 places, 219/620 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 285 transition count 217
Applied a total of 4 rules in 13 ms. Remains 285 /287 variables (removed 2) and now considering 217/219 (removed 2) transitions.
// Phase 1: matrix 217 rows 285 cols
[2024-05-29 19:00:09] [INFO ] Computed 108 invariants in 1 ms
[2024-05-29 19:00:09] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-29 19:00:09] [INFO ] Invariant cache hit.
[2024-05-29 19:00:09] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 285/690 places, 217/620 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 563 ms. Remains : 285/690 places, 217/620 transitions.
[2024-05-29 19:00:09] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:00:09] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:00:10] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-29 19:00:10] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:00:10] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:00:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality14766347152888306462.gal : 1 ms
[2024-05-29 19:00:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality3804056936620710535.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/CTLCardinality14766347152888306462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3804056936620710535.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.75892e+42,0.6228,28468,2,530,5,99651,6,0,1359,168773,0


Converting to forward existential form...Done !
original formula: EG(((p457==0)||(p758==1)))
=> equivalent forward existential formula: [FwdG(Init,((p457==0)||(p758==1)))] != FALSE
Hit Full ! (commute/partial/dont) 213/0/4
(forward)formula 0,1,1.67023,56188,1,0,9,251185,19,4,6572,313329,8
FORMULA ShieldPPPt-PT-010B-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 620/620 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 673 transition count 603
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 673 transition count 603
Applied a total of 34 rules in 23 ms. Remains 673 /690 variables (removed 17) and now considering 603/620 (removed 17) transitions.
// Phase 1: matrix 603 rows 673 cols
[2024-05-29 19:00:11] [INFO ] Computed 111 invariants in 10 ms
[2024-05-29 19:00:11] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-29 19:00:11] [INFO ] Invariant cache hit.
[2024-05-29 19:00:12] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2024-05-29 19:00:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/673 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:00:23] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:00:23] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:00:23] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:00:23] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:00:24] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 0 ms to minimize.
[2024-05-29 19:00:24] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:00:24] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:00:24] [INFO ] Deduced a trap composed of 21 places in 262 ms of which 4 ms to minimize.
[2024-05-29 19:00:24] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-29 19:00:24] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:00:25] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:00:25] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:00:25] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:00:25] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 3 ms to minimize.
[2024-05-29 19:00:25] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:00:25] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:00:26] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:00:26] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:00:26] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:00:26] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/673 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:00:27] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:00:27] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:00:28] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 3 ms to minimize.
[2024-05-29 19:00:28] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:00:28] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:00:28] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:00:28] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 29 places in 125 ms of which 3 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:00:30] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:00:30] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-29 19:00:30] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:00:30] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:00:30] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/673 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:00:39] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:00:39] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:00:39] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-05-29 19:00:39] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:00:39] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:00:39] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:00:39] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:00:39] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 2 ms to minimize.
[2024-05-29 19:00:40] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:00:40] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:00:40] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:00:40] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:00:40] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:00:40] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:00:40] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:00:40] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:00:41] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:00:41] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:00:41] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:00:41] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/673 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 673/1276 variables, and 171 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/673 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/673 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/673 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:00:49] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:00:49] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:00:50] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:00:51] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:00:52] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:00:52] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:00:52] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:00:52] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:00:52] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:00:53] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:00:53] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:00:53] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:00:53] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:00:53] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/673 variables, 14/185 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:00:56] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:00:59] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/673 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:01:03] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/673 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:01:09] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:01:11] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:01:11] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 1)
(s38 1)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 1)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 1)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)timeout

(s83 0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 673/1276 variables, and 191 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/673 constraints, PredecessorRefiner: 0/602 constraints, Known Traps: 80/80 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60114ms
Starting structural reductions in LTL mode, iteration 1 : 673/690 places, 603/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60715 ms. Remains : 673/690 places, 603/620 transitions.
[2024-05-29 19:01:12] [INFO ] Flatten gal took : 19 ms
[2024-05-29 19:01:12] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:01:12] [INFO ] Input system was already deterministic with 603 transitions.
[2024-05-29 19:01:12] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:01:12] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:01:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality640395114832211544.gal : 5 ms
[2024-05-29 19:01:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality2458292858490418875.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/CTLCardinality640395114832211544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2458292858490418875.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 620/620 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 672 transition count 602
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 672 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 671 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 671 transition count 601
Applied a total of 38 rules in 40 ms. Remains 671 /690 variables (removed 19) and now considering 601/620 (removed 19) transitions.
// Phase 1: matrix 601 rows 671 cols
[2024-05-29 19:02:12] [INFO ] Computed 111 invariants in 8 ms
[2024-05-29 19:02:13] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-29 19:02:13] [INFO ] Invariant cache hit.
[2024-05-29 19:02:13] [INFO ] Implicit Places using invariants and state equation in 382 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 19:02:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:02:24] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:02:25] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:02:25] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:02:25] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:02:25] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:02:25] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:02:25] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:02:25] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:02:25] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 3 ms to minimize.
[2024-05-29 19:02:25] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:02:26] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:02:26] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:02:26] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:02:26] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:02:26] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:02:26] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:02:26] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 3 ms to minimize.
[2024-05-29 19:02:26] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:02:27] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:02:27] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:02:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:02:28] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:02:29] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:02:29] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 3 ms to minimize.
[2024-05-29 19:02:29] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:02:29] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:02:29] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:02:29] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:02:29] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:02:29] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 3 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:02:31] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 3 ms to minimize.
[2024-05-29 19:02:31] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:02:31] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:02:39] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 2 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-29 19:02:40] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:02:41] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:02:41] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:02:41] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:02:41] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:02:41] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:02:41] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 171 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:02:49] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:02:51] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:02:52] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:02:52] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:02:53] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:02:53] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:02:53] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:02:53] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:02:53] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:02:53] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:02:53] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:02:54] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:02:54] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:02:54] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:02:54] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 15/186 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:03:00] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:03:04] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/1272 variables, and 188 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 0/600 constraints, Known Traps: 77/77 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 671/690 places, 601/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60732 ms. Remains : 671/690 places, 601/620 transitions.
[2024-05-29 19:03:13] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:03:13] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:03:13] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:03:13] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:03:13] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:03:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality17692083457463042893.gal : 3 ms
[2024-05-29 19:03:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality10935968621442952074.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/CTLCardinality17692083457463042893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10935968621442952074.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 620/620 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 672 transition count 602
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 672 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 671 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 671 transition count 601
Applied a total of 38 rules in 49 ms. Remains 671 /690 variables (removed 19) and now considering 601/620 (removed 19) transitions.
[2024-05-29 19:04:13] [INFO ] Invariant cache hit.
[2024-05-29 19:04:14] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-29 19:04:14] [INFO ] Invariant cache hit.
[2024-05-29 19:04:14] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 19:04:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:04:25] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:04:25] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:04:25] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:04:25] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:04:25] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:04:25] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:04:26] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:04:26] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:04:26] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 4 ms to minimize.
[2024-05-29 19:04:26] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:04:26] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:04:26] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:04:26] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:04:27] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:04:27] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:04:27] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:04:27] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 4 ms to minimize.
[2024-05-29 19:04:27] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:04:27] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:04:27] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:04:29] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:04:29] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:04:29] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:04:29] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 3 ms to minimize.
[2024-05-29 19:04:29] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:04:30] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:04:30] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:04:30] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:04:30] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:04:30] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:04:30] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 3 ms to minimize.
[2024-05-29 19:04:30] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:04:30] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:04:30] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:04:31] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:04:31] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:04:31] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:04:31] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-29 19:04:31] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:04:31] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:04:40] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:04:40] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:04:40] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:04:40] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:04:40] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:04:40] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 1 ms to minimize.
[2024-05-29 19:04:40] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:04:41] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:04:41] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:04:41] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:04:41] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:04:41] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:04:41] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:04:41] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:04:41] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:04:42] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:04:42] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:04:42] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:04:42] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:04:42] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 171 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:04:50] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:04:53] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:04:54] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:04:54] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:04:54] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:04:54] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:04:54] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:04:54] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:04:54] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:04:55] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:04:55] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:04:55] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:04:55] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:04:55] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:04:55] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 15/186 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:05:01] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:05:05] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/1272 variables, and 188 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 0/600 constraints, Known Traps: 77/77 constraints]
After SMT, in 60086ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Starting structural reductions in LTL mode, iteration 1 : 671/690 places, 601/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60714 ms. Remains : 671/690 places, 601/620 transitions.
[2024-05-29 19:05:14] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:05:14] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:05:14] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:05:14] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:05:14] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:05:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality10657779951788690433.gal : 2 ms
[2024-05-29 19:05:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality11763385770625851697.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/CTLCardinality10657779951788690433.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11763385770625851697.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 620/620 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 676 transition count 606
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 676 transition count 606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 675 transition count 605
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 675 transition count 605
Applied a total of 30 rules in 49 ms. Remains 675 /690 variables (removed 15) and now considering 605/620 (removed 15) transitions.
// Phase 1: matrix 605 rows 675 cols
[2024-05-29 19:06:15] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 19:06:15] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-29 19:06:15] [INFO ] Invariant cache hit.
[2024-05-29 19:06:15] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2024-05-29 19:06:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/674 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/675 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:06:26] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:06:26] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:06:26] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:06:26] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:06:27] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:06:27] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:06:27] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:06:27] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 4 ms to minimize.
[2024-05-29 19:06:27] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:06:27] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:06:27] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:06:27] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:06:28] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:06:28] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:06:28] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 3 ms to minimize.
[2024-05-29 19:06:28] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:06:28] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:06:28] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:06:28] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:06:28] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/675 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:06:29] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:06:30] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:06:30] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:06:31] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 3 ms to minimize.
[2024-05-29 19:06:31] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:06:31] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:06:31] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:06:31] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:06:31] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:06:31] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 3 ms to minimize.
[2024-05-29 19:06:31] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:06:31] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:06:32] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:06:32] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:06:32] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:06:32] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:06:32] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:06:32] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-29 19:06:32] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:06:32] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/675 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:06:40] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:06:40] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:06:41] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 3 ms to minimize.
[2024-05-29 19:06:41] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 3 ms to minimize.
[2024-05-29 19:06:41] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:06:41] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:06:41] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:06:41] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:06:41] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:06:42] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-29 19:06:42] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:06:42] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:06:42] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:06:42] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:06:42] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:06:42] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:06:42] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:06:42] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:06:43] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:06:43] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:06:45] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 675/1280 variables, and 172 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/675 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/674 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/675 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/675 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:06:53] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:06:53] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:06:54] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:06:55] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:06:55] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:06:55] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:06:55] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:06:55] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:06:55] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:06:55] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:06:55] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:06:56] [INFO ] Deduced a trap composed of 27 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:06:56] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:06:56] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:06:56] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:06:56] [INFO ] Deduced a trap composed of 27 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:06:56] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 5 ms to minimize.
[2024-05-29 19:06:56] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:06:56] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:06:56] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/675 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:06:59] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:06:59] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:07:01] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:07:01] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:07:01] [INFO ] Deduced a trap composed of 38 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:07:02] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:07:02] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:07:02] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:07:02] [INFO ] Deduced a trap composed of 30 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/675 variables, 9/201 constraints. Problems are: Problem set: 0 solved, 604 unsolved
[2024-05-29 19:07:07] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:07:07] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:07:08] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/675 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 675/1280 variables, and 204 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/675 constraints, PredecessorRefiner: 0/604 constraints, Known Traps: 93/93 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 675/690 places, 605/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60679 ms. Remains : 675/690 places, 605/620 transitions.
[2024-05-29 19:07:15] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:07:15] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:07:15] [INFO ] Input system was already deterministic with 605 transitions.
[2024-05-29 19:07:15] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:07:15] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:07:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality16267531892825504715.gal : 2 ms
[2024-05-29 19:07:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality4184987123168960349.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/CTLCardinality16267531892825504715.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4184987123168960349.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:07:45] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:07:45] [INFO ] Applying decomposition
[2024-05-29 19:07:45] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8639677705533489802.txt' '-o' '/tmp/graph8639677705533489802.bin' '-w' '/tmp/graph8639677705533489802.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8639677705533489802.bin' '-l' '-1' '-v' '-w' '/tmp/graph8639677705533489802.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:07:45] [INFO ] Decomposing Gal with order
[2024-05-29 19:07:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:07:45] [INFO ] Removed a total of 95 redundant transitions.
[2024-05-29 19:07:45] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:07:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 19:07:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality7443608526246832857.gal : 6 ms
[2024-05-29 19:07:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality9522071066446087338.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/CTLCardinality7443608526246832857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9522071066446087338.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.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 690/690 places, 620/620 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 689 transition count 475
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 146 rules applied. Total rules applied 290 place count 545 transition count 473
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 292 place count 544 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 293 place count 543 transition count 472
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 71 Pre rules applied. Total rules applied 293 place count 543 transition count 401
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 4 with 142 rules applied. Total rules applied 435 place count 472 transition count 401
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 449 place count 458 transition count 387
Iterating global reduction 4 with 14 rules applied. Total rules applied 463 place count 458 transition count 387
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 463 place count 458 transition count 377
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 483 place count 448 transition count 377
Performed 157 Post agglomeration using F-continuation condition.Transition count delta: 157
Deduced a syphon composed of 157 places in 0 ms
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 4 with 314 rules applied. Total rules applied 797 place count 291 transition count 220
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 799 place count 289 transition count 218
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 800 place count 288 transition count 218
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 800 place count 288 transition count 216
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 804 place count 286 transition count 216
Applied a total of 804 rules in 66 ms. Remains 286 /690 variables (removed 404) and now considering 216/620 (removed 404) transitions.
// Phase 1: matrix 216 rows 286 cols
[2024-05-29 19:08:16] [INFO ] Computed 110 invariants in 1 ms
[2024-05-29 19:08:16] [INFO ] Implicit Places using invariants in 134 ms returned [266, 270]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 135 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 284/690 places, 216/620 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 282 transition count 214
Applied a total of 4 rules in 10 ms. Remains 282 /284 variables (removed 2) and now considering 214/216 (removed 2) transitions.
// Phase 1: matrix 214 rows 282 cols
[2024-05-29 19:08:16] [INFO ] Computed 108 invariants in 0 ms
[2024-05-29 19:08:16] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-29 19:08:16] [INFO ] Invariant cache hit.
[2024-05-29 19:08:16] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 282/690 places, 214/620 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 513 ms. Remains : 282/690 places, 214/620 transitions.
[2024-05-29 19:08:16] [INFO ] Flatten gal took : 4 ms
[2024-05-29 19:08:16] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:08:16] [INFO ] Input system was already deterministic with 214 transitions.
[2024-05-29 19:08:16] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:08:16] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:08:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality5147406388036979765.gal : 1 ms
[2024-05-29 19:08:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality4025413546052179460.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/CTLCardinality5147406388036979765.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4025413546052179460.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,9.89393e+41,0.619911,28232,2,511,5,98699,6,0,1345,167682,0


Converting to forward existential form...Done !
original formula: AF((p196==1))
=> equivalent forward existential formula: [FwdG(Init,!((p196==1)))] = FALSE
Hit Full ! (commute/partial/dont) 212/0/2
(forward)formula 0,0,1.55413,48872,1,0,10,220245,20,4,6513,266517,8
FORMULA ShieldPPPt-PT-010B-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 620/620 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 673 transition count 603
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 673 transition count 603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 672 transition count 602
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 672 transition count 602
Applied a total of 36 rules in 40 ms. Remains 672 /690 variables (removed 18) and now considering 602/620 (removed 18) transitions.
// Phase 1: matrix 602 rows 672 cols
[2024-05-29 19:08:18] [INFO ] Computed 111 invariants in 5 ms
[2024-05-29 19:08:18] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-29 19:08:18] [INFO ] Invariant cache hit.
[2024-05-29 19:08:18] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-29 19:08:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:08:29] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:08:29] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:08:29] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:08:29] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:08:30] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:08:30] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:08:30] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:08:30] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:08:30] [INFO ] Deduced a trap composed of 29 places in 169 ms of which 4 ms to minimize.
[2024-05-29 19:08:30] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:08:30] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:08:30] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:08:30] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:08:31] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:08:31] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 3 ms to minimize.
[2024-05-29 19:08:31] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:08:31] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:08:31] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:08:31] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:08:31] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:08:33] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:08:33] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:08:33] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:08:33] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 2 ms to minimize.
[2024-05-29 19:08:33] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 3 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:08:35] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:08:35] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:08:35] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:08:35] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:08:35] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:08:35] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:08:43] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 2 ms to minimize.
[2024-05-29 19:08:43] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:08:44] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:08:44] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:08:44] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:08:44] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:08:44] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:08:44] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-29 19:08:44] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:08:44] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:08:44] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:08:45] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:08:45] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:08:45] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:08:45] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:08:45] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:08:45] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:08:45] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:08:45] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:08:46] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:08:48] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:08:48] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:08:48] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 672/1274 variables, and 174 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 63/174 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:08:54] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:08:58] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:08:58] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:08:58] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:08:58] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:08:58] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:08:58] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:08:58] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:08:58] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:08:59] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:08:59] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:08:59] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:08:59] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:08:59] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:08:59] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:08:59] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:08:59] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:08:59] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:09:00] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 19/193 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:09:04] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:09:05] [INFO ] Deduced a trap composed of 26 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:09:05] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:09:05] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:09:05] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:09:05] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 6/199 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:09:10] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:09:11] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 2/201 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/1274 variables, and 201 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 0/601 constraints, Known Traps: 90/90 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 672/690 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60672 ms. Remains : 672/690 places, 602/620 transitions.
[2024-05-29 19:09:18] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:09:18] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:09:18] [INFO ] Input system was already deterministic with 602 transitions.
[2024-05-29 19:09:18] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:09:18] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:09:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality16640015949388211762.gal : 2 ms
[2024-05-29 19:09:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality12725577068186720335.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/CTLCardinality16640015949388211762.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12725577068186720335.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 620/620 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 672 transition count 602
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 672 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 671 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 671 transition count 601
Applied a total of 38 rules in 40 ms. Remains 671 /690 variables (removed 19) and now considering 601/620 (removed 19) transitions.
// Phase 1: matrix 601 rows 671 cols
[2024-05-29 19:10:19] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 19:10:19] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-29 19:10:19] [INFO ] Invariant cache hit.
[2024-05-29 19:10:19] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 19:10:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:10:30] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:10:30] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:10:30] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:10:30] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:10:30] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:10:31] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:10:31] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:10:31] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:10:31] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 4 ms to minimize.
[2024-05-29 19:10:31] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:10:31] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:10:31] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:10:31] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:10:32] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:10:32] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:10:32] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 2 ms to minimize.
[2024-05-29 19:10:32] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 3 ms to minimize.
[2024-05-29 19:10:32] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:10:32] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:10:32] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:10:34] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:10:34] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:10:34] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:10:34] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 3 ms to minimize.
[2024-05-29 19:10:34] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 3 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:10:36] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:10:36] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:10:36] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 3 ms to minimize.
[2024-05-29 19:10:36] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:10:36] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:10:44] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:10:44] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:10:45] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:10:45] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:10:45] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:10:45] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 2 ms to minimize.
[2024-05-29 19:10:45] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:10:45] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:10:45] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:10:45] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:10:45] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:10:46] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:10:46] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-29 19:10:46] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:10:46] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:10:46] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:10:46] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:10:46] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:10:46] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:10:47] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:10:49] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 172 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:10:55] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:10:58] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:10:59] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:10:59] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:10:59] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:10:59] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:10:59] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:10:59] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:10:59] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 40 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:11:00] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 15/187 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:11:05] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:11:06] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:11:06] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (OVERLAPS) 601/1272 variables, 671/862 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1272 variables, 600/1462 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:11:18] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:11:18] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:11:19] [INFO ] Deduced a trap composed of 19 places in 138 ms of which 3 ms to minimize.
[2024-05-29 19:11:19] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 4 ms to minimize.
SMT process timed out in 60106ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 671/690 places, 601/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60740 ms. Remains : 671/690 places, 601/620 transitions.
[2024-05-29 19:11:19] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:11:19] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:11:19] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:11:19] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:11:19] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:11:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality2452249866364341542.gal : 3 ms
[2024-05-29 19:11:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality17373847392979402574.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/CTLCardinality2452249866364341542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17373847392979402574.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 620/620 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 675 transition count 605
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 675 transition count 605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 674 transition count 604
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 674 transition count 604
Applied a total of 32 rules in 55 ms. Remains 674 /690 variables (removed 16) and now considering 604/620 (removed 16) transitions.
// Phase 1: matrix 604 rows 674 cols
[2024-05-29 19:12:20] [INFO ] Computed 111 invariants in 4 ms
[2024-05-29 19:12:20] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-29 19:12:20] [INFO ] Invariant cache hit.
[2024-05-29 19:12:20] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2024-05-29 19:12:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/673 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/674 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:12:31] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:12:31] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:12:32] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:12:32] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:12:32] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:12:32] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:12:32] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:12:32] [INFO ] Deduced a trap composed of 27 places in 177 ms of which 4 ms to minimize.
[2024-05-29 19:12:32] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:12:32] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:12:32] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:12:32] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:12:33] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:12:33] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:12:33] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 4 ms to minimize.
[2024-05-29 19:12:33] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:12:33] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:12:33] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:12:33] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:12:34] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/674 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:12:35] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:12:36] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 3 ms to minimize.
[2024-05-29 19:12:36] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:12:36] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:12:36] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:12:36] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:12:36] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:12:37] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 3 ms to minimize.
[2024-05-29 19:12:37] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:12:37] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:12:37] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:12:37] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:12:37] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:12:37] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:12:37] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
[2024-05-29 19:12:37] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:12:38] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
[2024-05-29 19:12:38] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:12:38] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:12:38] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/674 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:12:45] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:12:46] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:12:46] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:12:47] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:12:47] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:12:47] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-29 19:12:47] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:12:47] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:12:47] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:12:47] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:12:47] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:12:48] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:12:48] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:12:48] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:12:48] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:12:48] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:12:48] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:12:48] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:12:48] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:12:49] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/674 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/1278 variables, and 171 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/674 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/673 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/674 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/674 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:12:59] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:13:00] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:13:00] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:13:00] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:13:00] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:13:00] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:13:01] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:13:01] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:13:01] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:13:01] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:13:01] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:13:01] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/674 variables, 12/183 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:13:03] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:13:07] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:13:07] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:13:07] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/674 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:13:11] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:13:13] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:13:14] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:13:14] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:13:14] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:13:15] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 6/193 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/1278 variables, and 193 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/674 constraints, PredecessorRefiner: 0/603 constraints, Known Traps: 82/82 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 674/690 places, 604/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60701 ms. Remains : 674/690 places, 604/620 transitions.
[2024-05-29 19:13:20] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:13:20] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:13:20] [INFO ] Input system was already deterministic with 604 transitions.
[2024-05-29 19:13:20] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:13:20] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:13:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality14717752345140996916.gal : 5 ms
[2024-05-29 19:13:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality8799430287780734676.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/CTLCardinality14717752345140996916.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8799430287780734676.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 690/690 places, 620/620 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 140 place count 689 transition count 479
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 142 rules applied. Total rules applied 282 place count 549 transition count 477
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 285 place count 548 transition count 475
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 287 place count 546 transition count 475
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 70 Pre rules applied. Total rules applied 287 place count 546 transition count 405
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 427 place count 476 transition count 405
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 440 place count 463 transition count 392
Iterating global reduction 4 with 13 rules applied. Total rules applied 453 place count 463 transition count 392
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 453 place count 463 transition count 382
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 473 place count 453 transition count 382
Performed 158 Post agglomeration using F-continuation condition.Transition count delta: 158
Deduced a syphon composed of 158 places in 0 ms
Reduce places removed 158 places and 0 transitions.
Iterating global reduction 4 with 316 rules applied. Total rules applied 789 place count 295 transition count 224
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 791 place count 293 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 792 place count 292 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 792 place count 292 transition count 220
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 796 place count 290 transition count 220
Applied a total of 796 rules in 75 ms. Remains 290 /690 variables (removed 400) and now considering 220/620 (removed 400) transitions.
// Phase 1: matrix 220 rows 290 cols
[2024-05-29 19:14:21] [INFO ] Computed 110 invariants in 0 ms
[2024-05-29 19:14:21] [INFO ] Implicit Places using invariants in 140 ms returned [268, 272]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 141 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 288/690 places, 220/620 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 286 transition count 218
Applied a total of 4 rules in 7 ms. Remains 286 /288 variables (removed 2) and now considering 218/220 (removed 2) transitions.
// Phase 1: matrix 218 rows 286 cols
[2024-05-29 19:14:21] [INFO ] Computed 108 invariants in 0 ms
[2024-05-29 19:14:21] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-29 19:14:21] [INFO ] Invariant cache hit.
[2024-05-29 19:14:21] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 286/690 places, 218/620 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 543 ms. Remains : 286/690 places, 218/620 transitions.
[2024-05-29 19:14:21] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:14:21] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:14:21] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-29 19:14:21] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:14:21] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:14:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality11495844616459787727.gal : 1 ms
[2024-05-29 19:14:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality8476189851437864906.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/CTLCardinality11495844616459787727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8476189851437864906.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,2.34523e+42,0.639307,28724,2,532,5,100704,6,0,1364,170441,0


Converting to forward existential form...Done !
original formula: AG(((EF(((p759==1)&&(p435==1))) + (p198==0)) + (p599==1)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * !((p599==1))) * !((p198==0))) * !(E(TRUE U ((p759==1)&&(p435==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t47, t216, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/to...172
(forward)formula 0,0,1.36974,41352,1,0,413,241970,461,187,8025,183226,447
FORMULA ShieldPPPt-PT-010B-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 620/620 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 672 transition count 602
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 672 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 671 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 671 transition count 601
Applied a total of 38 rules in 40 ms. Remains 671 /690 variables (removed 19) and now considering 601/620 (removed 19) transitions.
// Phase 1: matrix 601 rows 671 cols
[2024-05-29 19:14:23] [INFO ] Computed 111 invariants in 6 ms
[2024-05-29 19:14:23] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-29 19:14:23] [INFO ] Invariant cache hit.
[2024-05-29 19:14:23] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 19:14:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:14:34] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:14:34] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:14:34] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:14:34] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:14:35] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:14:35] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:14:35] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:14:35] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:14:35] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 4 ms to minimize.
[2024-05-29 19:14:35] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:14:35] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:14:35] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:14:36] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:14:36] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:14:36] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:14:36] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:14:36] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 4 ms to minimize.
[2024-05-29 19:14:36] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:14:36] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:14:36] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:14:38] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:14:38] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:14:38] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:14:38] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 4 ms to minimize.
[2024-05-29 19:14:38] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:14:39] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:14:39] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:14:39] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:14:39] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:14:39] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:14:39] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-05-29 19:14:39] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:14:39] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:14:39] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:14:39] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:14:40] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:14:40] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:14:40] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 3 ms to minimize.
[2024-05-29 19:14:40] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:14:40] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:14:48] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:14:49] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:14:49] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:14:49] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:14:49] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:14:49] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-29 19:14:49] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:14:49] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:14:49] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:14:49] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:14:50] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:14:50] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:14:50] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:14:50] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:14:50] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:14:50] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:14:50] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:14:50] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:14:51] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:14:51] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:14:53] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 1.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 1.0)
(s383 0.0)
(s384 1.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 172 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:14:59] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:15:03] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:15:03] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:15:03] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:15:03] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:15:03] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:15:03] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:15:03] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:15:04] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:15:04] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:15:04] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:15:04] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:15:04] [INFO ] Deduced a trap composed of 25 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:15:04] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:15:04] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 15/187 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:15:09] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:15:09] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:15:10] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:15:10] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (OVERLAPS) 601/1272 variables, 671/862 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1272 variables, 600/1462 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:15:22] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:15:22] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:15:23] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 1465 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 671/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 83/83 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 671/690 places, 601/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60705 ms. Remains : 671/690 places, 601/620 transitions.
[2024-05-29 19:15:23] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:15:23] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:15:23] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:15:23] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:15:24] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:15:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality15341181473033601757.gal : 2 ms
[2024-05-29 19:15:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality8353673410613035138.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/CTLCardinality15341181473033601757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8353673410613035138.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:15:54] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:15:54] [INFO ] Applying decomposition
[2024-05-29 19:15:54] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6051816476577206606.txt' '-o' '/tmp/graph6051816476577206606.bin' '-w' '/tmp/graph6051816476577206606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6051816476577206606.bin' '-l' '-1' '-v' '-w' '/tmp/graph6051816476577206606.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:15:54] [INFO ] Decomposing Gal with order
[2024-05-29 19:15:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:15:54] [INFO ] Removed a total of 103 redundant transitions.
[2024-05-29 19:15:54] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:15:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 19:15:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality5405962298585306409.gal : 8 ms
[2024-05-29 19:15:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality2977142847145946364.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/CTLCardinality5405962298585306409.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2977142847145946364.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.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 690/690 places, 620/620 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 672 transition count 602
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 672 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 671 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 671 transition count 601
Applied a total of 38 rules in 51 ms. Remains 671 /690 variables (removed 19) and now considering 601/620 (removed 19) transitions.
[2024-05-29 19:16:24] [INFO ] Invariant cache hit.
[2024-05-29 19:16:24] [INFO ] Implicit Places using invariants in 173 ms returned []
[2024-05-29 19:16:24] [INFO ] Invariant cache hit.
[2024-05-29 19:16:24] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 19:16:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:16:35] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:16:36] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:16:36] [INFO ] Deduced a trap composed of 17 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:16:36] [INFO ] Deduced a trap composed of 19 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:16:36] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:16:36] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:16:36] [INFO ] Deduced a trap composed of 28 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:16:36] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:16:36] [INFO ] Deduced a trap composed of 21 places in 170 ms of which 4 ms to minimize.
[2024-05-29 19:16:36] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:16:36] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:16:36] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:16:37] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:16:37] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:16:37] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:16:37] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:16:37] [INFO ] Deduced a trap composed of 17 places in 146 ms of which 4 ms to minimize.
[2024-05-29 19:16:37] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:16:37] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:16:38] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:16:39] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 3 ms to minimize.
[2024-05-29 19:16:39] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:16:39] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:16:40] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 3 ms to minimize.
[2024-05-29 19:16:40] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:16:40] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:16:40] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:16:40] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:16:40] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:16:40] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:16:41] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 3 ms to minimize.
[2024-05-29 19:16:41] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:16:41] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:16:41] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:16:41] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:16:41] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:16:41] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:16:41] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-29 19:16:42] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:16:42] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:16:50] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:16:50] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:16:50] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:16:50] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:16:50] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:16:51] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-29 19:16:51] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:16:51] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:16:51] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:16:51] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:16:51] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:16:51] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:16:52] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:16:52] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:16:52] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:16:52] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:16:52] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:16:52] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:16:52] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:16:52] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 171 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:17:00] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:17:03] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:17:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:17:04] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:17:04] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:17:05] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:17:05] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:17:05] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:17:05] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:17:05] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:17:05] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:17:05] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:17:06] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:17:06] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:17:06] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 15/186 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:17:12] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:17:16] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/1272 variables, and 188 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 0/600 constraints, Known Traps: 77/77 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in LTL mode, iteration 1 : 671/690 places, 601/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60682 ms. Remains : 671/690 places, 601/620 transitions.
[2024-05-29 19:17:24] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:17:24] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:17:24] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:17:25] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:17:25] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:17:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality16896008977201875961.gal : 2 ms
[2024-05-29 19:17:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality2461434614251281983.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/CTLCardinality16896008977201875961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2461434614251281983.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:18:25] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:18:25] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:18:25] [INFO ] Applying decomposition
[2024-05-29 19:18:25] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4854034853942093436.txt' '-o' '/tmp/graph4854034853942093436.bin' '-w' '/tmp/graph4854034853942093436.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4854034853942093436.bin' '-l' '-1' '-v' '-w' '/tmp/graph4854034853942093436.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:18:25] [INFO ] Decomposing Gal with order
[2024-05-29 19:18:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:18:25] [INFO ] Removed a total of 88 redundant transitions.
[2024-05-29 19:18:25] [INFO ] Flatten gal took : 20 ms
[2024-05-29 19:18:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 19:18:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality9062821904147183053.gal : 4 ms
[2024-05-29 19:18:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality6812640099096895355.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/CTLCardinality9062821904147183053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6812640099096895355.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 10 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-29 19:26:35] [INFO ] Applying decomposition
[2024-05-29 19:26:35] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:26:35] [INFO ] Decomposing Gal with order
[2024-05-29 19:26:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:26:35] [INFO ] Removed a total of 25 redundant transitions.
[2024-05-29 19:26:35] [INFO ] Flatten gal took : 19 ms
[2024-05-29 19:26:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 13 ms.
[2024-05-29 19:26:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality15250963945410288819.gal : 5 ms
[2024-05-29 19:26:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality14603798622808146159.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/CTLCardinality15250963945410288819.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14603798622808146159.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 10 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-29 19:34:19] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:34:19] [INFO ] Input system was already deterministic with 620 transitions.
[2024-05-29 19:34:19] [INFO ] Transformed 690 places.
[2024-05-29 19:34:19] [INFO ] Transformed 620 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 19:34:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality8655807299447311638.gal : 2 ms
[2024-05-29 19:34:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality18203869355047491567.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/CTLCardinality8655807299447311638.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18203869355047491567.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 2849938 ms.

BK_STOP 1717011872247

--------------------
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="ShieldPPPt-PT-010B"
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 ShieldPPPt-PT-010B, 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-171683761500617"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-010B.tgz
mv ShieldPPPt-PT-010B 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 ;