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.r070-tall-171620505100098.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 CANInsertWithFailure-PT-010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505100098
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 698K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716235845130

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-20 20:10:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 20:10:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 20:10:46] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-20 20:10:46] [INFO ] Transformed 324 places.
[2024-05-20 20:10:46] [INFO ] Transformed 660 transitions.
[2024-05-20 20:10:46] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 98 out of 324 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 324/324 places, 660/660 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 323 transition count 660
Applied a total of 1 rules in 50 ms. Remains 323 /324 variables (removed 1) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2024-05-20 20:10:46] [INFO ] Computed 12 invariants in 35 ms
[2024-05-20 20:10:47] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-20 20:10:47] [INFO ] Invariant cache hit.
[2024-05-20 20:10:47] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 20:10:47] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 856 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-20 20:10:47] [INFO ] Invariant cache hit.
[2024-05-20 20:10:47] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:10:52] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 11 ms to minimize.
[2024-05-20 20:10:52] [INFO ] Deduced a trap composed of 30 places in 182 ms of which 1 ms to minimize.
[2024-05-20 20:10:52] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:10:52] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 17 ms to minimize.
[2024-05-20 20:10:52] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 2 ms to minimize.
[2024-05-20 20:10:52] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2024-05-20 20:10:52] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
[2024-05-20 20:10:53] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 3 ms to minimize.
[2024-05-20 20:10:53] [INFO ] Deduced a trap composed of 30 places in 145 ms of which 1 ms to minimize.
[2024-05-20 20:10:53] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 12 ms to minimize.
[2024-05-20 20:10:53] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:10:53] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:10:53] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:10:53] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
[2024-05-20 20:10:53] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-20 20:10:53] [INFO ] Deduced a trap composed of 31 places in 80 ms of which 1 ms to minimize.
[2024-05-20 20:10:53] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-05-20 20:10:54] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-20 20:10:54] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-20 20:10:54] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:10:55] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-20 20:10:55] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-05-20 20:10:55] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-20 20:10:55] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:10:55] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-20 20:10:55] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:10:55] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-20 20:10:55] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-20 20:10:55] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 2 ms to minimize.
[2024-05-20 20:10:55] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:10:55] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2024-05-20 20:10:56] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:10:56] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:10:56] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 2 ms to minimize.
[2024-05-20 20:10:56] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 3 ms to minimize.
[2024-05-20 20:10:56] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-20 20:10:56] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:10:56] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:10:56] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:10:56] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:11:00] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:11:00] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:11:00] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-20 20:11:00] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-20 20:11:01] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 4 ms to minimize.
[2024-05-20 20:11:01] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-20 20:11:01] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:11:01] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:11:01] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:11:01] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:11:01] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 2 ms to minimize.
[2024-05-20 20:11:01] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:11:01] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:11:03] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:11:03] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:11:03] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 6 ms to minimize.
[2024-05-20 20:11:04] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-20 20:11:04] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:11:04] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:11:04] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:11:04] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:11:05] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-20 20:11:05] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-20 20:11:05] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-20 20:11:05] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 2 ms to minimize.
[2024-05-20 20:11:05] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-05-20 20:11:05] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2024-05-20 20:11:05] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:11:05] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:11:05] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:11:05] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:11:05] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:11:05] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:11:06] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:11:06] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:11:08] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 2 ms to minimize.
[2024-05-20 20:11:08] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:11:08] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 1 ms to minimize.
[2024-05-20 20:11:08] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-05-20 20:11:08] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:11:09] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:11:09] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:11:09] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:11:09] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 0 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:11:10] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:11:15] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:11:15] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:11:15] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:11:16] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:11:16] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:11:16] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:11:16] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:11:16] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:11:16] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 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 Real declared 322/983 variables, and 121 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:11:19] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:11:19] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:11:19] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:11:19] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:11:19] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:11:19] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2024-05-20 20:11:19] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-20 20:11:20] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:11:20] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:11:20] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 2 ms to minimize.
[2024-05-20 20:11:20] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:11:21] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 0 ms to minimize.
[2024-05-20 20:11:22] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:11:25] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:11:27] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:11:32] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:11:32] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:11:34] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:11:35] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:11:35] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:11:35] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:11:41] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 143 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 131/131 constraints]
After SMT, in 60261ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60321ms
Starting structural reductions in LTL mode, iteration 1 : 323/324 places, 660/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61264 ms. Remains : 323/324 places, 660/660 transitions.
Support contains 98 out of 323 places after structural reductions.
[2024-05-20 20:11:48] [INFO ] Flatten gal took : 94 ms
[2024-05-20 20:11:48] [INFO ] Flatten gal took : 32 ms
[2024-05-20 20:11:48] [INFO ] Input system was already deterministic with 660 transitions.
RANDOM walk for 40000 steps (183 resets) in 1517 ms. (26 steps per ms) remains 6/69 properties
BEST_FIRST walk for 40003 steps (19 resets) in 228 ms. (174 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (19 resets) in 228 ms. (174 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (24 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (23 resets) in 44 ms. (888 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (25 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (20 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
[2024-05-20 20:11:49] [INFO ] Invariant cache hit.
[2024-05-20 20:11:49] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 293/316 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-20 20:11:49] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 4/320 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/320 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/322 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 660/982 variables, 322/335 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp46 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/982 variables, 190/525 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/982 variables, 0/525 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/983 variables, 1/526 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/983 variables, 0/526 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/983 variables, 0/526 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 983/983 variables, and 526 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1281 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 296/309 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/309 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-20 20:11:50] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:11:50] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:11:50] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2024-05-20 20:11:50] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:11:50] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2024-05-20 20:11:50] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:11:50] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:11:50] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 8/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 10/319 variables, 5/19 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/321 variables, 2/21 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/21 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 660/981 variables, 321/342 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/981 variables, 190/532 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/981 variables, 4/536 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/981 variables, 0/536 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/983 variables, 2/538 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/983 variables, 0/538 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/983 variables, 0/538 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 983/983 variables, and 538 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1621 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 190/190 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 2914ms problems are : Problem set: 2 solved, 4 unsolved
Parikh walk visited 0 properties in 675 ms.
Support contains 13 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 323 transition count 595
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 130 place count 258 transition count 595
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 130 place count 258 transition count 594
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 257 transition count 594
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Deduced a syphon composed of 85 places in 1 ms
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 2 with 170 rules applied. Total rules applied 302 place count 172 transition count 509
Drop transitions (Redundant composition of simpler transitions.) removed 68 transitions
Redundant transition composition rules discarded 68 transitions
Iterating global reduction 2 with 68 rules applied. Total rules applied 370 place count 172 transition count 441
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 375 place count 172 transition count 436
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 380 place count 167 transition count 436
Partial Free-agglomeration rule applied 108 times.
Drop transitions (Partial Free agglomeration) removed 108 transitions
Iterating global reduction 3 with 108 rules applied. Total rules applied 488 place count 167 transition count 436
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 498 place count 167 transition count 436
Applied a total of 498 rules in 114 ms. Remains 167 /323 variables (removed 156) and now considering 436/660 (removed 224) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 167/323 places, 436/660 transitions.
RANDOM walk for 40000 steps (778 resets) in 387 ms. (103 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (69 resets) in 55 ms. (714 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (73 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (65 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
// Phase 1: matrix 436 rows 167 cols
[2024-05-20 20:11:53] [INFO ] Computed 12 invariants in 3 ms
[2024-05-20 20:11:53] [INFO ] State equation strengthened by 390 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 20:11:53] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/164 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/165 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 436/601 variables, 165/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/601 variables, 390/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/601 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 2/603 variables, 2/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/603 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/603 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 603/603 variables, and 570 constraints, problems are : Problem set: 0 solved, 3 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 167/167 constraints, ReadFeed: 390/390 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 141/152 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 20:11:53] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:11:53] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
[2024-05-20 20:11:53] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-20 20:11:53] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-20 20:11:53] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:11:53] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:11:53] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:11:53] [INFO ] Deduced a trap composed of 2 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/152 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 12/164 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/165 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 436/601 variables, 165/186 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/601 variables, 390/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/601 variables, 3/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/601 variables, 0/579 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/603 variables, 2/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/603 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/603 variables, 0/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 603/603 variables, and 581 constraints, problems are : Problem set: 0 solved, 3 unsolved in 919 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 167/167 constraints, ReadFeed: 390/390 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 1427ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 264 ms.
Support contains 11 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 436/436 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 165 transition count 434
Applied a total of 4 rules in 26 ms. Remains 165 /167 variables (removed 2) and now considering 434/436 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 165/167 places, 434/436 transitions.
RANDOM walk for 40000 steps (773 resets) in 254 ms. (156 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (69 resets) in 32 ms. (1212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (75 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (66 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1031117 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :0 out of 3
Probabilistic random walk after 1031117 steps, saw 136518 distinct states, run finished after 3004 ms. (steps per millisecond=343 ) properties seen :0
// Phase 1: matrix 434 rows 165 cols
[2024-05-20 20:11:57] [INFO ] Computed 12 invariants in 3 ms
[2024-05-20 20:11:57] [INFO ] State equation strengthened by 394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 139/150 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 20:11:58] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/162 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 434/597 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 394/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/597 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/599 variables, 2/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/599 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/599 variables, 0/572 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 599/599 variables, and 572 constraints, problems are : Problem set: 0 solved, 3 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/165 constraints, ReadFeed: 394/394 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 139/150 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 12/162 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 434/597 variables, 163/176 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/597 variables, 394/570 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/597 variables, 3/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/597 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 2/599 variables, 2/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/599 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/599 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 599/599 variables, and 575 constraints, problems are : Problem set: 0 solved, 3 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 165/165 constraints, ReadFeed: 394/394 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 1043ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 11 out of 165 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 434/434 transitions.
Applied a total of 0 rules in 11 ms. Remains 165 /165 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 165/165 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 165/165 places, 434/434 transitions.
Applied a total of 0 rules in 8 ms. Remains 165 /165 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-05-20 20:11:59] [INFO ] Invariant cache hit.
[2024-05-20 20:11:59] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-20 20:11:59] [INFO ] Invariant cache hit.
[2024-05-20 20:11:59] [INFO ] State equation strengthened by 394 read => feed constraints.
[2024-05-20 20:11:59] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2024-05-20 20:11:59] [INFO ] Redundant transitions in 30 ms returned []
Running 424 sub problems to find dead transitions.
[2024-05-20 20:11:59] [INFO ] Invariant cache hit.
[2024-05-20 20:11:59] [INFO ] State equation strengthened by 394 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:12:01] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:12:02] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:12:02] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:12:02] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:12:02] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:12:02] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:12:02] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:12:02] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:12:02] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:12:02] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:12:02] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:12:02] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:12:02] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:12:03] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:12:03] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:12:03] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-20 20:12:03] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:12:03] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:12:03] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:12:03] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:12:04] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:12:04] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:12:04] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:12:04] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:12:04] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:12:05] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:12:05] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:12:05] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:12:05] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:12:05] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:12:05] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:12:05] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:12:06] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-20 20:12:07] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:12:08] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:12:08] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:12:08] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:12:08] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:12:08] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:12:08] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:12:08] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:12:08] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:12:08] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:12:09] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:12:09] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:12:09] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:12:09] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 2 ms to minimize.
[2024-05-20 20:12:09] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:12:10] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:12:10] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
[2024-05-20 20:12:10] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-20 20:12:10] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:12:10] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:12:11] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 2 ms to minimize.
[2024-05-20 20:12:11] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:12:11] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:12:11] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:12:11] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:12:11] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:12:11] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:12:11] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 13/125 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:12:13] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:12:13] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:12:13] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:12:13] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-20 20:12:13] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:12:13] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:12:14] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:12:14] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:12:14] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:12:14] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:12:14] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:12:15] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:12:15] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 13/138 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:12:16] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:12:16] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:12:16] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:12:17] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:12:17] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 5/143 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:12:20] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:12:20] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:12:20] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:12:20] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:12:20] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:12:21] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:12:21] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:12:21] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:12:21] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 9/152 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:12:21] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-20 20:12:22] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:12:22] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:12:23] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:12:23] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/164 variables, 5/157 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 13 (OVERLAPS) 434/598 variables, 164/321 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/598 variables, 394/715 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 598/599 variables, and 715 constraints, problems are : Problem set: 0 solved, 424 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 164/165 constraints, ReadFeed: 394/394 constraints, PredecessorRefiner: 424/424 constraints, Known Traps: 145/145 constraints]
Escalating to Integer solving :Problem set: 0 solved, 424 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/164 variables, 145/157 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:12:31] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/164 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:12:33] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:12:35] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:12:36] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:12:36] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:12:37] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:12:37] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:12:37] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:12:37] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:12:37] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 5/167 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:12:40] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 1/168 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 9 (OVERLAPS) 434/598 variables, 164/332 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Problem TDEAD144 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD427 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/598 variables, 394/726 constraints. Problems are: Problem set: 11 solved, 413 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/598 variables, 413/1139 constraints. Problems are: Problem set: 11 solved, 413 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 598/599 variables, and 1139 constraints, problems are : Problem set: 11 solved, 413 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 164/165 constraints, ReadFeed: 394/394 constraints, PredecessorRefiner: 413/424 constraints, Known Traps: 156/156 constraints]
After SMT, in 60179ms problems are : Problem set: 11 solved, 413 unsolved
Search for dead transitions found 11 dead transitions in 60183ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 165/165 places, 423/434 transitions.
Graph (complete) has 731 edges and 165 vertex of which 164 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 156 transition count 407
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 156 transition count 407
Applied a total of 17 rules in 18 ms. Remains 156 /165 variables (removed 9) and now considering 407/423 (removed 16) transitions.
// Phase 1: matrix 407 rows 156 cols
[2024-05-20 20:12:59] [INFO ] Computed 11 invariants in 2 ms
[2024-05-20 20:12:59] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-20 20:12:59] [INFO ] Invariant cache hit.
[2024-05-20 20:13:00] [INFO ] State equation strengthened by 375 read => feed constraints.
[2024-05-20 20:13:00] [INFO ] Implicit Places using invariants and state equation in 508 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 606 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 155/165 places, 407/434 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 153 transition count 405
Applied a total of 4 rules in 14 ms. Remains 153 /155 variables (removed 2) and now considering 405/407 (removed 2) transitions.
// Phase 1: matrix 405 rows 153 cols
[2024-05-20 20:13:00] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 20:13:00] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-20 20:13:00] [INFO ] Invariant cache hit.
[2024-05-20 20:13:00] [INFO ] State equation strengthened by 366 read => feed constraints.
[2024-05-20 20:13:01] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 153/165 places, 405/434 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62062 ms. Remains : 153/165 places, 405/434 transitions.
RANDOM walk for 40000 steps (785 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (69 resets) in 32 ms. (1212 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (69 resets) in 45 ms. (869 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (63 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1111562 steps, run timeout after 3001 ms. (steps per millisecond=370 ) properties seen :0 out of 3
Probabilistic random walk after 1111562 steps, saw 145869 distinct states, run finished after 3001 ms. (steps per millisecond=370 ) properties seen :0
[2024-05-20 20:13:04] [INFO ] Invariant cache hit.
[2024-05-20 20:13:04] [INFO ] State equation strengthened by 366 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 20:13:04] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/37 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 81/118 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 51/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 334/452 variables, 45/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 280/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 106/558 variables, 71/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 35/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/558 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/558 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 530 constraints, problems are : Problem set: 0 solved, 3 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, ReadFeed: 366/366 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 9/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 8/28 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 9/37 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 81/118 variables, 37/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/118 variables, 51/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/118 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 334/452 variables, 45/144 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/452 variables, 280/424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 3/427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/452 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 106/558 variables, 71/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/558 variables, 35/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/558 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/558 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 533 constraints, problems are : Problem set: 0 solved, 3 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, ReadFeed: 366/366 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 753ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 110 ms.
Support contains 11 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 405/405 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 153/153 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 405/405 transitions.
Applied a total of 0 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-20 20:13:05] [INFO ] Invariant cache hit.
[2024-05-20 20:13:05] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-20 20:13:05] [INFO ] Invariant cache hit.
[2024-05-20 20:13:05] [INFO ] State equation strengthened by 366 read => feed constraints.
[2024-05-20 20:13:05] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2024-05-20 20:13:05] [INFO ] Redundant transitions in 8 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-20 20:13:05] [INFO ] Invariant cache hit.
[2024-05-20 20:13:05] [INFO ] State equation strengthened by 366 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/557 variables, 152/162 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 366/528 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (OVERLAPS) 1/558 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (OVERLAPS) 0/558 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 529 constraints, problems are : Problem set: 0 solved, 395 unsolved in 29164 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, ReadFeed: 366/366 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/152 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/557 variables, 152/162 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/557 variables, 366/528 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/557 variables, 395/923 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (OVERLAPS) 1/558 variables, 1/924 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 9 (OVERLAPS) 0/558 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 924 constraints, problems are : Problem set: 0 solved, 395 unsolved in 25672 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 153/153 constraints, ReadFeed: 366/366 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 54939ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 54943ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55588 ms. Remains : 153/153 places, 405/405 transitions.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-20 20:14:00] [INFO ] Flatten gal took : 25 ms
[2024-05-20 20:14:00] [INFO ] Flatten gal took : 26 ms
[2024-05-20 20:14:00] [INFO ] Input system was already deterministic with 660 transitions.
Computed a total of 42 stabilizing places and 70 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 323 transition count 591
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 158 place count 244 transition count 581
Applied a total of 158 rules in 40 ms. Remains 244 /323 variables (removed 79) and now considering 581/660 (removed 79) transitions.
// Phase 1: matrix 581 rows 244 cols
[2024-05-20 20:14:00] [INFO ] Computed 12 invariants in 3 ms
[2024-05-20 20:14:00] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-20 20:14:00] [INFO ] Invariant cache hit.
[2024-05-20 20:14:01] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-20 20:14:01] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-20 20:14:01] [INFO ] Redundant transitions in 5 ms returned []
Running 571 sub problems to find dead transitions.
[2024-05-20 20:14:01] [INFO ] Invariant cache hit.
[2024-05-20 20:14:01] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-20 20:14:03] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:14:03] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:14:03] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:14:04] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:14:04] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:14:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:14:04] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:14:04] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:14:07] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:14:08] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:14:08] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-20 20:14:10] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:14:10] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:14:10] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-20 20:14:10] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:14:10] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:14:10] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:14:10] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:14:10] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:14:10] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 2 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:14:11] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:14:12] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:14:14] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:14:15] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-20 20:14:15] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:14:15] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:14:15] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:14:15] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:14:15] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:14:15] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:14:15] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:14:15] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:14:15] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:14:15] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-20 20:14:15] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:14:15] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:14:15] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-20 20:14:20] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:14:20] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:14:20] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:14:20] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:14:20] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-20 20:14:20] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:14:20] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:14:20] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:14:20] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:14:20] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:14:20] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:14:20] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:14:20] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:14:20] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
[2024-05-20 20:14:21] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 15/115 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-20 20:14:22] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:14:23] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:14:24] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-20 20:14:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:14:26] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
(s118 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 1.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.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 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/243 variables, 2/120 constraints. Problems are: Problem set: 0 solved, 571 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 243/825 variables, and 120 constraints, problems are : Problem set: 0 solved, 571 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/244 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 108/108 constraints]
Escalating to Integer solving :Problem set: 0 solved, 571 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 108/120 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (OVERLAPS) 581/824 variables, 243/363 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/824 variables, 200/563 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 571/1134 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/1134 constraints. Problems are: Problem set: 0 solved, 571 unsolved
SMT process timed out in 60108ms, After SMT, problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in SI_CTL mode, iteration 1 : 244/323 places, 581/660 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60668 ms. Remains : 244/323 places, 581/660 transitions.
[2024-05-20 20:15:01] [INFO ] Flatten gal took : 18 ms
[2024-05-20 20:15:01] [INFO ] Flatten gal took : 17 ms
[2024-05-20 20:15:01] [INFO ] Input system was already deterministic with 581 transitions.
[2024-05-20 20:15:01] [INFO ] Flatten gal took : 28 ms
[2024-05-20 20:15:01] [INFO ] Flatten gal took : 15 ms
[2024-05-20 20:15:01] [INFO ] Time to serialize gal into /tmp/CTLFireability12385662077610596498.gal : 23 ms
[2024-05-20 20:15:01] [INFO ] Time to serialize properties into /tmp/CTLFireability6793230833883788798.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability12385662077610596498.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6793230833883788798.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-20 20:15:31] [INFO ] Flatten gal took : 14 ms
[2024-05-20 20:15:31] [INFO ] Applying decomposition
[2024-05-20 20:15:31] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2511320300560926903.txt' '-o' '/tmp/graph2511320300560926903.bin' '-w' '/tmp/graph2511320300560926903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2511320300560926903.bin' '-l' '-1' '-v' '-w' '/tmp/graph2511320300560926903.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:15:31] [INFO ] Decomposing Gal with order
[2024-05-20 20:15:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:15:31] [INFO ] Removed a total of 255 redundant transitions.
[2024-05-20 20:15:32] [INFO ] Flatten gal took : 132 ms
[2024-05-20 20:15:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 170 labels/synchronizations in 25 ms.
[2024-05-20 20:15:32] [INFO ] Time to serialize gal into /tmp/CTLFireability6289234432997627471.gal : 26 ms
[2024-05-20 20:15:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6414797406680477517.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/CTLFireability6289234432997627471.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6414797406680477517.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 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 10 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2024-05-20 20:16:02] [INFO ] Computed 12 invariants in 6 ms
[2024-05-20 20:16:02] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-20 20:16:02] [INFO ] Invariant cache hit.
[2024-05-20 20:16:02] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 20:16:02] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-20 20:16:02] [INFO ] Invariant cache hit.
[2024-05-20 20:16:02] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:16:06] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:16:06] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:16:07] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 4 ms to minimize.
[2024-05-20 20:16:07] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:16:07] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-05-20 20:16:07] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:16:07] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:16:07] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:16:07] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:16:07] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:16:07] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:16:07] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:16:07] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:16:07] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-20 20:16:07] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-05-20 20:16:07] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:16:08] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-20 20:16:08] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 2 ms to minimize.
[2024-05-20 20:16:08] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2024-05-20 20:16:08] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:16:09] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
[2024-05-20 20:16:09] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-20 20:16:09] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
[2024-05-20 20:16:09] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-20 20:16:09] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 1 ms to minimize.
[2024-05-20 20:16:09] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:16:09] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:16:09] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:16:09] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 2 ms to minimize.
[2024-05-20 20:16:09] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 2 ms to minimize.
[2024-05-20 20:16:09] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:16:10] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:16:10] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:16:10] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:16:10] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:16:10] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:16:10] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:16:10] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:16:10] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:16:10] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:16:14] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-20 20:16:14] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:16:14] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-20 20:16:14] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 1 ms to minimize.
[2024-05-20 20:16:15] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-20 20:16:15] [INFO ] Deduced a trap composed of 30 places in 74 ms of which 2 ms to minimize.
[2024-05-20 20:16:15] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:16:15] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:16:15] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:16:15] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:16:15] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:16:15] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:16:15] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:16:17] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:16:17] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:16:17] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:16:18] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:16:18] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-20 20:16:18] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:16:18] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:16:18] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:16:19] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 2 ms to minimize.
[2024-05-20 20:16:19] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 2 ms to minimize.
[2024-05-20 20:16:19] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:16:19] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:16:19] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-05-20 20:16:19] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-05-20 20:16:19] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:16:19] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:16:19] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:16:19] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:16:19] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:16:19] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:16:20] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:16:20] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:16:22] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:16:22] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:16:22] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-05-20 20:16:22] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-20 20:16:22] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:16:23] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-05-20 20:16:23] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:16:23] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:16:24] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:16:25] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:16:30] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:16:30] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:16:30] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:16:30] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:16:30] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:16:30] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:16:30] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:16:31] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:16:31] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.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 1.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 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.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 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.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 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.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 0.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 0.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 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 1.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 0.0)
(s268 0.0)
(s269 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/983 variables, and 121 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:16:34] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:16:34] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:16:34] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:16:34] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:16:34] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:16:34] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:16:34] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:16:35] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:16:35] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:16:35] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:16:35] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:16:36] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:16:37] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:16:40] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:16:42] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:16:47] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:16:47] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:16:49] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:16:50] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:16:50] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:16:50] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:16:55] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 3)
(s1 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 1)
(s8 0)
(s9 0)
(s10 0)
(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 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(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 1)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 1)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 1)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 143 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 131/131 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Finished structural reductions in LTL mode , in 1 iterations and 60695 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-20 20:17:02] [INFO ] Flatten gal took : 15 ms
[2024-05-20 20:17:02] [INFO ] Flatten gal took : 17 ms
[2024-05-20 20:17:02] [INFO ] Input system was already deterministic with 660 transitions.
[2024-05-20 20:17:02] [INFO ] Flatten gal took : 16 ms
[2024-05-20 20:17:02] [INFO ] Flatten gal took : 15 ms
[2024-05-20 20:17:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9092437711507704993.gal : 3 ms
[2024-05-20 20:17:02] [INFO ] Time to serialize properties into /tmp/CTLFireability7962069160010222566.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/CTLFireability9092437711507704993.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7962069160010222566.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 20:17:33] [INFO ] Flatten gal took : 20 ms
[2024-05-20 20:17:33] [INFO ] Applying decomposition
[2024-05-20 20:17:33] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4427813633093194714.txt' '-o' '/tmp/graph4427813633093194714.bin' '-w' '/tmp/graph4427813633093194714.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4427813633093194714.bin' '-l' '-1' '-v' '-w' '/tmp/graph4427813633093194714.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:17:33] [INFO ] Decomposing Gal with order
[2024-05-20 20:17:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:17:33] [INFO ] Removed a total of 298 redundant transitions.
[2024-05-20 20:17:33] [INFO ] Flatten gal took : 38 ms
[2024-05-20 20:17:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 7 ms.
[2024-05-20 20:17:33] [INFO ] Time to serialize gal into /tmp/CTLFireability9331707335985886468.gal : 6 ms
[2024-05-20 20:17:33] [INFO ] Time to serialize properties into /tmp/CTLFireability1073598448454118399.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/CTLFireability9331707335985886468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1073598448454118399.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 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 160 place count 243 transition count 580
Applied a total of 160 rules in 26 ms. Remains 243 /323 variables (removed 80) and now considering 580/660 (removed 80) transitions.
// Phase 1: matrix 580 rows 243 cols
[2024-05-20 20:18:03] [INFO ] Computed 12 invariants in 3 ms
[2024-05-20 20:18:03] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-20 20:18:03] [INFO ] Invariant cache hit.
[2024-05-20 20:18:03] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-20 20:18:03] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-20 20:18:03] [INFO ] Redundant transitions in 5 ms returned []
Running 570 sub problems to find dead transitions.
[2024-05-20 20:18:03] [INFO ] Invariant cache hit.
[2024-05-20 20:18:03] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:18:06] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:18:06] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:18:06] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:18:06] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-20 20:18:06] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-20 20:18:06] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-20 20:18:06] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:18:06] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:18:06] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:18:06] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:18:06] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:18:06] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:18:06] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:18:06] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 2 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:18:07] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:18:08] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:18:08] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:18:08] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:18:08] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:18:08] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:18:08] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:18:10] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:18:10] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:18:10] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:18:10] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:18:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:18:10] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:18:10] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:18:11] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:18:13] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:18:13] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:18:13] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:18:13] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:18:13] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:18:13] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:18:13] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:18:13] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-20 20:18:13] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:18:13] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 3 ms to minimize.
[2024-05-20 20:18:14] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:18:14] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:18:14] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:18:14] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:18:14] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-20 20:18:14] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:18:14] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:18:15] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:18:16] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:18:16] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:18:18] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 19/111 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:18:23] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:18:27] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:18:27] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:18:27] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:18:27] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:18:29] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:18:29] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/823 variables, and 118 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/243 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 106/106 constraints]
Escalating to Integer solving :Problem set: 0 solved, 570 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 106/118 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:18:36] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 5 (OVERLAPS) 580/822 variables, 242/361 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 200/561 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/822 variables, 570/1131 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 822/823 variables, and 1131 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 242/243 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 107/107 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in SI_CTL mode, iteration 1 : 243/323 places, 580/660 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60685 ms. Remains : 243/323 places, 580/660 transitions.
[2024-05-20 20:19:03] [INFO ] Flatten gal took : 21 ms
[2024-05-20 20:19:04] [INFO ] Flatten gal took : 12 ms
[2024-05-20 20:19:04] [INFO ] Input system was already deterministic with 580 transitions.
[2024-05-20 20:19:04] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:19:04] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:19:04] [INFO ] Time to serialize gal into /tmp/CTLFireability5288426339930033159.gal : 3 ms
[2024-05-20 20:19:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14529674151876378023.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/CTLFireability5288426339930033159.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14529674151876378023.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-20 20:19:34] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:19:34] [INFO ] Applying decomposition
[2024-05-20 20:19:34] [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/graph16447341426764561625.txt' '-o' '/tmp/graph16447341426764561625.bin' '-w' '/tmp/graph16447341426764561625.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16447341426764561625.bin' '-l' '-1' '-v' '-w' '/tmp/graph16447341426764561625.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:19:34] [INFO ] Decomposing Gal with order
[2024-05-20 20:19:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:19:34] [INFO ] Removed a total of 256 redundant transitions.
[2024-05-20 20:19:34] [INFO ] Flatten gal took : 46 ms
[2024-05-20 20:19:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 5 ms.
[2024-05-20 20:19:34] [INFO ] Time to serialize gal into /tmp/CTLFireability2667706409077673231.gal : 4 ms
[2024-05-20 20:19:34] [INFO ] Time to serialize properties into /tmp/CTLFireability4693318613499287692.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/CTLFireability2667706409077673231.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4693318613499287692.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 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 323 transition count 598
Reduce places removed 62 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 64 rules applied. Total rules applied 126 place count 261 transition count 596
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 128 place count 259 transition count 596
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 128 place count 259 transition count 595
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 258 transition count 595
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 144 place count 251 transition count 588
Applied a total of 144 rules in 27 ms. Remains 251 /323 variables (removed 72) and now considering 588/660 (removed 72) transitions.
// Phase 1: matrix 588 rows 251 cols
[2024-05-20 20:20:04] [INFO ] Computed 12 invariants in 3 ms
[2024-05-20 20:20:04] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-20 20:20:04] [INFO ] Invariant cache hit.
[2024-05-20 20:20:04] [INFO ] State equation strengthened by 197 read => feed constraints.
[2024-05-20 20:20:04] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-05-20 20:20:04] [INFO ] Redundant transitions in 7 ms returned []
Running 578 sub problems to find dead transitions.
[2024-05-20 20:20:04] [INFO ] Invariant cache hit.
[2024-05-20 20:20:04] [INFO ] State equation strengthened by 197 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-05-20 20:20:07] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:20:07] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:20:07] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:20:07] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:20:07] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:20:07] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:20:08] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:20:08] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-05-20 20:20:08] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:20:08] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-20 20:20:09] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:20:09] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:20:09] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:20:09] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:20:09] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:20:09] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:20:09] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-20 20:20:09] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:20:09] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:20:09] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-05-20 20:20:09] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:20:10] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:20:11] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:20:11] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-05-20 20:20:13] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:20:13] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:20:13] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:20:14] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:20:14] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 2 ms to minimize.
[2024-05-20 20:20:14] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:20:14] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:20:14] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:20:14] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:20:14] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:20:14] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:20:15] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:20:16] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:20:16] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:20:16] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:20:16] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:20:16] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:20:16] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:20:18] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:20:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:20:18] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:20:18] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:20:18] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:20:18] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:20:18] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-05-20 20:20:18] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:20:18] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:20:18] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:20:18] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:20:18] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:20:18] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-20 20:20:18] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:20:19] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:20:19] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:20:19] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:20:19] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:20:20] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:20:20] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:20:20] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:20:20] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:20:20] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:20:21] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:20:21] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:20:21] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:20:21] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-05-20 20:20:27] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-05-20 20:20:28] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:20:29] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:20:29] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:20:29] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:20:30] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:20:30] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:20:30] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 7/120 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-05-20 20:20:32] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 250/839 variables, and 121 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/251 constraints, ReadFeed: 0/197 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 578 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/250 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-05-20 20:20:35] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:20:35] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:20:37] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:20:38] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:20:39] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/250 variables, 5/126 constraints. Problems are: Problem set: 0 solved, 578 unsolved
[2024-05-20 20:20:40] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 6 (OVERLAPS) 588/838 variables, 250/377 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/838 variables, 197/574 constraints. Problems are: Problem set: 0 solved, 578 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/838 variables, 578/1152 constraints. Problems are: Problem set: 0 solved, 578 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 838/839 variables, and 1152 constraints, problems are : Problem set: 0 solved, 578 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 250/251 constraints, ReadFeed: 197/197 constraints, PredecessorRefiner: 578/578 constraints, Known Traps: 115/115 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 578 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in SI_CTL mode, iteration 1 : 251/323 places, 588/660 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60572 ms. Remains : 251/323 places, 588/660 transitions.
[2024-05-20 20:21:04] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:21:04] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:21:04] [INFO ] Input system was already deterministic with 588 transitions.
[2024-05-20 20:21:04] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:21:04] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:21:04] [INFO ] Time to serialize gal into /tmp/CTLFireability16702595154999125729.gal : 3 ms
[2024-05-20 20:21:04] [INFO ] Time to serialize properties into /tmp/CTLFireability14979281286731537153.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/CTLFireability16702595154999125729.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14979281286731537153.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-20 20:21:35] [INFO ] Flatten gal took : 15 ms
[2024-05-20 20:21:35] [INFO ] Applying decomposition
[2024-05-20 20:21:35] [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/graph7111188726756742989.txt' '-o' '/tmp/graph7111188726756742989.bin' '-w' '/tmp/graph7111188726756742989.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7111188726756742989.bin' '-l' '-1' '-v' '-w' '/tmp/graph7111188726756742989.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:21:35] [INFO ] Decomposing Gal with order
[2024-05-20 20:21:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:21:35] [INFO ] Removed a total of 263 redundant transitions.
[2024-05-20 20:21:35] [INFO ] Flatten gal took : 49 ms
[2024-05-20 20:21:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 6 ms.
[2024-05-20 20:21:35] [INFO ] Time to serialize gal into /tmp/CTLFireability11580815615064551106.gal : 3 ms
[2024-05-20 20:21:35] [INFO ] Time to serialize properties into /tmp/CTLFireability13040580978526660413.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/CTLFireability11580815615064551106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13040580978526660413.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 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2024-05-20 20:22:05] [INFO ] Computed 12 invariants in 11 ms
[2024-05-20 20:22:05] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-20 20:22:05] [INFO ] Invariant cache hit.
[2024-05-20 20:22:05] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 20:22:05] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-20 20:22:05] [INFO ] Invariant cache hit.
[2024-05-20 20:22:05] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:22:09] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:22:09] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:22:09] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:22:09] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:22:09] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:22:10] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:22:10] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
[2024-05-20 20:22:10] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 2 ms to minimize.
[2024-05-20 20:22:10] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:22:10] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:22:10] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:22:10] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:22:10] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:22:10] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2024-05-20 20:22:10] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-05-20 20:22:10] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:22:10] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-05-20 20:22:10] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-05-20 20:22:11] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-20 20:22:11] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:22:11] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 2 ms to minimize.
[2024-05-20 20:22:12] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-20 20:22:12] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-05-20 20:22:12] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:22:12] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:22:12] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 2 ms to minimize.
[2024-05-20 20:22:12] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:22:12] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:22:12] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:22:12] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:22:12] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:22:12] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:22:12] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:22:12] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:22:12] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2024-05-20 20:22:12] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:22:13] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:22:13] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2024-05-20 20:22:13] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:22:13] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:22:17] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:22:17] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:22:17] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-20 20:22:17] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 20:22:17] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:22:18] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-20 20:22:18] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:22:18] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:22:18] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:22:18] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:22:18] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:22:18] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:22:18] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:22:20] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:22:20] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:22:20] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:22:21] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 20:22:21] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:22:21] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:22:21] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:22:21] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:22:22] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 2 ms to minimize.
[2024-05-20 20:22:22] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-20 20:22:22] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:22:22] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:22:22] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-05-20 20:22:22] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-05-20 20:22:22] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:22:22] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 0 ms to minimize.
[2024-05-20 20:22:22] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:22:22] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:22:22] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:22:22] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:22:23] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:22:23] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:22:25] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:22:25] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-05-20 20:22:25] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-20 20:22:25] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:22:25] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:22:26] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 0 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:22:34] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2024-05-20 20:22:34] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.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 1.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 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 322/983 variables, and 121 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 2 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:22:38] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-20 20:22:38] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:22:38] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 6 ms to minimize.
[2024-05-20 20:22:38] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:22:39] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:22:40] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:22:43] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:22:45] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:22:50] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:22:50] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:22:53] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:22:54] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:22:54] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:22:54] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:22:59] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 143 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 131/131 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Finished structural reductions in LTL mode , in 1 iterations and 60585 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-20 20:23:05] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:23:05] [INFO ] Flatten gal took : 12 ms
[2024-05-20 20:23:05] [INFO ] Input system was already deterministic with 660 transitions.
[2024-05-20 20:23:05] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:23:05] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:23:05] [INFO ] Time to serialize gal into /tmp/CTLFireability15766846170869237715.gal : 3 ms
[2024-05-20 20:23:05] [INFO ] Time to serialize properties into /tmp/CTLFireability4211707830721387612.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/CTLFireability15766846170869237715.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4211707830721387612.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-20 20:23:35] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:23:35] [INFO ] Applying decomposition
[2024-05-20 20:23:35] [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/graph16847722039201147312.txt' '-o' '/tmp/graph16847722039201147312.bin' '-w' '/tmp/graph16847722039201147312.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16847722039201147312.bin' '-l' '-1' '-v' '-w' '/tmp/graph16847722039201147312.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:23:36] [INFO ] Decomposing Gal with order
[2024-05-20 20:23:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:23:36] [INFO ] Removed a total of 297 redundant transitions.
[2024-05-20 20:23:36] [INFO ] Flatten gal took : 25 ms
[2024-05-20 20:23:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 9 ms.
[2024-05-20 20:23:36] [INFO ] Time to serialize gal into /tmp/CTLFireability617217195399188054.gal : 5 ms
[2024-05-20 20:23:36] [INFO ] Time to serialize properties into /tmp/CTLFireability15219187193043348420.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/CTLFireability617217195399188054.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15219187193043348420.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 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 323 transition count 591
Reduce places removed 69 places and 0 transitions.
Iterating post reduction 1 with 69 rules applied. Total rules applied 138 place count 254 transition count 591
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 158 place count 244 transition count 581
Applied a total of 158 rules in 27 ms. Remains 244 /323 variables (removed 79) and now considering 581/660 (removed 79) transitions.
// Phase 1: matrix 581 rows 244 cols
[2024-05-20 20:24:06] [INFO ] Computed 12 invariants in 3 ms
[2024-05-20 20:24:06] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-20 20:24:06] [INFO ] Invariant cache hit.
[2024-05-20 20:24:06] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-20 20:24:06] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
[2024-05-20 20:24:06] [INFO ] Redundant transitions in 5 ms returned []
Running 571 sub problems to find dead transitions.
[2024-05-20 20:24:06] [INFO ] Invariant cache hit.
[2024-05-20 20:24:06] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-20 20:24:09] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:24:09] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:24:09] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:24:09] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:24:09] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:24:09] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:24:09] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:24:09] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:24:09] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:24:09] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:24:09] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:24:09] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-20 20:24:12] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:24:12] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:24:12] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:24:12] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:24:12] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:24:12] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:24:12] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:24:13] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:24:13] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:24:13] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-20 20:24:13] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:24:13] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:24:13] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:24:13] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:24:13] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:24:13] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:24:13] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 0 ms to minimize.
[2024-05-20 20:24:13] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 1 ms to minimize.
[2024-05-20 20:24:15] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-20 20:24:15] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-20 20:24:17] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:24:17] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:24:17] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-20 20:24:17] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:24:17] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:24:17] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:24:17] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:24:17] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/243 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:24:18] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-20 20:24:19] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:24:19] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:24:19] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:24:19] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:24:19] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:24:19] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:24:19] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:24:19] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:24:19] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:24:19] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:24:19] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:24:19] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-20 20:24:19] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:24:20] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:24:20] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:24:21] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:24:21] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:24:21] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:24:21] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:24:21] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:24:21] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:24:21] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:24:21] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:24:21] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-20 20:24:23] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/243 variables, 13/97 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-20 20:24:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:24:26] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:24:26] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:24:26] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:24:26] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:24:26] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:24:26] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:24:26] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:24:27] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:24:27] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:24:27] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:24:27] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:24:27] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 13/110 constraints. Problems are: Problem set: 0 solved, 571 unsolved
[2024-05-20 20:24:30] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:24:30] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:24:30] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:24:30] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:24:31] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 5/115 constraints. Problems are: Problem set: 0 solved, 571 unsolved
(s235 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 2.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.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 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 1.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.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 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.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 0.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 0.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 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.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 0.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 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 1.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 243/825 variables, and 115 constraints, problems are : Problem set: 0 solved, 571 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/244 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 571/571 constraints, Known Traps: 103/103 constraints]
Escalating to Integer solving :Problem set: 0 solved, 571 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/243 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/243 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 103/115 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 4 (OVERLAPS) 581/824 variables, 243/358 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/824 variables, 200/558 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/824 variables, 571/1129 constraints. Problems are: Problem set: 0 solved, 571 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/824 variables, 0/1129 constraints. Problems are: Problem set: 0 solved, 571 unsolved
SMT process timed out in 60112ms, After SMT, problems are : Problem set: 0 solved, 571 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Starting structural reductions in SI_CTL mode, iteration 1 : 244/323 places, 581/660 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60598 ms. Remains : 244/323 places, 581/660 transitions.
[2024-05-20 20:25:06] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:25:06] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:25:06] [INFO ] Input system was already deterministic with 581 transitions.
[2024-05-20 20:25:06] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:25:06] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:25:06] [INFO ] Time to serialize gal into /tmp/CTLFireability15751313327060309079.gal : 2 ms
[2024-05-20 20:25:06] [INFO ] Time to serialize properties into /tmp/CTLFireability12633799105019677273.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/CTLFireability15751313327060309079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12633799105019677273.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-20 20:25:36] [INFO ] Flatten gal took : 13 ms
[2024-05-20 20:25:36] [INFO ] Applying decomposition
[2024-05-20 20:25:36] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8515790593655420632.txt' '-o' '/tmp/graph8515790593655420632.bin' '-w' '/tmp/graph8515790593655420632.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8515790593655420632.bin' '-l' '-1' '-v' '-w' '/tmp/graph8515790593655420632.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:25:36] [INFO ] Decomposing Gal with order
[2024-05-20 20:25:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:25:36] [INFO ] Removed a total of 260 redundant transitions.
[2024-05-20 20:25:36] [INFO ] Flatten gal took : 22 ms
[2024-05-20 20:25:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 12 ms.
[2024-05-20 20:25:36] [INFO ] Time to serialize gal into /tmp/CTLFireability3480896517124293509.gal : 3 ms
[2024-05-20 20:25:36] [INFO ] Time to serialize properties into /tmp/CTLFireability7345526056233504189.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/CTLFireability3480896517124293509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7345526056233504189.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 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 6 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2024-05-20 20:26:07] [INFO ] Computed 12 invariants in 7 ms
[2024-05-20 20:26:07] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-20 20:26:07] [INFO ] Invariant cache hit.
[2024-05-20 20:26:07] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 20:26:07] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-20 20:26:07] [INFO ] Invariant cache hit.
[2024-05-20 20:26:07] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:26:11] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:26:11] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:26:11] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:26:11] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:26:12] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:26:12] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:26:12] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:26:12] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-05-20 20:26:12] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:26:12] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:26:12] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:26:12] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:26:12] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:26:12] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-20 20:26:12] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-05-20 20:26:12] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:26:12] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-05-20 20:26:13] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-05-20 20:26:13] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 1 ms to minimize.
[2024-05-20 20:26:13] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:26:14] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-20 20:26:14] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 3 ms to minimize.
[2024-05-20 20:26:14] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:26:14] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:26:14] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-20 20:26:14] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 2 ms to minimize.
[2024-05-20 20:26:14] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:26:14] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:26:14] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:26:14] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:26:14] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:26:14] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:26:14] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:26:14] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:26:15] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:26:15] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-05-20 20:26:15] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:26:15] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:26:15] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:26:15] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:26:19] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:26:19] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:26:19] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-20 20:26:19] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 20:26:20] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:26:20] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:26:20] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2024-05-20 20:26:20] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:26:20] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:26:20] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:26:20] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 0 ms to minimize.
[2024-05-20 20:26:20] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:26:20] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:26:22] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-20 20:26:22] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:26:22] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:26:23] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-20 20:26:23] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:26:23] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:26:23] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:26:23] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:26:24] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-20 20:26:24] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-20 20:26:24] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-20 20:26:24] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 2 ms to minimize.
[2024-05-20 20:26:24] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 2 ms to minimize.
[2024-05-20 20:26:24] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-05-20 20:26:24] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:26:24] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:26:24] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:26:24] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:26:24] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:26:25] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2024-05-20 20:26:25] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:26:25] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:26:27] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:26:27] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:26:27] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-20 20:26:27] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-20 20:26:27] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:26:28] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:26:29] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:26:30] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:26:30] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:26:35] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:26:35] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:26:35] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2024-05-20 20:26:35] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:26:35] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:26:35] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:26:35] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:26:36] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:26:36] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/983 variables, and 121 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:26:39] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:26:39] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:26:39] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:26:39] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:26:39] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:26:39] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:26:39] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:26:39] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:26:39] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:26:40] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:26:40] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:26:41] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-05-20 20:26:42] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:26:45] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:26:46] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:26:51] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:26:52] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:26:54] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:26:55] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:26:55] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:26:55] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:27:00] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 2)
(s1 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 1)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 1)
(s55 0)
(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 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 1)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 143 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 131/131 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Finished structural reductions in LTL mode , in 1 iterations and 60680 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-20 20:27:07] [INFO ] Flatten gal took : 15 ms
[2024-05-20 20:27:07] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:27:07] [INFO ] Input system was already deterministic with 660 transitions.
[2024-05-20 20:27:07] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:27:07] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:27:07] [INFO ] Time to serialize gal into /tmp/CTLFireability17367465093144737343.gal : 2 ms
[2024-05-20 20:27:07] [INFO ] Time to serialize properties into /tmp/CTLFireability14282645175258150092.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/CTLFireability17367465093144737343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14282645175258150092.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-20 20:27:37] [INFO ] Flatten gal took : 14 ms
[2024-05-20 20:27:37] [INFO ] Applying decomposition
[2024-05-20 20:27:37] [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/graph3089595261762245920.txt' '-o' '/tmp/graph3089595261762245920.bin' '-w' '/tmp/graph3089595261762245920.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3089595261762245920.bin' '-l' '-1' '-v' '-w' '/tmp/graph3089595261762245920.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:27:37] [INFO ] Decomposing Gal with order
[2024-05-20 20:27:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:27:37] [INFO ] Removed a total of 297 redundant transitions.
[2024-05-20 20:27:37] [INFO ] Flatten gal took : 25 ms
[2024-05-20 20:27:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 4 ms.
[2024-05-20 20:27:37] [INFO ] Time to serialize gal into /tmp/CTLFireability11907289140243653766.gal : 4 ms
[2024-05-20 20:27:37] [INFO ] Time to serialize properties into /tmp/CTLFireability7875732537480573450.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/CTLFireability11907289140243653766.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7875732537480573450.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 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2024-05-20 20:28:08] [INFO ] Invariant cache hit.
[2024-05-20 20:28:08] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-20 20:28:08] [INFO ] Invariant cache hit.
[2024-05-20 20:28:08] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 20:28:08] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-20 20:28:08] [INFO ] Invariant cache hit.
[2024-05-20 20:28:08] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:28:12] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:28:12] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:28:12] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:28:12] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:28:12] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:28:13] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:28:13] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:28:13] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:28:13] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:28:13] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:28:13] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:28:13] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:28:13] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:28:13] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2024-05-20 20:28:13] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2024-05-20 20:28:13] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-05-20 20:28:13] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 1 ms to minimize.
[2024-05-20 20:28:13] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-05-20 20:28:14] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-20 20:28:14] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:28:14] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 1 ms to minimize.
[2024-05-20 20:28:15] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-20 20:28:15] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:28:15] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:28:15] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 2 ms to minimize.
[2024-05-20 20:28:15] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:28:15] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 2 ms to minimize.
[2024-05-20 20:28:15] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:28:15] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:28:15] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:28:15] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:28:15] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:28:15] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:28:15] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:28:16] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 2 ms to minimize.
[2024-05-20 20:28:16] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:28:16] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:28:16] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:28:16] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:28:16] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:28:20] [INFO ] Deduced a trap composed of 33 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:28:20] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 2 ms to minimize.
[2024-05-20 20:28:20] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-20 20:28:20] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-20 20:28:21] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:28:21] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 2 ms to minimize.
[2024-05-20 20:28:21] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:28:21] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:28:21] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:28:21] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:28:21] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:28:21] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2024-05-20 20:28:21] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:28:23] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:28:23] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:28:23] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:28:24] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:28:24] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-20 20:28:24] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:28:24] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:28:24] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:28:25] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:28:25] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-20 20:28:25] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:28:25] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:28:25] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 2 ms to minimize.
[2024-05-20 20:28:25] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-20 20:28:25] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:28:25] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:28:25] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:28:25] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:28:25] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:28:25] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:28:26] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:28:26] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:28:28] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:28:28] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:28:28] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-20 20:28:28] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
[2024-05-20 20:28:28] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:28:29] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-05-20 20:28:29] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:28:29] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 0 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:28:30] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:28:31] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:28:35] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:28:35] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:28:36] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:28:36] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:28:36] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:28:36] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:28:36] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:28:36] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:28:36] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/983 variables, and 121 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:28:40] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:28:40] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:28:40] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:28:40] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:28:40] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:28:40] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:28:40] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:28:40] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:28:40] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-20 20:28:41] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:28:41] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:28:42] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:28:43] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:28:46] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:28:48] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:28:53] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:28:53] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:28:55] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:28:56] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:28:56] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:28:56] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:29:02] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 8)
(s1 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(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 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(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 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 1)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 1)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 143 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 131/131 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60121ms
Finished structural reductions in LTL mode , in 1 iterations and 60636 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-20 20:29:08] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:29:08] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:29:08] [INFO ] Input system was already deterministic with 660 transitions.
[2024-05-20 20:29:08] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:29:08] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:29:08] [INFO ] Time to serialize gal into /tmp/CTLFireability3885648194477779332.gal : 3 ms
[2024-05-20 20:29:08] [INFO ] Time to serialize properties into /tmp/CTLFireability2707341598031303046.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/CTLFireability3885648194477779332.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2707341598031303046.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 20:29:38] [INFO ] Flatten gal took : 14 ms
[2024-05-20 20:29:38] [INFO ] Applying decomposition
[2024-05-20 20:29:38] [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/graph1879070306791249247.txt' '-o' '/tmp/graph1879070306791249247.bin' '-w' '/tmp/graph1879070306791249247.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1879070306791249247.bin' '-l' '-1' '-v' '-w' '/tmp/graph1879070306791249247.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:29:38] [INFO ] Decomposing Gal with order
[2024-05-20 20:29:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:29:38] [INFO ] Removed a total of 294 redundant transitions.
[2024-05-20 20:29:38] [INFO ] Flatten gal took : 23 ms
[2024-05-20 20:29:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 5 ms.
[2024-05-20 20:29:38] [INFO ] Time to serialize gal into /tmp/CTLFireability12183305365638823873.gal : 3 ms
[2024-05-20 20:29:38] [INFO ] Time to serialize properties into /tmp/CTLFireability6386949121650625893.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/CTLFireability12183305365638823873.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6386949121650625893.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 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 323 transition count 603
Reduce places removed 57 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 67 rules applied. Total rules applied 124 place count 266 transition count 593
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 134 place count 256 transition count 593
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 134 place count 256 transition count 592
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 154 place count 246 transition count 583
Applied a total of 154 rules in 25 ms. Remains 246 /323 variables (removed 77) and now considering 583/660 (removed 77) transitions.
// Phase 1: matrix 583 rows 246 cols
[2024-05-20 20:30:08] [INFO ] Computed 12 invariants in 3 ms
[2024-05-20 20:30:09] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-20 20:30:09] [INFO ] Invariant cache hit.
[2024-05-20 20:30:09] [INFO ] State equation strengthened by 199 read => feed constraints.
[2024-05-20 20:30:09] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-05-20 20:30:09] [INFO ] Redundant transitions in 7 ms returned []
Running 573 sub problems to find dead transitions.
[2024-05-20 20:30:09] [INFO ] Invariant cache hit.
[2024-05-20 20:30:09] [INFO ] State equation strengthened by 199 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/245 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/245 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-05-20 20:30:11] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 0 ms to minimize.
[2024-05-20 20:30:11] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:30:12] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:30:12] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:30:12] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-20 20:30:13] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:30:13] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 2 ms to minimize.
[2024-05-20 20:30:13] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:30:14] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:30:15] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:30:15] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-20 20:30:15] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:30:15] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:30:15] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:30:15] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:30:15] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:30:15] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:30:15] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-05-20 20:30:15] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:30:15] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-05-20 20:30:15] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:30:15] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:30:15] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:30:16] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-05-20 20:30:19] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:30:19] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
[2024-05-20 20:30:19] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:30:19] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:30:19] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:30:19] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:30:19] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:30:19] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 0 ms to minimize.
[2024-05-20 20:30:19] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:30:19] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:30:21] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:30:21] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:30:21] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-20 20:30:21] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2024-05-20 20:30:21] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:30:21] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:30:21] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-20 20:30:21] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:30:21] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:30:21] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/245 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-05-20 20:30:22] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:30:22] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-20 20:30:22] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:30:22] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:30:22] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:30:22] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:30:22] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:30:22] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:30:22] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:30:23] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:30:23] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:30:23] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:30:23] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:30:23] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:30:23] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:30:23] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-20 20:30:23] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:30:23] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:30:23] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:30:23] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-05-20 20:30:24] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:30:24] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:30:24] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:30:24] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:30:24] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:30:26] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:30:27] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:30:27] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:30:27] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:30:27] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 573 unsolved
[2024-05-20 20:30:32] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:30:33] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:30:33] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 573 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 573 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 583/828 variables, 245/350 constraints. Problems are: Problem set: 0 solved, 573 unsolved
SMT process timed out in 30095ms, After SMT, problems are : Problem set: 0 solved, 573 unsolved
Search for dead transitions found 0 dead transitions in 30100ms
Starting structural reductions in SI_CTL mode, iteration 1 : 246/323 places, 583/660 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30548 ms. Remains : 246/323 places, 583/660 transitions.
[2024-05-20 20:30:39] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:30:39] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:30:39] [INFO ] Input system was already deterministic with 583 transitions.
[2024-05-20 20:30:39] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:30:39] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:30:39] [INFO ] Time to serialize gal into /tmp/CTLFireability16873395523424594768.gal : 2 ms
[2024-05-20 20:30:39] [INFO ] Time to serialize properties into /tmp/CTLFireability17877330323253245832.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/CTLFireability16873395523424594768.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17877330323253245832.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-20 20:31:09] [INFO ] Flatten gal took : 13 ms
[2024-05-20 20:31:09] [INFO ] Applying decomposition
[2024-05-20 20:31:09] [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/graph12939101848250460619.txt' '-o' '/tmp/graph12939101848250460619.bin' '-w' '/tmp/graph12939101848250460619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12939101848250460619.bin' '-l' '-1' '-v' '-w' '/tmp/graph12939101848250460619.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:31:09] [INFO ] Decomposing Gal with order
[2024-05-20 20:31:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:31:09] [INFO ] Removed a total of 262 redundant transitions.
[2024-05-20 20:31:09] [INFO ] Flatten gal took : 20 ms
[2024-05-20 20:31:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 186 labels/synchronizations in 3 ms.
[2024-05-20 20:31:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8695965007162796044.gal : 2 ms
[2024-05-20 20:31:09] [INFO ] Time to serialize properties into /tmp/CTLFireability9106457303305550733.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/CTLFireability8695965007162796044.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9106457303305550733.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 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 70 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 140 place count 253 transition count 590
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 160 place count 243 transition count 580
Applied a total of 160 rules in 15 ms. Remains 243 /323 variables (removed 80) and now considering 580/660 (removed 80) transitions.
// Phase 1: matrix 580 rows 243 cols
[2024-05-20 20:31:39] [INFO ] Computed 12 invariants in 2 ms
[2024-05-20 20:31:39] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-20 20:31:39] [INFO ] Invariant cache hit.
[2024-05-20 20:31:39] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-20 20:31:40] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-05-20 20:31:40] [INFO ] Redundant transitions in 6 ms returned []
Running 570 sub problems to find dead transitions.
[2024-05-20 20:31:40] [INFO ] Invariant cache hit.
[2024-05-20 20:31:40] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:31:42] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:31:42] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:31:42] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:31:42] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:31:42] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:31:42] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-20 20:31:42] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 2 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 2 ms to minimize.
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 2 ms to minimize.
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 2 places in 66 ms of which 2 ms to minimize.
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 2 places in 60 ms of which 1 ms to minimize.
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:31:43] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:31:44] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:31:47] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:31:47] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:31:47] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:31:47] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-20 20:31:47] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:31:47] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:31:47] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:31:47] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-20 20:31:47] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:31:47] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:31:47] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-20 20:31:47] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:31:47] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:31:47] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:31:48] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:31:48] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-20 20:31:48] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:31:48] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:31:48] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:31:48] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:31:48] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:31:48] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:31:48] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-20 20:31:50] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:31:50] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:31:50] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:31:50] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:31:50] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:31:50] [INFO ] Deduced a trap composed of 24 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:31:50] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:31:50] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:31:50] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:31:50] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:31:51] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:31:51] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:31:51] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:31:51] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:31:51] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:31:51] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:31:51] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:31:51] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:31:51] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:31:51] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-20 20:31:51] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:31:52] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:31:52] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:31:52] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:31:52] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:31:52] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:31:52] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:31:52] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:31:52] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:31:52] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:31:52] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:31:52] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:31:52] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:31:52] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:31:52] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:31:55] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 19/111 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:32:00] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:32:04] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:32:04] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:32:04] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:32:04] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:32:06] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:32:06] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 242/823 variables, and 118 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/243 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 106/106 constraints]
Escalating to Integer solving :Problem set: 0 solved, 570 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/242 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/242 variables, 106/118 constraints. Problems are: Problem set: 0 solved, 570 unsolved
[2024-05-20 20:32:12] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 5 (OVERLAPS) 580/822 variables, 242/361 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 200/561 constraints. Problems are: Problem set: 0 solved, 570 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/822 variables, 570/1131 constraints. Problems are: Problem set: 0 solved, 570 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 822/823 variables, and 1131 constraints, problems are : Problem set: 0 solved, 570 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 242/243 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 570/570 constraints, Known Traps: 107/107 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 570 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in SI_CTL mode, iteration 1 : 243/323 places, 580/660 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60622 ms. Remains : 243/323 places, 580/660 transitions.
[2024-05-20 20:32:40] [INFO ] Flatten gal took : 12 ms
[2024-05-20 20:32:40] [INFO ] Flatten gal took : 8 ms
[2024-05-20 20:32:40] [INFO ] Input system was already deterministic with 580 transitions.
[2024-05-20 20:32:40] [INFO ] Flatten gal took : 8 ms
[2024-05-20 20:32:40] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:32:40] [INFO ] Time to serialize gal into /tmp/CTLFireability3184667652034993606.gal : 2 ms
[2024-05-20 20:32:40] [INFO ] Time to serialize properties into /tmp/CTLFireability3491593881509327477.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3184667652034993606.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3491593881509327477.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 20:33:10] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:33:10] [INFO ] Applying decomposition
[2024-05-20 20:33:10] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5131617169317093313.txt' '-o' '/tmp/graph5131617169317093313.bin' '-w' '/tmp/graph5131617169317093313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5131617169317093313.bin' '-l' '-1' '-v' '-w' '/tmp/graph5131617169317093313.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:33:10] [INFO ] Decomposing Gal with order
[2024-05-20 20:33:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:33:10] [INFO ] Removed a total of 256 redundant transitions.
[2024-05-20 20:33:10] [INFO ] Flatten gal took : 23 ms
[2024-05-20 20:33:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 172 labels/synchronizations in 2 ms.
[2024-05-20 20:33:10] [INFO ] Time to serialize gal into /tmp/CTLFireability9462004615971756663.gal : 3 ms
[2024-05-20 20:33:10] [INFO ] Time to serialize properties into /tmp/CTLFireability14380832842664224830.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/CTLFireability9462004615971756663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14380832842664224830.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 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 8 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2024-05-20 20:33:40] [INFO ] Computed 12 invariants in 3 ms
[2024-05-20 20:33:40] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-20 20:33:40] [INFO ] Invariant cache hit.
[2024-05-20 20:33:40] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 20:33:41] [INFO ] Implicit Places using invariants and state equation in 400 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-20 20:33:41] [INFO ] Invariant cache hit.
[2024-05-20 20:33:41] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:33:45] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:33:45] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:33:45] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:33:45] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:33:45] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:33:45] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:33:45] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:33:45] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:33:45] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:33:45] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:33:45] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:33:45] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:33:45] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:33:46] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-20 20:33:46] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-05-20 20:33:46] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 1 ms to minimize.
[2024-05-20 20:33:46] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 2 ms to minimize.
[2024-05-20 20:33:46] [INFO ] Deduced a trap composed of 36 places in 88 ms of which 2 ms to minimize.
[2024-05-20 20:33:46] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2024-05-20 20:33:46] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:33:47] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-20 20:33:47] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-20 20:33:47] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:33:47] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:33:47] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2024-05-20 20:33:47] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:33:48] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:33:48] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:33:48] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:33:48] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 2 ms to minimize.
[2024-05-20 20:33:48] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:33:48] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:33:48] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:33:48] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:33:48] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 2 ms to minimize.
[2024-05-20 20:33:48] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:33:48] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:33:48] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:33:48] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:33:48] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:33:52] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:33:52] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 2 ms to minimize.
[2024-05-20 20:33:52] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-05-20 20:33:52] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-20 20:33:53] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:33:53] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:33:53] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:33:53] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:33:53] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:33:53] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:33:53] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:33:53] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:33:53] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:33:55] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:33:55] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:33:56] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:33:56] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:33:56] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:33:56] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:33:56] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:33:56] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:33:57] [INFO ] Deduced a trap composed of 36 places in 70 ms of which 1 ms to minimize.
[2024-05-20 20:33:57] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-20 20:33:57] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2024-05-20 20:33:57] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:33:57] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-05-20 20:33:57] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-05-20 20:33:57] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:33:57] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:33:57] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:33:57] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:33:57] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:33:57] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:33:58] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:33:58] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:34:00] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:34:00] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:34:00] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-20 20:34:00] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:34:00] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:34:01] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:34:01] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:34:01] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:34:01] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-05-20 20:34:01] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 0 ms to minimize.
[2024-05-20 20:34:01] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:34:01] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:34:02] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:34:02] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:34:02] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:34:02] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:34:02] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:34:02] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:34:02] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:34:02] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:34:02] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:34:02] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:34:02] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:34:02] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:34:02] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:34:07] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:34:07] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:34:07] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:34:07] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:34:07] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:34:08] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:34:08] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:34:08] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:34:08] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.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 1.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 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120 0.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 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/983 variables, and 121 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:34:12] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:34:12] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:34:12] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:34:12] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:34:13] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:34:13] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:34:13] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:34:13] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:34:13] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:34:13] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:34:13] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:34:14] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:34:15] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:34:18] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:34:20] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:34:25] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:34:25] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:34:27] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:34:28] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:34:28] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:34:28] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:34:34] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 143 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 131/131 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Finished structural reductions in LTL mode , in 1 iterations and 60657 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-20 20:34:41] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:34:41] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:34:41] [INFO ] Input system was already deterministic with 660 transitions.
[2024-05-20 20:34:41] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:34:41] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:34:41] [INFO ] Time to serialize gal into /tmp/CTLFireability11508014594305887923.gal : 2 ms
[2024-05-20 20:34:41] [INFO ] Time to serialize properties into /tmp/CTLFireability496075738585118086.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/CTLFireability11508014594305887923.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability496075738585118086.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 20:35:11] [INFO ] Flatten gal took : 15 ms
[2024-05-20 20:35:11] [INFO ] Applying decomposition
[2024-05-20 20:35:11] [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/graph13042530061885723822.txt' '-o' '/tmp/graph13042530061885723822.bin' '-w' '/tmp/graph13042530061885723822.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13042530061885723822.bin' '-l' '-1' '-v' '-w' '/tmp/graph13042530061885723822.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:35:11] [INFO ] Decomposing Gal with order
[2024-05-20 20:35:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:35:11] [INFO ] Removed a total of 300 redundant transitions.
[2024-05-20 20:35:11] [INFO ] Flatten gal took : 21 ms
[2024-05-20 20:35:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 3 ms.
[2024-05-20 20:35:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14739435431809429999.gal : 3 ms
[2024-05-20 20:35:11] [INFO ] Time to serialize properties into /tmp/CTLFireability3312510261256296598.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/CTLFireability14739435431809429999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3312510261256296598.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 : 323/323 places, 660/660 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 323 transition count 593
Reduce places removed 67 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 135 place count 256 transition count 592
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 136 place count 255 transition count 592
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
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 156 place count 245 transition count 582
Applied a total of 156 rules in 29 ms. Remains 245 /323 variables (removed 78) and now considering 582/660 (removed 78) transitions.
// Phase 1: matrix 582 rows 245 cols
[2024-05-20 20:35:41] [INFO ] Computed 12 invariants in 2 ms
[2024-05-20 20:35:41] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-20 20:35:41] [INFO ] Invariant cache hit.
[2024-05-20 20:35:41] [INFO ] State equation strengthened by 200 read => feed constraints.
[2024-05-20 20:35:42] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2024-05-20 20:35:42] [INFO ] Redundant transitions in 6 ms returned []
Running 572 sub problems to find dead transitions.
[2024-05-20 20:35:42] [INFO ] Invariant cache hit.
[2024-05-20 20:35:42] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-20 20:35:44] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:35:44] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:35:44] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-20 20:35:44] [INFO ] Deduced a trap composed of 17 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:35:44] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:35:44] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:35:44] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 0 ms to minimize.
[2024-05-20 20:35:44] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:35:44] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:35:44] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:35:45] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-20 20:35:48] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-20 20:35:48] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:35:48] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:35:48] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2024-05-20 20:35:48] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:35:48] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:35:48] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:35:48] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:35:48] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-20 20:35:48] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:35:48] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:35:49] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-20 20:35:51] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:35:51] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:35:51] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:35:51] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:35:51] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:35:51] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:35:51] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:35:51] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:35:51] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:35:51] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:35:52] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:35:52] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:35:52] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:35:52] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 0 ms to minimize.
[2024-05-20 20:35:52] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:35:52] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:35:52] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:35:52] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:35:52] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:35:52] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-20 20:35:52] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:35:52] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:35:53] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:35:54] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:35:54] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:35:54] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:35:54] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:35:54] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:35:54] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:35:54] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:35:54] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-20 20:35:54] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:35:54] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:35:54] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:35:54] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:35:55] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:35:55] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:35:55] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:35:55] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:35:55] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-20 20:35:55] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:35:57] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:35:57] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:35:57] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:35:57] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:35:58] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:35:58] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:35:58] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:35:58] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:35:58] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:35:58] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:35:58] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-20 20:35:58] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:35:58] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:35:58] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:35:58] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:35:58] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:35:59] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:35:59] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 19/111 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-20 20:36:02] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:36:02] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:36:02] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:36:02] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:36:02] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:36:02] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:36:03] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:36:03] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:36:03] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 9/120 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-20 20:36:07] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/244 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 244/827 variables, and 121 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/245 constraints, ReadFeed: 0/200 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/244 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/244 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-20 20:36:12] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:36:13] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:36:15] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/244 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2024-05-20 20:36:17] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:36:17] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 6 (OVERLAPS) 582/826 variables, 244/370 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/826 variables, 200/570 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/826 variables, 572/1142 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/827 variables, and 1142 constraints, problems are : Problem set: 0 solved, 572 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 244/245 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 114/114 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 572 unsolved
Search for dead transitions found 0 dead transitions in 60112ms
Starting structural reductions in SI_CTL mode, iteration 1 : 245/323 places, 582/660 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60575 ms. Remains : 245/323 places, 582/660 transitions.
[2024-05-20 20:36:42] [INFO ] Flatten gal took : 16 ms
[2024-05-20 20:36:42] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:36:42] [INFO ] Input system was already deterministic with 582 transitions.
[2024-05-20 20:36:42] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:36:42] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:36:42] [INFO ] Time to serialize gal into /tmp/CTLFireability4973963507784670484.gal : 2 ms
[2024-05-20 20:36:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15278053923344368720.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/CTLFireability4973963507784670484.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15278053923344368720.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-20 20:37:12] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:37:12] [INFO ] Applying decomposition
[2024-05-20 20:37:12] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12439254005835663310.txt' '-o' '/tmp/graph12439254005835663310.bin' '-w' '/tmp/graph12439254005835663310.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12439254005835663310.bin' '-l' '-1' '-v' '-w' '/tmp/graph12439254005835663310.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:37:12] [INFO ] Decomposing Gal with order
[2024-05-20 20:37:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:37:12] [INFO ] Removed a total of 269 redundant transitions.
[2024-05-20 20:37:12] [INFO ] Flatten gal took : 18 ms
[2024-05-20 20:37:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 2 ms.
[2024-05-20 20:37:12] [INFO ] Time to serialize gal into /tmp/CTLFireability3491500823255910035.gal : 3 ms
[2024-05-20 20:37:12] [INFO ] Time to serialize properties into /tmp/CTLFireability12516750879230739261.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/CTLFireability3491500823255910035.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12516750879230739261.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 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 323 cols
[2024-05-20 20:37:42] [INFO ] Computed 12 invariants in 8 ms
[2024-05-20 20:37:42] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-20 20:37:42] [INFO ] Invariant cache hit.
[2024-05-20 20:37:42] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 20:37:42] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-20 20:37:42] [INFO ] Invariant cache hit.
[2024-05-20 20:37:42] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:37:46] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:37:46] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:37:47] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:37:47] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:37:47] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:37:47] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:37:47] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:37:47] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-05-20 20:37:47] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:37:47] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:37:47] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:37:47] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:37:47] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:37:47] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-20 20:37:47] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-05-20 20:37:47] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:37:47] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-20 20:37:48] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 2 ms to minimize.
[2024-05-20 20:37:48] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-05-20 20:37:48] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:37:49] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
[2024-05-20 20:37:49] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-20 20:37:49] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:37:49] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:37:49] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-05-20 20:37:49] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 2 ms to minimize.
[2024-05-20 20:37:49] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:37:49] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:37:49] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:37:49] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:37:49] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:37:49] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:37:49] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:37:50] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:37:50] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:37:50] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:37:50] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:37:50] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:37:50] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:37:50] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:37:54] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:37:54] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:37:54] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-20 20:37:54] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-20 20:37:54] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 2 ms to minimize.
[2024-05-20 20:37:55] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-20 20:37:55] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:37:55] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:37:55] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:37:55] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:37:55] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:37:55] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:37:55] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:37:57] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:37:57] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:37:57] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:37:57] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-20 20:37:57] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-20 20:37:57] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:37:58] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:37:58] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:37:58] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 1 ms to minimize.
[2024-05-20 20:37:58] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-20 20:37:58] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 1 ms to minimize.
[2024-05-20 20:37:59] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:37:59] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-05-20 20:37:59] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 2 ms to minimize.
[2024-05-20 20:37:59] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:37:59] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:37:59] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:37:59] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:37:59] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:37:59] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:37:59] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:37:59] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:38:02] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:38:02] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:38:02] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 20:38:02] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2024-05-20 20:38:02] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:38:03] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:38:03] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 0 ms to minimize.
[2024-05-20 20:38:03] [INFO ] Deduced a trap composed of 31 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:38:03] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2024-05-20 20:38:03] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:38:03] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:38:03] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:38:03] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:38:04] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:38:04] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:38:04] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:38:04] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:38:04] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:38:04] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2024-05-20 20:38:04] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:38:04] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:38:04] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:38:04] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:38:04] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:38:04] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:38:09] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:38:09] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:38:09] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:38:09] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:38:09] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:38:10] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:38:10] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:38:10] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:38:10] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 1.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 1.0)
(s56 0.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 1.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 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.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 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.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 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 timeout
0.0)
(s163 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/983 variables, and 121 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:38:14] [INFO ] Deduced a trap composed of 33 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:38:14] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:38:14] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:38:14] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:38:14] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:38:14] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:38:14] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:38:15] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
[2024-05-20 20:38:15] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:38:15] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:38:15] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:38:16] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2024-05-20 20:38:17] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:38:20] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:38:22] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:38:27] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:38:27] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:38:29] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:38:30] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:38:30] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:38:30] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:38:35] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1)
(s1 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(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 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 1)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 1)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 1)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 6)
(s248 0)
(s249 1)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 143 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 131/131 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Finished structural reductions in LTL mode , in 1 iterations and 60609 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-20 20:38:43] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:38:43] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:38:43] [INFO ] Input system was already deterministic with 660 transitions.
[2024-05-20 20:38:43] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:38:43] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:38:43] [INFO ] Time to serialize gal into /tmp/CTLFireability5539882642421035927.gal : 2 ms
[2024-05-20 20:38:43] [INFO ] Time to serialize properties into /tmp/CTLFireability5332359610455341549.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/CTLFireability5539882642421035927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5332359610455341549.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 20:39:13] [INFO ] Flatten gal took : 18 ms
[2024-05-20 20:39:13] [INFO ] Applying decomposition
[2024-05-20 20:39:13] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4527660442011874916.txt' '-o' '/tmp/graph4527660442011874916.bin' '-w' '/tmp/graph4527660442011874916.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4527660442011874916.bin' '-l' '-1' '-v' '-w' '/tmp/graph4527660442011874916.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:39:13] [INFO ] Decomposing Gal with order
[2024-05-20 20:39:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:39:13] [INFO ] Removed a total of 293 redundant transitions.
[2024-05-20 20:39:13] [INFO ] Flatten gal took : 22 ms
[2024-05-20 20:39:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 218 labels/synchronizations in 5 ms.
[2024-05-20 20:39:13] [INFO ] Time to serialize gal into /tmp/CTLFireability16732838775340320940.gal : 3 ms
[2024-05-20 20:39:13] [INFO ] Time to serialize properties into /tmp/CTLFireability5652342271673734208.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/CTLFireability16732838775340320940.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5652342271673734208.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 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 8 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2024-05-20 20:39:43] [INFO ] Invariant cache hit.
[2024-05-20 20:39:43] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-20 20:39:43] [INFO ] Invariant cache hit.
[2024-05-20 20:39:43] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 20:39:43] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-20 20:39:43] [INFO ] Invariant cache hit.
[2024-05-20 20:39:43] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:39:47] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:39:47] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-20 20:39:47] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:39:47] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:39:48] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 2 ms to minimize.
[2024-05-20 20:39:48] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:39:48] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:39:48] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:39:48] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:39:48] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:39:48] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:39:48] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:39:48] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:39:48] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-20 20:39:48] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2024-05-20 20:39:48] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:39:48] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
[2024-05-20 20:39:48] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2024-05-20 20:39:49] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2024-05-20 20:39:49] [INFO ] Deduced a trap composed of 31 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:39:49] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 2 ms to minimize.
[2024-05-20 20:39:50] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-20 20:39:50] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:39:50] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-20 20:39:50] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:39:50] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:39:50] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:39:50] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:39:50] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:39:50] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:39:50] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:39:50] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:39:50] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:39:50] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:39:50] [INFO ] Deduced a trap composed of 32 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:39:50] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:39:51] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:39:51] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:39:51] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:39:51] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:39:54] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:39:54] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:39:55] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-05-20 20:39:55] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-20 20:39:55] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:39:55] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-05-20 20:39:55] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:39:55] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 2 ms to minimize.
[2024-05-20 20:39:56] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:39:56] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:39:56] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:39:56] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:39:56] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:39:58] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:39:58] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:39:58] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:39:58] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
[2024-05-20 20:39:58] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:39:58] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:39:58] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:39:58] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-05-20 20:39:59] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:39:59] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 1 ms to minimize.
[2024-05-20 20:39:59] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:39:59] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:39:59] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 2 ms to minimize.
[2024-05-20 20:39:59] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-20 20:39:59] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:40:00] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:40:00] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:40:00] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:40:00] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:40:00] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:40:00] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:40:00] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:40:02] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:40:02] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:40:02] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-05-20 20:40:03] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:40:03] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 33 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:40:04] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:40:05] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:40:05] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:40:05] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:40:05] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:40:10] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:40:10] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:40:10] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:40:10] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:40:10] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:40:10] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:40:10] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:40:10] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:40:11] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/983 variables, and 121 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:40:15] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:40:15] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:40:15] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:40:15] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:40:15] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:40:15] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:40:15] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:40:15] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:40:16] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:40:16] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:40:16] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:40:17] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:40:18] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:40:21] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:40:23] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:40:27] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:40:28] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:40:30] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:40:31] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:40:31] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:40:31] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:40:36] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 143 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 131/131 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Finished structural reductions in LTL mode , in 1 iterations and 60605 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-20 20:40:43] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:40:43] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:40:43] [INFO ] Input system was already deterministic with 660 transitions.
[2024-05-20 20:40:43] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:40:43] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:40:43] [INFO ] Time to serialize gal into /tmp/CTLFireability6861610980541719353.gal : 2 ms
[2024-05-20 20:40:43] [INFO ] Time to serialize properties into /tmp/CTLFireability2351697997817147797.ctl : 5 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/CTLFireability6861610980541719353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2351697997817147797.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 20:41:14] [INFO ] Flatten gal took : 19 ms
[2024-05-20 20:41:14] [INFO ] Applying decomposition
[2024-05-20 20:41:14] [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/graph12443031108733632363.txt' '-o' '/tmp/graph12443031108733632363.bin' '-w' '/tmp/graph12443031108733632363.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12443031108733632363.bin' '-l' '-1' '-v' '-w' '/tmp/graph12443031108733632363.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:41:14] [INFO ] Decomposing Gal with order
[2024-05-20 20:41:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:41:14] [INFO ] Removed a total of 296 redundant transitions.
[2024-05-20 20:41:14] [INFO ] Flatten gal took : 20 ms
[2024-05-20 20:41:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 238 labels/synchronizations in 4 ms.
[2024-05-20 20:41:14] [INFO ] Time to serialize gal into /tmp/CTLFireability4789847640725333250.gal : 2 ms
[2024-05-20 20:41:14] [INFO ] Time to serialize properties into /tmp/CTLFireability15782085391968790944.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/CTLFireability4789847640725333250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15782085391968790944.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 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2024-05-20 20:41:44] [INFO ] Invariant cache hit.
[2024-05-20 20:41:44] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-20 20:41:44] [INFO ] Invariant cache hit.
[2024-05-20 20:41:44] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 20:41:44] [INFO ] Implicit Places using invariants and state equation in 410 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-20 20:41:44] [INFO ] Invariant cache hit.
[2024-05-20 20:41:44] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:41:48] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:41:48] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-05-20 20:41:48] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:41:48] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:41:48] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:41:49] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 ms to minimize.
[2024-05-20 20:41:49] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:41:49] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:41:49] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:41:49] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:41:49] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:41:49] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:41:49] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:41:49] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
[2024-05-20 20:41:49] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2024-05-20 20:41:49] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:41:49] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 1 ms to minimize.
[2024-05-20 20:41:49] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 1 ms to minimize.
[2024-05-20 20:41:49] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-20 20:41:50] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:41:50] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2024-05-20 20:41:50] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-20 20:41:51] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-20 20:41:51] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-20 20:41:51] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:41:51] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:41:51] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 2 ms to minimize.
[2024-05-20 20:41:51] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
[2024-05-20 20:41:51] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:41:51] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:41:51] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:41:51] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:41:51] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:41:51] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:41:51] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:41:51] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 2 ms to minimize.
[2024-05-20 20:41:51] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:41:52] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:41:52] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:41:52] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:41:55] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:41:55] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:41:56] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:41:56] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2024-05-20 20:41:56] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
[2024-05-20 20:41:56] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:41:56] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:41:56] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
[2024-05-20 20:41:56] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:41:56] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:41:57] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:41:57] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:41:57] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:41:59] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:41:59] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:41:59] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:41:59] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:41:59] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:41:59] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:41:59] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:41:59] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:42:00] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2024-05-20 20:42:00] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 1 ms to minimize.
[2024-05-20 20:42:00] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:42:00] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:42:00] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-20 20:42:00] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-05-20 20:42:00] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:42:01] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:42:01] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:42:01] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:42:01] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:42:01] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:42:01] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:42:01] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:42:03] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:42:03] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:42:03] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:42:03] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:42:04] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 0 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 33 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:42:05] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:42:06] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:42:06] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:42:06] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:42:10] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:42:11] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:42:11] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:42:11] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:42:11] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:42:11] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:42:11] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:42:11] [INFO ] Deduced a trap composed of 31 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:42:11] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 322/983 variables, and 121 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:42:16] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:42:16] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:42:16] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:42:16] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:42:16] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:42:16] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:42:16] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:42:16] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-05-20 20:42:17] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:42:17] [INFO ] Deduced a trap composed of 41 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:42:17] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:42:18] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:42:19] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:42:22] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:42:24] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:42:29] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 0 ms to minimize.
[2024-05-20 20:42:29] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:42:31] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:42:32] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:42:32] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:42:32] [INFO ] Deduced a trap composed of 31 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:42:38] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 143 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 131/131 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Finished structural reductions in LTL mode , in 1 iterations and 60629 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-20 20:42:44] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:42:44] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:42:44] [INFO ] Input system was already deterministic with 660 transitions.
[2024-05-20 20:42:44] [INFO ] Flatten gal took : 17 ms
[2024-05-20 20:42:44] [INFO ] Flatten gal took : 15 ms
[2024-05-20 20:42:44] [INFO ] Time to serialize gal into /tmp/CTLFireability12717895721674908813.gal : 3 ms
[2024-05-20 20:42:44] [INFO ] Time to serialize properties into /tmp/CTLFireability10023660858794216980.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/CTLFireability12717895721674908813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10023660858794216980.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-20 20:43:14] [INFO ] Flatten gal took : 16 ms
[2024-05-20 20:43:14] [INFO ] Applying decomposition
[2024-05-20 20:43:14] [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/graph1670530301115316799.txt' '-o' '/tmp/graph1670530301115316799.bin' '-w' '/tmp/graph1670530301115316799.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1670530301115316799.bin' '-l' '-1' '-v' '-w' '/tmp/graph1670530301115316799.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:43:14] [INFO ] Decomposing Gal with order
[2024-05-20 20:43:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:43:15] [INFO ] Removed a total of 296 redundant transitions.
[2024-05-20 20:43:15] [INFO ] Flatten gal took : 20 ms
[2024-05-20 20:43:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 4 ms.
[2024-05-20 20:43:15] [INFO ] Time to serialize gal into /tmp/CTLFireability16968459193441471100.gal : 3 ms
[2024-05-20 20:43:15] [INFO ] Time to serialize properties into /tmp/CTLFireability14547469578860769062.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/CTLFireability16968459193441471100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14547469578860769062.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 : 323/323 places, 660/660 transitions.
Applied a total of 0 rules in 2 ms. Remains 323 /323 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2024-05-20 20:43:45] [INFO ] Invariant cache hit.
[2024-05-20 20:43:45] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-20 20:43:45] [INFO ] Invariant cache hit.
[2024-05-20 20:43:45] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 20:43:45] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-20 20:43:45] [INFO ] Invariant cache hit.
[2024-05-20 20:43:45] [INFO ] State equation strengthened by 190 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:43:49] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:43:49] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 0 ms to minimize.
[2024-05-20 20:43:49] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:43:49] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:43:49] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:43:49] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:43:50] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:43:50] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:43:50] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:43:50] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:43:50] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:43:50] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:43:50] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:43:50] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-20 20:43:50] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-05-20 20:43:50] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 2 ms to minimize.
[2024-05-20 20:43:50] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-05-20 20:43:50] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 1 ms to minimize.
[2024-05-20 20:43:50] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-05-20 20:43:51] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:43:51] [INFO ] Deduced a trap composed of 31 places in 67 ms of which 2 ms to minimize.
[2024-05-20 20:43:51] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-20 20:43:52] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:43:52] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 2 ms to minimize.
[2024-05-20 20:43:52] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-05-20 20:43:52] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 2 ms to minimize.
[2024-05-20 20:43:52] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 2 ms to minimize.
[2024-05-20 20:43:52] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:43:52] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:43:52] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:43:52] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 1 ms to minimize.
[2024-05-20 20:43:52] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 0 ms to minimize.
[2024-05-20 20:43:52] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:43:52] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:43:52] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
[2024-05-20 20:43:52] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:43:53] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:43:53] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:43:53] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:43:53] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:43:56] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:43:56] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:43:57] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 2 ms to minimize.
[2024-05-20 20:43:57] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-05-20 20:43:57] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-05-20 20:43:57] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:43:57] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:43:57] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:43:57] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:43:57] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:43:57] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:43:58] [INFO ] Deduced a trap composed of 34 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:43:58] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:44:00] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:44:00] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:44:00] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:44:00] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-05-20 20:44:00] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:44:00] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:44:00] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:44:00] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:44:01] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:44:01] [INFO ] Deduced a trap composed of 33 places in 68 ms of which 2 ms to minimize.
[2024-05-20 20:44:01] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:44:01] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:44:01] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-05-20 20:44:01] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2024-05-20 20:44:01] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:44:01] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:44:02] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:44:02] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:44:02] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:44:02] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:44:02] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:44:02] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:44:04] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:44:04] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:44:04] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:44:04] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-05-20 20:44:04] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:44:05] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:44:05] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 2 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 32 places in 61 ms of which 7 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:44:06] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:44:07] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:44:11] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:44:11] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2024-05-20 20:44:11] [INFO ] Deduced a trap composed of 31 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:44:12] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 0 ms to minimize.
[2024-05-20 20:44:12] [INFO ] Deduced a trap composed of 30 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:44:12] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:44:12] [INFO ] Deduced a trap composed of 30 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:44:12] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 0 ms to minimize.
[2024-05-20 20:44:12] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 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 Real declared 322/983 variables, and 121 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/322 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/322 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 109/121 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:44:17] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:44:17] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:44:17] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:44:17] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:44:17] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:44:17] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:44:17] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:44:17] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:44:17] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:44:18] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:44:18] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:44:19] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-20 20:44:20] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 13/134 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:44:23] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:44:24] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:44:29] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:44:29] [INFO ] Deduced a trap composed of 30 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:44:32] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:44:33] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:44:33] [INFO ] Deduced a trap composed of 32 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:44:33] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/322 variables, 4/142 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-20 20:44:38] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 322/983 variables, and 143 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/323 constraints, ReadFeed: 0/190 constraints, PredecessorRefiner: 0/650 constraints, Known Traps: 131/131 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Finished structural reductions in LTL mode , in 1 iterations and 60619 ms. Remains : 323/323 places, 660/660 transitions.
[2024-05-20 20:44:45] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:44:45] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:44:45] [INFO ] Input system was already deterministic with 660 transitions.
[2024-05-20 20:44:45] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:44:45] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:44:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4095325835516850310.gal : 1 ms
[2024-05-20 20:44:45] [INFO ] Time to serialize properties into /tmp/CTLFireability7751037259551113836.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/CTLFireability4095325835516850310.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7751037259551113836.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-20 20:45:46] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:45:46] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:45:46] [INFO ] Applying decomposition
[2024-05-20 20:45:46] [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/graph321962807186126535.txt' '-o' '/tmp/graph321962807186126535.bin' '-w' '/tmp/graph321962807186126535.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph321962807186126535.bin' '-l' '-1' '-v' '-w' '/tmp/graph321962807186126535.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:45:46] [INFO ] Decomposing Gal with order
[2024-05-20 20:45:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:45:46] [INFO ] Removed a total of 295 redundant transitions.
[2024-05-20 20:45:46] [INFO ] Flatten gal took : 19 ms
[2024-05-20 20:45:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 254 labels/synchronizations in 3 ms.
[2024-05-20 20:45:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8606120682308815731.gal : 3 ms
[2024-05-20 20:45:46] [INFO ] Time to serialize properties into /tmp/CTLFireability15455712802552321986.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/CTLFireability8606120682308815731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15455712802552321986.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 16 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.21316e+11,340.737,3585900,179345,21767,5.42255e+06,480757,991,7.92892e+06,476,4.21385e+06,0


Converting to forward existential form...Done !
ITS-tools command line returned an error code 137
[2024-05-20 21:00:52] [INFO ] Flatten gal took : 14 ms
[2024-05-20 21:00:52] [INFO ] Time to serialize gal into /tmp/CTLFireability537072548599232818.gal : 2 ms
[2024-05-20 21:00:52] [INFO ] Time to serialize properties into /tmp/CTLFireability10368218342734913530.ctl : 9 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/CTLFireability537072548599232818.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10368218342734913530.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 16 CTL formulae.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-010.tgz
mv CANInsertWithFailure-PT-010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;