Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 11 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 11 14:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 185K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717009058202

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 18:57:39] [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-29 18:57:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:57:39] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-29 18:57:39] [INFO ] Transformed 783 places.
[2024-05-29 18:57:39] [INFO ] Transformed 713 transitions.
[2024-05-29 18:57:39] [INFO ] Found NUPN structural information;
[2024-05-29 18:57:39] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 111 out of 783 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 783/783 places, 713/713 transitions.
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 88 place count 695 transition count 625
Iterating global reduction 0 with 88 rules applied. Total rules applied 176 place count 695 transition count 625
Applied a total of 176 rules in 121 ms. Remains 695 /783 variables (removed 88) and now considering 625/713 (removed 88) transitions.
// Phase 1: matrix 625 rows 695 cols
[2024-05-29 18:57:39] [INFO ] Computed 111 invariants in 24 ms
[2024-05-29 18:57:40] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-29 18:57:40] [INFO ] Invariant cache hit.
[2024-05-29 18:57:40] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
Running 624 sub problems to find dead transitions.
[2024-05-29 18:57:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/694 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 1/695 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-05-29 18:57:52] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 9 ms to minimize.
[2024-05-29 18:57:52] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:57:52] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:57:52] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:57:53] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:57:53] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:57:53] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:57:53] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:57:53] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:57:53] [INFO ] Deduced a trap composed of 16 places in 221 ms of which 5 ms to minimize.
[2024-05-29 18:57:53] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:57:53] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:57:54] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:57:54] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
[2024-05-29 18:57:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:57:54] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:57:54] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 3 ms to minimize.
[2024-05-29 18:57:54] [INFO ] Deduced a trap composed of 22 places in 197 ms of which 4 ms to minimize.
[2024-05-29 18:57:54] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:57:55] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/695 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-05-29 18:57:56] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:57:56] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:57:56] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:57:56] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:57:57] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:57:57] [INFO ] Deduced a trap composed of 28 places in 142 ms of which 4 ms to minimize.
[2024-05-29 18:57:57] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:57:57] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:57:57] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:57:57] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:57:57] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:57:58] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:57:58] [INFO ] Deduced a trap composed of 19 places in 123 ms of which 2 ms to minimize.
[2024-05-29 18:57:58] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 2 ms to minimize.
[2024-05-29 18:57:58] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:57:58] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:57:58] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:57:58] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:57:58] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:57:58] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/695 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-05-29 18:58:07] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:58:07] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:58:07] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:58:08] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 3 ms to minimize.
[2024-05-29 18:58:08] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:58:08] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:58:08] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:58:08] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:58:08] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:58:08] [INFO ] Deduced a trap composed of 27 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:58:09] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 3 ms to minimize.
[2024-05-29 18:58:09] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:58:09] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:58:09] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:58:09] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:58:09] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:58:09] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:58:09] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:58:09] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:58:09] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 695/1320 variables, and 171 constraints, problems are : Problem set: 0 solved, 624 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/695 constraints, PredecessorRefiner: 624/624 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 624 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/694 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 1 (OVERLAPS) 1/695 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 624 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/695 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-05-29 18:58:19] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:58:19] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:58:20] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:58:20] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:58:20] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:58:21] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 2 ms to minimize.
[2024-05-29 18:58:22] [INFO ] Deduced a trap composed of 33 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:58:22] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:58:22] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:58:22] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:58:22] [INFO ] Deduced a trap composed of 29 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:58:22] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/695 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-05-29 18:58:26] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:58:27] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:58:27] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:58:27] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:58:27] [INFO ] Deduced a trap composed of 29 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:58:27] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:58:27] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:58:27] [INFO ] Deduced a trap composed of 33 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:58:28] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:58:28] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:58:28] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:58:28] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:58:28] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 13/204 constraints. Problems are: Problem set: 0 solved, 624 unsolved
[2024-05-29 18:58:30] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:58:33] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:58:34] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:58:35] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 624 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 695/1320 variables, and 208 constraints, problems are : Problem set: 0 solved, 624 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/695 constraints, PredecessorRefiner: 0/624 constraints, Known Traps: 97/97 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 624 unsolved
Search for dead transitions found 0 dead transitions in 60227ms
Starting structural reductions in LTL mode, iteration 1 : 695/783 places, 625/713 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61223 ms. Remains : 695/783 places, 625/713 transitions.
Support contains 111 out of 695 places after structural reductions.
[2024-05-29 18:58:41] [INFO ] Flatten gal took : 70 ms
[2024-05-29 18:58:41] [INFO ] Flatten gal took : 32 ms
[2024-05-29 18:58:41] [INFO ] Input system was already deterministic with 625 transitions.
Support contains 110 out of 695 places (down from 111) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1544 ms. (25 steps per ms) remains 5/75 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
[2024-05-29 18:58:42] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 146/161 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 534/695 variables, 95/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 625/1320 variables, 695/806 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1320 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1320 variables, 0/806 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1320/1320 variables, and 806 constraints, problems are : Problem set: 0 solved, 4 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 695/695 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 146/161 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 18:58:42] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 534/695 variables, 95/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 18:58:42] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:58:43] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
[2024-05-29 18:58:43] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:58:43] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:58:43] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:58:43] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:58:43] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:58:43] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 2 ms to minimize.
[2024-05-29 18:58:43] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:58:43] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:58:43] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 18:58:43] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/695 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 625/1320 variables, 695/819 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1320 variables, 4/823 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 18:58:43] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:58:43] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
[2024-05-29 18:58:44] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:58:44] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:58:44] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:58:44] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:58:44] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:58:44] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:58:44] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:58:44] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1320 variables, 10/833 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-29 18:58:44] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:58:44] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-05-29 18:58:44] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1320 variables, 3/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1320 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/1320 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1320/1320 variables, and 836 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2647 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 695/695 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 26/26 constraints]
After SMT, in 3239ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 1826 ms.
Support contains 6 out of 695 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 695/695 places, 625/625 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 695 transition count 479
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 148 rules applied. Total rules applied 294 place count 549 transition count 477
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 295 place count 548 transition count 477
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 295 place count 548 transition count 410
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 429 place count 481 transition count 410
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 447 place count 463 transition count 392
Iterating global reduction 3 with 18 rules applied. Total rules applied 465 place count 463 transition count 392
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 465 place count 463 transition count 379
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 491 place count 450 transition count 379
Performed 163 Post agglomeration using F-continuation condition.Transition count delta: 163
Deduced a syphon composed of 163 places in 0 ms
Reduce places removed 163 places and 0 transitions.
Iterating global reduction 3 with 326 rules applied. Total rules applied 817 place count 287 transition count 216
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 875 place count 258 transition count 216
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 3 with 29 rules applied. Total rules applied 904 place count 258 transition count 216
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 905 place count 257 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 906 place count 256 transition count 215
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 906 place count 256 transition count 213
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 910 place count 254 transition count 213
Applied a total of 910 rules in 122 ms. Remains 254 /695 variables (removed 441) and now considering 213/625 (removed 412) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 254/695 places, 213/625 transitions.
RANDOM walk for 40000 steps (8 resets) in 468 ms. (85 steps per ms) remains 1/2 properties
BEST_FIRST walk for 31822 steps (6 resets) in 108 ms. (291 steps per ms) remains 0/1 properties
[2024-05-29 18:58:47] [INFO ] Flatten gal took : 27 ms
[2024-05-29 18:58:47] [INFO ] Flatten gal took : 25 ms
[2024-05-29 18:58:47] [INFO ] Input system was already deterministic with 625 transitions.
Computed a total of 169 stabilizing places and 169 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 694 transition count 478
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 148 rules applied. Total rules applied 294 place count 548 transition count 476
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 296 place count 547 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 297 place count 546 transition count 475
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 70 Pre rules applied. Total rules applied 297 place count 546 transition count 405
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 437 place count 476 transition count 405
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 456 place count 457 transition count 386
Iterating global reduction 4 with 19 rules applied. Total rules applied 475 place count 457 transition count 386
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 475 place count 457 transition count 374
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 499 place count 445 transition count 374
Performed 150 Post agglomeration using F-continuation condition.Transition count delta: 150
Deduced a syphon composed of 150 places in 0 ms
Reduce places removed 150 places and 0 transitions.
Iterating global reduction 4 with 300 rules applied. Total rules applied 799 place count 295 transition count 224
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 801 place count 293 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 802 place count 292 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 802 place count 292 transition count 220
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 806 place count 290 transition count 220
Applied a total of 806 rules in 72 ms. Remains 290 /695 variables (removed 405) and now considering 220/625 (removed 405) transitions.
// Phase 1: matrix 220 rows 290 cols
[2024-05-29 18:58:47] [INFO ] Computed 110 invariants in 2 ms
[2024-05-29 18:58:47] [INFO ] Implicit Places using invariants in 137 ms returned [270, 274]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 140 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 288/695 places, 220/625 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 286 transition count 218
Applied a total of 4 rules in 13 ms. Remains 286 /288 variables (removed 2) and now considering 218/220 (removed 2) transitions.
// Phase 1: matrix 218 rows 286 cols
[2024-05-29 18:58:47] [INFO ] Computed 108 invariants in 1 ms
[2024-05-29 18:58:48] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-29 18:58:48] [INFO ] Invariant cache hit.
[2024-05-29 18:58:48] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 286/695 places, 218/625 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 562 ms. Remains : 286/695 places, 218/625 transitions.
[2024-05-29 18:58:48] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:58:48] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:58:48] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-29 18:58:48] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:58:48] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:58:48] [INFO ] Time to serialize gal into /tmp/CTLFireability10451208310998945757.gal : 6 ms
[2024-05-29 18:58:48] [INFO ] Time to serialize properties into /tmp/CTLFireability1230316001001663739.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/CTLFireability10451208310998945757.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1230316001001663739.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.76088e+42,0.669383,29508,2,826,5,103010,6,0,1364,177085,0


Converting to forward existential form...Done !
original formula: EF((A((p304==1) U (p635==1)) * AG(EF((p358!=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((E(!((p635==1)) U (!((p304==1)) * !((p635==1)))) + EG(!((p635==1)))))) * !(E(TRUE U !(E(T...185
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...489
Detected timeout of ITS tools.
[2024-05-29 18:59:18] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:59:18] [INFO ] Applying decomposition
[2024-05-29 18:59:18] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8076910729108894061.txt' '-o' '/tmp/graph8076910729108894061.bin' '-w' '/tmp/graph8076910729108894061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8076910729108894061.bin' '-l' '-1' '-v' '-w' '/tmp/graph8076910729108894061.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:59:18] [INFO ] Decomposing Gal with order
[2024-05-29 18:59:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:59:18] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-29 18:59:18] [INFO ] Flatten gal took : 40 ms
[2024-05-29 18:59:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 18:59:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9878001714610330752.gal : 4 ms
[2024-05-29 18:59:18] [INFO ] Time to serialize properties into /tmp/CTLFireability14562578075800409989.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/CTLFireability9878001714610330752.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14562578075800409989.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.76088e+42,0.620407,29560,176,23,54148,221,410,133536,44,1070,0


Converting to forward existential form...Done !
original formula: EF((A((i4.u31.p304==1) U (i13.u66.p635==1)) * AG(EF((i6.u38.p358!=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((E(!((i13.u66.p635==1)) U (!((i4.u31.p304==1)) * !((i13.u66.p635==1)))) + EG(!((i13.u66.p...223
Reverse transition relation is NOT exact ! Due to transitions t27, t217, i0.i0.i0.u3.t1, i0.i0.i0.u8.t54, i0.i0.i1.u4.t2, i0.i0.i1.u7.t50, i0.i1.i0.u2.t0, ...964
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 674 transition count 604
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 674 transition count 604
Applied a total of 42 rules in 30 ms. Remains 674 /695 variables (removed 21) and now considering 604/625 (removed 21) transitions.
// Phase 1: matrix 604 rows 674 cols
[2024-05-29 18:59:48] [INFO ] Computed 111 invariants in 11 ms
[2024-05-29 18:59:48] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-29 18:59:48] [INFO ] Invariant cache hit.
[2024-05-29 18:59:49] [INFO ] Implicit Places using invariants and state equation in 371 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2024-05-29 18:59:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/673 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/674 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:00:00] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:00:00] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:00:00] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:00:00] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:00:00] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:00:00] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:00:01] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:00:01] [INFO ] Deduced a trap composed of 21 places in 186 ms of which 4 ms to minimize.
[2024-05-29 19:00:01] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:00:01] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:00:01] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:00:01] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:00:01] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:00:02] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 3 ms to minimize.
[2024-05-29 19:00:02] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:00:02] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:00:02] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:00:02] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:00:02] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 2 ms to minimize.
[2024-05-29 19:00:02] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/674 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:00:03] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:00:03] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:00:04] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:00:05] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 3 ms to minimize.
[2024-05-29 19:00:05] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:00:05] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:00:05] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:00:05] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:00:05] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:00:05] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:00:05] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 2 ms to minimize.
[2024-05-29 19:00:06] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:00:06] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:00:06] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:00:06] [INFO ] Deduced a trap composed of 23 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:00:06] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:00:06] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:00:06] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:00:06] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:00:06] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/674 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:00:15] [INFO ] Deduced a trap composed of 26 places in 117 ms of which 3 ms to minimize.
[2024-05-29 19:00:15] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:00:15] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:00:15] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:00:15] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:00:15] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:00:15] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:00:15] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:00:16] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-29 19:00:16] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:00:16] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:00:16] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:00:16] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:00:16] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:00:16] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-29 19:00:16] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:00:17] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:00:17] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:00:17] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:00:17] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/674 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/1278 variables, and 171 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/674 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/673 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/674 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/674 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:00:26] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:00:28] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:00:29] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:00:30] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 2 ms to minimize.
[2024-05-29 19:00:30] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:00:30] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:00:30] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:00:30] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:00:30] [INFO ] Deduced a trap composed of 29 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/674 variables, 17/188 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:00:34] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:00:36] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:00:36] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:00:37] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/674 variables, 4/192 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:00:39] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:00:41] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:00:41] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:00:42] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 4/196 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/1278 variables, and 196 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/674 constraints, PredecessorRefiner: 0/603 constraints, Known Traps: 85/85 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 674/695 places, 604/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60705 ms. Remains : 674/695 places, 604/625 transitions.
[2024-05-29 19:00:49] [INFO ] Flatten gal took : 19 ms
[2024-05-29 19:00:49] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:00:49] [INFO ] Input system was already deterministic with 604 transitions.
[2024-05-29 19:00:49] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:00:49] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:00:49] [INFO ] Time to serialize gal into /tmp/CTLFireability2211524575296830368.gal : 3 ms
[2024-05-29 19:00:49] [INFO ] Time to serialize properties into /tmp/CTLFireability10179260661558062645.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/CTLFireability2211524575296830368.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10179260661558062645.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:01:19] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:01:19] [INFO ] Applying decomposition
[2024-05-29 19:01:19] [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/graph7592450175811162576.txt' '-o' '/tmp/graph7592450175811162576.bin' '-w' '/tmp/graph7592450175811162576.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7592450175811162576.bin' '-l' '-1' '-v' '-w' '/tmp/graph7592450175811162576.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:01:19] [INFO ] Decomposing Gal with order
[2024-05-29 19:01:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:01:19] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-29 19:01:19] [INFO ] Flatten gal took : 38 ms
[2024-05-29 19:01:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-29 19:01:19] [INFO ] Time to serialize gal into /tmp/CTLFireability9759215446601735857.gal : 19 ms
[2024-05-29 19:01:19] [INFO ] Time to serialize properties into /tmp/CTLFireability15579486180627374686.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/CTLFireability9759215446601735857.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15579486180627374686.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 : 695/695 places, 625/625 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 673 transition count 603
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 673 transition count 603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 672 transition count 602
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 672 transition count 602
Applied a total of 46 rules in 36 ms. Remains 672 /695 variables (removed 23) and now considering 602/625 (removed 23) transitions.
// Phase 1: matrix 602 rows 672 cols
[2024-05-29 19:01:49] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 19:01:50] [INFO ] Implicit Places using invariants in 285 ms returned []
[2024-05-29 19:01:50] [INFO ] Invariant cache hit.
[2024-05-29 19:01:50] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-29 19:01:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:02:01] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:02:01] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:02:01] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:02:01] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:02:02] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:02:02] [INFO ] Deduced a trap composed of 12 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:02:02] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:02:02] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 4 ms to minimize.
[2024-05-29 19:02:02] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:02:02] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:02:02] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:02:03] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:02:03] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:02:03] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:02:03] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 4 ms to minimize.
[2024-05-29 19:02:03] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:02:03] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:02:03] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:02:03] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:02:04] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:02:04] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:02:05] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:02:06] [INFO ] Deduced a trap composed of 28 places in 137 ms of which 3 ms to minimize.
[2024-05-29 19:02:06] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:02:06] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:02:06] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:02:06] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:02:06] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:02:06] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:02:06] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 3 ms to minimize.
[2024-05-29 19:02:07] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:02:07] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:02:07] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:02:07] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:02:07] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:02:07] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:02:07] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:02:07] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:02:07] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-29 19:02:08] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:02:16] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:02:16] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:02:16] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:02:16] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:02:16] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:02:16] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:02:17] [INFO ] Deduced a trap composed of 30 places in 84 ms of which 2 ms to minimize.
[2024-05-29 19:02:17] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 3 ms to minimize.
[2024-05-29 19:02:17] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:02:17] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:02:17] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:02:17] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:02:17] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:02:18] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:02:18] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:02:18] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:02:18] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:02:18] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:02:18] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:02:18] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 672/1274 variables, and 171 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:02:28] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:02:29] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:02:30] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:02:31] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:02:31] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:02:31] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:02:31] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:02:31] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:02:31] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:02:31] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 18/189 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:02:37] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:02:42] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:02:44] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 2/192 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/1274 variables, and 192 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 0/601 constraints, Known Traps: 81/81 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 672/695 places, 602/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60865 ms. Remains : 672/695 places, 602/625 transitions.
[2024-05-29 19:02:50] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:02:50] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:02:50] [INFO ] Input system was already deterministic with 602 transitions.
[2024-05-29 19:02:50] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:02:50] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:02:50] [INFO ] Time to serialize gal into /tmp/CTLFireability150721700791213852.gal : 3 ms
[2024-05-29 19:02:50] [INFO ] Time to serialize properties into /tmp/CTLFireability17605230002105588198.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/CTLFireability150721700791213852.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17605230002105588198.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-29 19:03:20] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:03:20] [INFO ] Applying decomposition
[2024-05-29 19:03:20] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14293375321832346259.txt' '-o' '/tmp/graph14293375321832346259.bin' '-w' '/tmp/graph14293375321832346259.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14293375321832346259.bin' '-l' '-1' '-v' '-w' '/tmp/graph14293375321832346259.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:03:20] [INFO ] Decomposing Gal with order
[2024-05-29 19:03:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:03:21] [INFO ] Removed a total of 103 redundant transitions.
[2024-05-29 19:03:21] [INFO ] Flatten gal took : 27 ms
[2024-05-29 19:03:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 19:03:21] [INFO ] Time to serialize gal into /tmp/CTLFireability6480785789147864832.gal : 8 ms
[2024-05-29 19:03:21] [INFO ] Time to serialize properties into /tmp/CTLFireability17582532001628169581.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/CTLFireability6480785789147864832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17582532001628169581.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 : 695/695 places, 625/625 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 672 transition count 602
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 672 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 671 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 671 transition count 601
Applied a total of 48 rules in 30 ms. Remains 671 /695 variables (removed 24) and now considering 601/625 (removed 24) transitions.
// Phase 1: matrix 601 rows 671 cols
[2024-05-29 19:03:51] [INFO ] Computed 111 invariants in 6 ms
[2024-05-29 19:03:51] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-29 19:03:51] [INFO ] Invariant cache hit.
[2024-05-29 19:03:51] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 592 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 19:03:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:04:02] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:04:02] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:04:02] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:04:02] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:04:02] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:04:03] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:04:03] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:04:03] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:04:03] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 4 ms to minimize.
[2024-05-29 19:04:03] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:04:03] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:04:03] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:04:03] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:04:04] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:04:04] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:04:04] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:04:04] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 3 ms to minimize.
[2024-05-29 19:04:04] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:04:04] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:04:04] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:04:06] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:04:06] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:04:06] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:04:06] [INFO ] Deduced a trap composed of 18 places in 130 ms of which 3 ms to minimize.
[2024-05-29 19:04:07] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:04:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:04:07] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:04:07] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:04:07] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:04:07] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:04:07] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2024-05-29 19:04:07] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 0 ms to minimize.
[2024-05-29 19:04:07] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:04:08] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:04:08] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:04:08] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:04:08] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:04:08] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-29 19:04:08] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:04:08] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:04:16] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:04:16] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:04:17] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:04:17] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:04:17] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:04:17] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:04:17] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:04:17] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:04:17] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:04:17] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:04:17] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:04:18] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:04:18] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:04:18] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:04:18] [INFO ] Deduced a trap composed of 25 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:04:18] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:04:18] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:04:18] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:04:18] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:04:19] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:04:21] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 1.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 1.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 1.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 1.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 1.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 1.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 1.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 1.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 1.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 1.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 1.0)
(s485 0.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 1.0)
(s494 0.0)
(s495 0.0)
(s496 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 172 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:04:28] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:04:31] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:04:32] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:04:32] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:04:32] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:04:32] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:04:32] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:04:32] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:04:32] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:04:32] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:04:32] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:04:33] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:04:33] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:04:33] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:04:33] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 15/187 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:04:38] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:04:38] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:04:39] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:04:39] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (OVERLAPS) 601/1272 variables, 671/862 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1272 variables, 600/1462 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:04:51] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 1463 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 671/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 81/81 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 671/695 places, 601/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60736 ms. Remains : 671/695 places, 601/625 transitions.
[2024-05-29 19:04:51] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:04:51] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:04:51] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:04:51] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:04:51] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:04:51] [INFO ] Time to serialize gal into /tmp/CTLFireability8031022684573089958.gal : 2 ms
[2024-05-29 19:04:51] [INFO ] Time to serialize properties into /tmp/CTLFireability1889635664721142088.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/CTLFireability8031022684573089958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1889635664721142088.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-29 19:05:22] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:05:22] [INFO ] Applying decomposition
[2024-05-29 19:05:22] [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/graph2249588227425335644.txt' '-o' '/tmp/graph2249588227425335644.bin' '-w' '/tmp/graph2249588227425335644.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2249588227425335644.bin' '-l' '-1' '-v' '-w' '/tmp/graph2249588227425335644.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:05:22] [INFO ] Decomposing Gal with order
[2024-05-29 19:05:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:05:22] [INFO ] Removed a total of 103 redundant transitions.
[2024-05-29 19:05:22] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:05:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-29 19:05:22] [INFO ] Time to serialize gal into /tmp/CTLFireability13423540775398299633.gal : 6 ms
[2024-05-29 19:05:22] [INFO ] Time to serialize properties into /tmp/CTLFireability17885614726340486071.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/CTLFireability13423540775398299633.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17885614726340486071.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 : 695/695 places, 625/625 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 674 transition count 604
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 674 transition count 604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 673 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 673 transition count 603
Applied a total of 44 rules in 34 ms. Remains 673 /695 variables (removed 22) and now considering 603/625 (removed 22) transitions.
// Phase 1: matrix 603 rows 673 cols
[2024-05-29 19:05:52] [INFO ] Computed 111 invariants in 5 ms
[2024-05-29 19:05:52] [INFO ] Implicit Places using invariants in 203 ms returned []
[2024-05-29 19:05:52] [INFO ] Invariant cache hit.
[2024-05-29 19:05:52] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2024-05-29 19:05:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/673 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:06:04] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:06:04] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:06:04] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:06:04] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:06:04] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:06:04] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:06:04] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:06:04] [INFO ] Deduced a trap composed of 22 places in 182 ms of which 4 ms to minimize.
[2024-05-29 19:06:04] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:06:05] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:06:05] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:06:05] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:06:05] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:06:05] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:06:05] [INFO ] Deduced a trap composed of 28 places in 151 ms of which 4 ms to minimize.
[2024-05-29 19:06:05] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:06:05] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:06:05] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:06:06] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:06:06] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/673 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:06:07] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:06:08] [INFO ] Deduced a trap composed of 24 places in 138 ms of which 3 ms to minimize.
[2024-05-29 19:06:08] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:06:08] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:06:08] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:06:08] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:06:08] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:06:08] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:06:09] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 3 ms to minimize.
[2024-05-29 19:06:09] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:06:09] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:06:09] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:06:09] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:06:09] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:06:09] [INFO ] Deduced a trap composed of 22 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:06:09] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:06:10] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 2 ms to minimize.
[2024-05-29 19:06:10] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:06:10] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/673 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:06:18] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:06:18] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:06:19] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:06:19] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:06:19] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:06:19] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:06:19] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
[2024-05-29 19:06:19] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:06:19] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:06:19] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:06:19] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:06:20] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:06:20] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:06:20] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:06:20] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:06:20] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:06:20] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:06:20] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:06:20] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:06:21] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/673 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 673/1276 variables, and 171 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/673 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/673 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/673 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:06:29] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:06:30] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:06:31] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:06:32] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:06:32] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 26 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:06:33] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:06:34] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/673 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:06:38] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/673 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:06:44] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-29 19:06:44] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/673 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:06:51] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:06:51] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 673/1276 variables, and 196 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/673 constraints, PredecessorRefiner: 0/602 constraints, Known Traps: 85/85 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 673/695 places, 603/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60746 ms. Remains : 673/695 places, 603/625 transitions.
[2024-05-29 19:06:52] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:06:52] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:06:53] [INFO ] Input system was already deterministic with 603 transitions.
[2024-05-29 19:06:53] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:06:53] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:06:53] [INFO ] Time to serialize gal into /tmp/CTLFireability15016256315700013882.gal : 4 ms
[2024-05-29 19:06:53] [INFO ] Time to serialize properties into /tmp/CTLFireability7905162232110451740.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/CTLFireability15016256315700013882.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7905162232110451740.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:07:23] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:07:23] [INFO ] Applying decomposition
[2024-05-29 19:07:23] [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/graph1367876116295724515.txt' '-o' '/tmp/graph1367876116295724515.bin' '-w' '/tmp/graph1367876116295724515.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1367876116295724515.bin' '-l' '-1' '-v' '-w' '/tmp/graph1367876116295724515.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:07:23] [INFO ] Decomposing Gal with order
[2024-05-29 19:07:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:07:23] [INFO ] Removed a total of 100 redundant transitions.
[2024-05-29 19:07:23] [INFO ] Flatten gal took : 23 ms
[2024-05-29 19:07:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 19:07:23] [INFO ] Time to serialize gal into /tmp/CTLFireability2579930024843682211.gal : 6 ms
[2024-05-29 19:07:23] [INFO ] Time to serialize properties into /tmp/CTLFireability12091696848406004100.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/CTLFireability2579930024843682211.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12091696848406004100.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 : 695/695 places, 625/625 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 675 transition count 605
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 675 transition count 605
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 674 transition count 604
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 674 transition count 604
Applied a total of 42 rules in 37 ms. Remains 674 /695 variables (removed 21) and now considering 604/625 (removed 21) transitions.
// Phase 1: matrix 604 rows 674 cols
[2024-05-29 19:07:53] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 19:07:53] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-29 19:07:53] [INFO ] Invariant cache hit.
[2024-05-29 19:07:53] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2024-05-29 19:07:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/673 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/674 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:08:04] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:08:05] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:08:05] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:08:05] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2024-05-29 19:08:05] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:08:05] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-29 19:08:05] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:08:05] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 4 ms to minimize.
[2024-05-29 19:08:05] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:08:05] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:08:05] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:08:06] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:08:06] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:08:06] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 4 ms to minimize.
[2024-05-29 19:08:06] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:08:06] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:08:06] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:08:06] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:08:07] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:08:07] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/674 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:08:07] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:08:09] [INFO ] Deduced a trap composed of 28 places in 135 ms of which 3 ms to minimize.
[2024-05-29 19:08:09] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:08:09] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:08:09] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:08:09] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:08:09] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:08:09] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:08:10] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2024-05-29 19:08:10] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:08:10] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:08:10] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:08:10] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:08:10] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:08:10] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:08:10] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 3 ms to minimize.
[2024-05-29 19:08:11] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:08:11] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:08:11] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:08:11] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/674 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:08:19] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:08:19] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:08:19] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:08:20] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 2 ms to minimize.
[2024-05-29 19:08:20] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:08:20] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:08:20] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:08:20] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:08:20] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:08:20] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:08:21] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 2 ms to minimize.
[2024-05-29 19:08:21] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:08:21] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:08:21] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:08:21] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:08:21] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:08:21] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 3 ms to minimize.
[2024-05-29 19:08:21] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:08:21] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:08:21] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/674 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 603 unsolved
(s122 1.0timeout
^^^^^^^^^^
(error "Invalid token: 1.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/1278 variables, and 171 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/674 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/673 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/674 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/674 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:08:32] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:08:33] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:08:34] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:08:35] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:08:35] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:08:35] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:08:35] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/674 variables, 15/186 constraints. Problems are: Problem set: 0 solved, 603 unsolved
[2024-05-29 19:08:40] [INFO ] Deduced a trap composed of 24 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:08:41] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/674 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 6 (OVERLAPS) 604/1278 variables, 674/862 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1278 variables, 603/1465 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1278/1278 variables, and 1465 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 674/674 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 77/77 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 674/695 places, 604/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60729 ms. Remains : 674/695 places, 604/625 transitions.
[2024-05-29 19:08:54] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:08:54] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:08:54] [INFO ] Input system was already deterministic with 604 transitions.
[2024-05-29 19:08:54] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:08:54] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:08:54] [INFO ] Time to serialize gal into /tmp/CTLFireability15411221279358858776.gal : 3 ms
[2024-05-29 19:08:54] [INFO ] Time to serialize properties into /tmp/CTLFireability1782820765907189715.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/CTLFireability15411221279358858776.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1782820765907189715.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:09:24] [INFO ] Flatten gal took : 12 ms
[2024-05-29 19:09:24] [INFO ] Applying decomposition
[2024-05-29 19:09:24] [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/graph4974773862684440082.txt' '-o' '/tmp/graph4974773862684440082.bin' '-w' '/tmp/graph4974773862684440082.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4974773862684440082.bin' '-l' '-1' '-v' '-w' '/tmp/graph4974773862684440082.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:09:24] [INFO ] Decomposing Gal with order
[2024-05-29 19:09:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:09:24] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-29 19:09:24] [INFO ] Flatten gal took : 21 ms
[2024-05-29 19:09:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 19:09:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5272626501634424417.gal : 7 ms
[2024-05-29 19:09:24] [INFO ] Time to serialize properties into /tmp/CTLFireability8639658121509325944.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/CTLFireability5272626501634424417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8639658121509325944.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 : 695/695 places, 625/625 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 673 transition count 603
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 673 transition count 603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 672 transition count 602
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 672 transition count 602
Applied a total of 46 rules in 30 ms. Remains 672 /695 variables (removed 23) and now considering 602/625 (removed 23) transitions.
// Phase 1: matrix 602 rows 672 cols
[2024-05-29 19:09:54] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 19:09:54] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-29 19:09:54] [INFO ] Invariant cache hit.
[2024-05-29 19:09:55] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-29 19:09:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:10:06] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:10:06] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:10:06] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:10:06] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:10:06] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:10:06] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:10:06] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:10:07] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 3 ms to minimize.
[2024-05-29 19:10:07] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:10:07] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:10:07] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:10:07] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:10:07] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:10:07] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:10:07] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:10:07] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 3 ms to minimize.
[2024-05-29 19:10:08] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:10:08] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:10:08] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:10:08] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:10:08] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:10:09] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:10:10] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:10:10] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 3 ms to minimize.
[2024-05-29 19:10:10] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:10:10] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:10:10] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:10:10] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:10:10] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:10:10] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:10:11] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
[2024-05-29 19:10:11] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:10:11] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:10:11] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:10:11] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:10:11] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:10:11] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:10:11] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-29 19:10:12] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:10:12] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:10:20] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 3 ms to minimize.
[2024-05-29 19:10:20] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:10:20] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:10:20] [INFO ] Deduced a trap composed of 24 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:10:20] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:10:20] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
[2024-05-29 19:10:20] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:10:21] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:10:21] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:10:21] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:10:21] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:10:21] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:10:21] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:10:21] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:10:21] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:10:21] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:10:22] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:10:22] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:10:22] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:10:22] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 601 unsolved
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 672/1274 variables, and 171 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:10:32] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:10:33] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:10:34] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:10:34] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:10:34] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:10:35] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:10:36] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:10:36] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 15/186 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:10:40] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:10:41] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:10:41] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 6 (OVERLAPS) 602/1274 variables, 672/861 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1274 variables, 601/1462 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:10:54] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1274/1274 variables, and 1463 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 672/672 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 79/79 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 672/695 places, 602/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60684 ms. Remains : 672/695 places, 602/625 transitions.
[2024-05-29 19:10:55] [INFO ] Flatten gal took : 19 ms
[2024-05-29 19:10:55] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:10:55] [INFO ] Input system was already deterministic with 602 transitions.
[2024-05-29 19:10:55] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:10:55] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:10:55] [INFO ] Time to serialize gal into /tmp/CTLFireability10643095974967253669.gal : 2 ms
[2024-05-29 19:10:55] [INFO ] Time to serialize properties into /tmp/CTLFireability4608423408045305317.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/CTLFireability10643095974967253669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4608423408045305317.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:11:25] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:11:25] [INFO ] Applying decomposition
[2024-05-29 19:11:25] [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/graph6587564000775847377.txt' '-o' '/tmp/graph6587564000775847377.bin' '-w' '/tmp/graph6587564000775847377.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6587564000775847377.bin' '-l' '-1' '-v' '-w' '/tmp/graph6587564000775847377.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:11:25] [INFO ] Decomposing Gal with order
[2024-05-29 19:11:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:11:25] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-29 19:11:25] [INFO ] Flatten gal took : 31 ms
[2024-05-29 19:11:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 19:11:25] [INFO ] Time to serialize gal into /tmp/CTLFireability9129228578968398369.gal : 4 ms
[2024-05-29 19:11:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6570698220888736784.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/CTLFireability9129228578968398369.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6570698220888736784.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 : 695/695 places, 625/625 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 148 transitions
Trivial Post-agglo rules discarded 148 transitions
Performed 148 trivial Post agglomeration. Transition count delta: 148
Iterating post reduction 0 with 148 rules applied. Total rules applied 148 place count 694 transition count 476
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 150 rules applied. Total rules applied 298 place count 546 transition count 474
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 299 place count 545 transition count 474
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 299 place count 545 transition count 406
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 435 place count 477 transition count 406
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 453 place count 459 transition count 388
Iterating global reduction 3 with 18 rules applied. Total rules applied 471 place count 459 transition count 388
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 471 place count 459 transition count 375
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 497 place count 446 transition count 375
Performed 152 Post agglomeration using F-continuation condition.Transition count delta: 152
Deduced a syphon composed of 152 places in 0 ms
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 3 with 304 rules applied. Total rules applied 801 place count 294 transition count 223
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 803 place count 292 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 804 place count 291 transition count 221
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 804 place count 291 transition count 219
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 808 place count 289 transition count 219
Applied a total of 808 rules in 55 ms. Remains 289 /695 variables (removed 406) and now considering 219/625 (removed 406) transitions.
// Phase 1: matrix 219 rows 289 cols
[2024-05-29 19:11:55] [INFO ] Computed 110 invariants in 2 ms
[2024-05-29 19:11:55] [INFO ] Implicit Places using invariants in 122 ms returned [269, 273]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 129 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 287/695 places, 219/625 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 285 transition count 217
Applied a total of 4 rules in 9 ms. Remains 285 /287 variables (removed 2) and now considering 217/219 (removed 2) transitions.
// Phase 1: matrix 217 rows 285 cols
[2024-05-29 19:11:55] [INFO ] Computed 108 invariants in 1 ms
[2024-05-29 19:11:55] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-29 19:11:55] [INFO ] Invariant cache hit.
[2024-05-29 19:11:55] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 285/695 places, 217/625 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 522 ms. Remains : 285/695 places, 217/625 transitions.
[2024-05-29 19:11:55] [INFO ] Flatten gal took : 6 ms
[2024-05-29 19:11:56] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:11:56] [INFO ] Input system was already deterministic with 217 transitions.
[2024-05-29 19:11:56] [INFO ] Flatten gal took : 4 ms
[2024-05-29 19:11:56] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:11:56] [INFO ] Time to serialize gal into /tmp/CTLFireability8100259634375819740.gal : 1 ms
[2024-05-29 19:11:56] [INFO ] Time to serialize properties into /tmp/CTLFireability9276362409607650592.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/CTLFireability8100259634375819740.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9276362409607650592.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.11071e+42,0.645496,29176,2,517,5,102147,6,0,1360,175064,0


Converting to forward existential form...Done !
original formula: E((p444==1) U !(AF(((p188==1)&&(p208==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,(p444==1)),!(((p188==1)&&(p208==1))))] != FALSE
Hit Full ! (commute/partial/dont) 215/0/2
Hit Full ! (commute/partial/dont) 213/0/4
(forward)formula 0,1,1.65702,53528,1,0,11,240172,27,4,6601,298602,11
FORMULA ShieldPPPt-PT-010B-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 674 transition count 604
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 674 transition count 604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 673 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 673 transition count 603
Applied a total of 44 rules in 42 ms. Remains 673 /695 variables (removed 22) and now considering 603/625 (removed 22) transitions.
// Phase 1: matrix 603 rows 673 cols
[2024-05-29 19:11:57] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 19:11:57] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-29 19:11:57] [INFO ] Invariant cache hit.
[2024-05-29 19:11:58] [INFO ] Implicit Places using invariants and state equation in 421 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2024-05-29 19:11:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/673 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:12:09] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:12:09] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:12:09] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:12:09] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:12:09] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:12:09] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:12:10] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:12:10] [INFO ] Deduced a trap composed of 33 places in 174 ms of which 4 ms to minimize.
[2024-05-29 19:12:10] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:12:10] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:12:10] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:12:10] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:12:10] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:12:11] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:12:11] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:12:11] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 3 ms to minimize.
[2024-05-29 19:12:11] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:12:11] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:12:11] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:12:11] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/673 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:12:12] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:12:13] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
[2024-05-29 19:12:13] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:12:13] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:12:13] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2024-05-29 19:12:13] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:12:14] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:12:14] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:12:14] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:12:14] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:12:14] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:12:14] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:12:14] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:12:14] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:12:14] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 3 ms to minimize.
[2024-05-29 19:12:14] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:12:14] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:12:15] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:12:15] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:12:15] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/673 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:12:23] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:12:23] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:12:23] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:12:23] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-29 19:12:23] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:12:23] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:12:23] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:12:23] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:12:24] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:12:24] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 2 ms to minimize.
[2024-05-29 19:12:24] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:12:24] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:12:24] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:12:24] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:12:24] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:12:24] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:12:25] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:12:25] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:12:25] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:12:25] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/673 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:12:27] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:12:27] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 673/1276 variables, and 173 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/673 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/673 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/673 variables, 62/173 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:12:36] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:12:37] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:12:37] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:12:37] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:12:38] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:12:38] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:12:38] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:12:38] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:12:38] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:12:38] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:12:38] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:12:38] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:12:39] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:12:39] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:12:39] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:12:39] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:12:39] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:12:39] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:12:39] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/673 variables, 19/192 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:12:42] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/673 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/673 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 6 (OVERLAPS) 603/1276 variables, 673/866 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1276 variables, 602/1468 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:12:57] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1276/1276 variables, and 1469 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 673/673 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 83/83 constraints]
After SMT, in 60096ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 673/695 places, 603/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60768 ms. Remains : 673/695 places, 603/625 transitions.
[2024-05-29 19:12:58] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:12:58] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:12:58] [INFO ] Input system was already deterministic with 603 transitions.
[2024-05-29 19:12:58] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:12:58] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:12:58] [INFO ] Time to serialize gal into /tmp/CTLFireability17187360443970539449.gal : 2 ms
[2024-05-29 19:12:58] [INFO ] Time to serialize properties into /tmp/CTLFireability14901444922042677815.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/CTLFireability17187360443970539449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14901444922042677815.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:13:28] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:13:28] [INFO ] Applying decomposition
[2024-05-29 19:13:28] [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/graph13730556953656166066.txt' '-o' '/tmp/graph13730556953656166066.bin' '-w' '/tmp/graph13730556953656166066.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13730556953656166066.bin' '-l' '-1' '-v' '-w' '/tmp/graph13730556953656166066.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:13:28] [INFO ] Decomposing Gal with order
[2024-05-29 19:13:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:13:28] [INFO ] Removed a total of 98 redundant transitions.
[2024-05-29 19:13:28] [INFO ] Flatten gal took : 22 ms
[2024-05-29 19:13:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 19:13:28] [INFO ] Time to serialize gal into /tmp/CTLFireability14852691850582537848.gal : 5 ms
[2024-05-29 19:13:28] [INFO ] Time to serialize properties into /tmp/CTLFireability903517392131676004.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/CTLFireability14852691850582537848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability903517392131676004.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 : 695/695 places, 625/625 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 146 rules applied. Total rules applied 146 place count 694 transition count 478
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 148 rules applied. Total rules applied 294 place count 548 transition count 476
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 296 place count 547 transition count 475
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 297 place count 546 transition count 475
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 68 Pre rules applied. Total rules applied 297 place count 546 transition count 407
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 433 place count 478 transition count 407
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 452 place count 459 transition count 388
Iterating global reduction 4 with 19 rules applied. Total rules applied 471 place count 459 transition count 388
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 471 place count 459 transition count 375
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 497 place count 446 transition count 375
Performed 151 Post agglomeration using F-continuation condition.Transition count delta: 151
Deduced a syphon composed of 151 places in 0 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 4 with 302 rules applied. Total rules applied 799 place count 295 transition count 224
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 801 place count 293 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 802 place count 292 transition count 222
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 802 place count 292 transition count 220
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 806 place count 290 transition count 220
Applied a total of 806 rules in 60 ms. Remains 290 /695 variables (removed 405) and now considering 220/625 (removed 405) transitions.
// Phase 1: matrix 220 rows 290 cols
[2024-05-29 19:13:58] [INFO ] Computed 110 invariants in 0 ms
[2024-05-29 19:13:58] [INFO ] Implicit Places using invariants in 130 ms returned [270, 274]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 133 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 288/695 places, 220/625 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 286 transition count 218
Applied a total of 4 rules in 7 ms. Remains 286 /288 variables (removed 2) and now considering 218/220 (removed 2) transitions.
// Phase 1: matrix 218 rows 286 cols
[2024-05-29 19:13:58] [INFO ] Computed 108 invariants in 1 ms
[2024-05-29 19:13:59] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-29 19:13:59] [INFO ] Invariant cache hit.
[2024-05-29 19:13:59] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 286/695 places, 218/625 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 530 ms. Remains : 286/695 places, 218/625 transitions.
[2024-05-29 19:13:59] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:13:59] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:13:59] [INFO ] Input system was already deterministic with 218 transitions.
[2024-05-29 19:13:59] [INFO ] Flatten gal took : 5 ms
[2024-05-29 19:13:59] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:13:59] [INFO ] Time to serialize gal into /tmp/CTLFireability12500220461055465011.gal : 1 ms
[2024-05-29 19:13:59] [INFO ] Time to serialize properties into /tmp/CTLFireability3672356367304729489.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/CTLFireability12500220461055465011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3672356367304729489.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.81427e+42,0.642378,29096,2,519,5,101733,6,0,1365,173575,0


Converting to forward existential form...Done !
original formula: EG(((p381==1) + EG(AF((((p267==0)||(p319==0))||(p371==0))))))
=> equivalent forward existential formula: [FwdG(Init,((p381==1) + EG(!(EG(!((((p267==0)||(p319==0))||(p371==0))))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 19:14:29] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:14:29] [INFO ] Applying decomposition
[2024-05-29 19:14:29] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6959245056687592416.txt' '-o' '/tmp/graph6959245056687592416.bin' '-w' '/tmp/graph6959245056687592416.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6959245056687592416.bin' '-l' '-1' '-v' '-w' '/tmp/graph6959245056687592416.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:14:29] [INFO ] Decomposing Gal with order
[2024-05-29 19:14:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:14:29] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-29 19:14:29] [INFO ] Flatten gal took : 8 ms
[2024-05-29 19:14:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-29 19:14:29] [INFO ] Time to serialize gal into /tmp/CTLFireability6082480310843607727.gal : 2 ms
[2024-05-29 19:14:29] [INFO ] Time to serialize properties into /tmp/CTLFireability6769784613299386881.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/CTLFireability6082480310843607727.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6769784613299386881.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.81427e+42,0.216154,13912,70,18,21877,156,475,46816,53,803,0


Converting to forward existential form...Done !
original formula: EG(((i7.i0.u40.p381==1) + EG(AF((((i6.i0.u27.p267==0)||(i7.i1.u33.p319==0))||(i8.i0.u39.p371==0))))))
=> equivalent forward existential formula: [FwdG(Init,((i7.i0.u40.p381==1) + EG(!(EG(!((((i6.i0.u27.p267==0)||(i7.i1.u33.p319==0))||(i8.i0.u39.p371==0)))))...168
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 695/695 places, 625/625 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 674 transition count 604
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 674 transition count 604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 673 transition count 603
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 673 transition count 603
Applied a total of 44 rules in 27 ms. Remains 673 /695 variables (removed 22) and now considering 603/625 (removed 22) transitions.
// Phase 1: matrix 603 rows 673 cols
[2024-05-29 19:14:59] [INFO ] Computed 111 invariants in 6 ms
[2024-05-29 19:14:59] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-29 19:14:59] [INFO ] Invariant cache hit.
[2024-05-29 19:15:00] [INFO ] Implicit Places using invariants and state equation in 438 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
Running 602 sub problems to find dead transitions.
[2024-05-29 19:15:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/673 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:15:11] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:15:11] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:15:11] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:15:11] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:15:11] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:15:11] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:15:12] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:15:12] [INFO ] Deduced a trap composed of 22 places in 174 ms of which 3 ms to minimize.
[2024-05-29 19:15:12] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:15:12] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:15:12] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:15:12] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:15:12] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:15:12] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:15:13] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:15:13] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 4 ms to minimize.
[2024-05-29 19:15:13] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:15:13] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:15:13] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:15:13] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/673 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:15:14] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:15:15] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:15:15] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:15:15] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 3 ms to minimize.
[2024-05-29 19:15:15] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:15:15] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:15:15] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:15:16] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:15:16] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:15:16] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-05-29 19:15:16] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:15:16] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:15:16] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:15:16] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:15:17] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-05-29 19:15:17] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:15:17] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:15:17] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:15:17] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-29 19:15:17] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/673 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:15:25] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:15:26] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 3 ms to minimize.
[2024-05-29 19:15:26] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 3 ms to minimize.
[2024-05-29 19:15:26] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:15:26] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:15:26] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:15:26] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:15:26] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:15:26] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:15:26] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-29 19:15:27] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:15:27] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:15:27] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:15:27] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:15:27] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:15:27] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:15:27] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-05-29 19:15:27] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:15:27] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:15:28] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/673 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 602 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 1.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 1.0)
(s175 0.0)
(s176 1.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 1.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 1.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 1.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 1.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 1.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 1.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 1.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 1.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 1.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 1.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 1.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 1.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 1.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 1.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 0.0)
(s368 1.0)
(s369 1.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 1.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 1.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 1.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 1.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 1.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 1.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 1.0)
(s433 0.0)
(s434 1.0)
(s435 1.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 1.0)
(s456 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 673/1276 variables, and 171 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/673 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/672 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 1 (OVERLAPS) 1/673 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/673 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:15:38] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:15:39] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:15:39] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:15:39] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:15:39] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:15:40] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:15:40] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2024-05-29 19:15:40] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:15:40] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:15:40] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:15:40] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:15:40] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:15:40] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:15:41] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:15:41] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:15:41] [INFO ] Deduced a trap composed of 28 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:15:41] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:15:41] [INFO ] Deduced a trap composed of 31 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/673 variables, 18/189 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:15:46] [INFO ] Deduced a trap composed of 25 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:15:47] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/673 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/673 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 6 (OVERLAPS) 603/1276 variables, 673/864 constraints. Problems are: Problem set: 0 solved, 602 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1276 variables, 602/1466 constraints. Problems are: Problem set: 0 solved, 602 unsolved
[2024-05-29 19:15:59] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:15:59] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:15:59] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:15:59] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:15:59] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:16:00] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1276/1276 variables, and 1472 constraints, problems are : Problem set: 0 solved, 602 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 673/673 constraints, PredecessorRefiner: 602/602 constraints, Known Traps: 86/86 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 602 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 673/695 places, 603/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60747 ms. Remains : 673/695 places, 603/625 transitions.
[2024-05-29 19:16:00] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:16:00] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:16:00] [INFO ] Input system was already deterministic with 603 transitions.
[2024-05-29 19:16:00] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:16:00] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:16:00] [INFO ] Time to serialize gal into /tmp/CTLFireability9733891375715239813.gal : 2 ms
[2024-05-29 19:16:00] [INFO ] Time to serialize properties into /tmp/CTLFireability7978703900075315336.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/CTLFireability9733891375715239813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7978703900075315336.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-29 19:16:30] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:16:30] [INFO ] Applying decomposition
[2024-05-29 19:16:30] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15132262547561241901.txt' '-o' '/tmp/graph15132262547561241901.bin' '-w' '/tmp/graph15132262547561241901.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15132262547561241901.bin' '-l' '-1' '-v' '-w' '/tmp/graph15132262547561241901.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:16:30] [INFO ] Decomposing Gal with order
[2024-05-29 19:16:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:16:30] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-29 19:16:30] [INFO ] Flatten gal took : 48 ms
[2024-05-29 19:16:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 19:16:30] [INFO ] Time to serialize gal into /tmp/CTLFireability3891733322563999256.gal : 4 ms
[2024-05-29 19:16:30] [INFO ] Time to serialize properties into /tmp/CTLFireability13997331906897696929.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/CTLFireability3891733322563999256.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13997331906897696929.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 : 695/695 places, 625/625 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 673 transition count 603
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 673 transition count 603
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 672 transition count 602
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 672 transition count 602
Applied a total of 46 rules in 36 ms. Remains 672 /695 variables (removed 23) and now considering 602/625 (removed 23) transitions.
// Phase 1: matrix 602 rows 672 cols
[2024-05-29 19:17:00] [INFO ] Computed 111 invariants in 5 ms
[2024-05-29 19:17:00] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-29 19:17:00] [INFO ] Invariant cache hit.
[2024-05-29 19:17:01] [INFO ] Implicit Places using invariants and state equation in 374 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-29 19:17:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:17:12] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 19:17:12] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:17:12] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:17:12] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 1 ms to minimize.
[2024-05-29 19:17:12] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:17:12] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:17:12] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:17:13] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 4 ms to minimize.
[2024-05-29 19:17:13] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:17:13] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:17:13] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:17:13] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:17:13] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:17:14] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 3 ms to minimize.
[2024-05-29 19:17:14] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:17:14] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:17:14] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:17:14] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:17:14] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:17:14] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:17:16] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:17:16] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 3 ms to minimize.
[2024-05-29 19:17:16] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:17:16] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:17:16] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:17:17] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:17:17] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:17:17] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:17:17] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:17:17] [INFO ] Deduced a trap composed of 34 places in 116 ms of which 3 ms to minimize.
[2024-05-29 19:17:17] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:17:17] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:17:17] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:17:18] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:17:18] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:17:18] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 3 ms to minimize.
[2024-05-29 19:17:18] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:17:18] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:17:18] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:17:18] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:17:26] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:17:26] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:17:26] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:17:27] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:17:27] [INFO ] Deduced a trap composed of 27 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:17:27] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-05-29 19:17:27] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:17:27] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:17:27] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:17:27] [INFO ] Deduced a trap composed of 18 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:17:27] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:17:27] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:17:28] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:17:28] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:17:28] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:17:28] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:17:28] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:17:28] [INFO ] Deduced a trap composed of 25 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:17:28] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:17:29] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:17:29] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:17:31] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 672/1274 variables, and 173 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/672 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/671 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/672 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/672 variables, 62/173 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:17:39] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:17:39] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:17:39] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:17:40] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:17:40] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:17:41] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:17:41] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:17:41] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:17:41] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:17:41] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:17:41] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:17:41] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:17:41] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:17:41] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:17:42] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:17:42] [INFO ] Deduced a trap composed of 25 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:17:42] [INFO ] Deduced a trap composed of 27 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:17:42] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/672 variables, 18/191 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (OVERLAPS) 602/1274 variables, 672/863 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1274 variables, 601/1464 constraints. Problems are: Problem set: 0 solved, 601 unsolved
[2024-05-29 19:17:53] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:17:53] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:17:54] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:17:54] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:17:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:17:55] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 4 ms to minimize.
[2024-05-29 19:17:55] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 4 ms to minimize.
[2024-05-29 19:17:56] [INFO ] Deduced a trap composed of 17 places in 173 ms of which 3 ms to minimize.
[2024-05-29 19:17:56] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 4 ms to minimize.
[2024-05-29 19:17:57] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 4 ms to minimize.
[2024-05-29 19:17:57] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 4 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 4 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 18 places in 171 ms of which 3 ms to minimize.
[2024-05-29 19:17:58] [INFO ] Deduced a trap composed of 25 places in 134 ms of which 3 ms to minimize.
[2024-05-29 19:17:59] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 3 ms to minimize.
[2024-05-29 19:17:59] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 3 ms to minimize.
[2024-05-29 19:17:59] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 3 ms to minimize.
[2024-05-29 19:17:59] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 3 ms to minimize.
[2024-05-29 19:18:00] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 3 ms to minimize.
[2024-05-29 19:18:00] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1274 variables, 20/1484 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1274/1274 variables, and 1484 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 672/672 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 100/100 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 672/695 places, 602/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60687 ms. Remains : 672/695 places, 602/625 transitions.
[2024-05-29 19:18:01] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:18:01] [INFO ] Flatten gal took : 15 ms
[2024-05-29 19:18:01] [INFO ] Input system was already deterministic with 602 transitions.
[2024-05-29 19:18:01] [INFO ] Flatten gal took : 14 ms
[2024-05-29 19:18:01] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:18:01] [INFO ] Time to serialize gal into /tmp/CTLFireability13754954877237402238.gal : 2 ms
[2024-05-29 19:18:01] [INFO ] Time to serialize properties into /tmp/CTLFireability1279497659213000656.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/CTLFireability13754954877237402238.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1279497659213000656.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:18:31] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:18:31] [INFO ] Applying decomposition
[2024-05-29 19:18:31] [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/graph1449582261246432422.txt' '-o' '/tmp/graph1449582261246432422.bin' '-w' '/tmp/graph1449582261246432422.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1449582261246432422.bin' '-l' '-1' '-v' '-w' '/tmp/graph1449582261246432422.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:18:31] [INFO ] Decomposing Gal with order
[2024-05-29 19:18:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:18:31] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-29 19:18:31] [INFO ] Flatten gal took : 19 ms
[2024-05-29 19:18:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 19:18:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15891587121832091504.gal : 5 ms
[2024-05-29 19:18:31] [INFO ] Time to serialize properties into /tmp/CTLFireability10896809607246151706.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/CTLFireability15891587121832091504.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10896809607246151706.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 : 695/695 places, 625/625 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 677 transition count 607
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 677 transition count 607
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 676 transition count 606
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 676 transition count 606
Applied a total of 38 rules in 36 ms. Remains 676 /695 variables (removed 19) and now considering 606/625 (removed 19) transitions.
// Phase 1: matrix 606 rows 676 cols
[2024-05-29 19:19:01] [INFO ] Computed 111 invariants in 4 ms
[2024-05-29 19:19:01] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-29 19:19:01] [INFO ] Invariant cache hit.
[2024-05-29 19:19:02] [INFO ] Implicit Places using invariants and state equation in 392 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2024-05-29 19:19:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/676 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:19:13] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:19:13] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:19:13] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-29 19:19:13] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:19:14] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:19:14] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:19:14] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 5 ms to minimize.
[2024-05-29 19:19:14] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 3 ms to minimize.
[2024-05-29 19:19:14] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:19:14] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:19:14] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:19:14] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:19:15] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:19:15] [INFO ] Deduced a trap composed of 23 places in 174 ms of which 4 ms to minimize.
[2024-05-29 19:19:15] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:19:15] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:19:15] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:19:15] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:19:15] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:19:16] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/676 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:19:16] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:19:17] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:19:18] [INFO ] Deduced a trap composed of 18 places in 129 ms of which 3 ms to minimize.
[2024-05-29 19:19:18] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:19:18] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:19:18] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-29 19:19:18] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:19:18] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:19:18] [INFO ] Deduced a trap composed of 21 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:19:18] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:19:19] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-29 19:19:19] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:19:19] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:19:19] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:19:19] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:19:19] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:19:19] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:19:19] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:19:19] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:19:19] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/676 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:19:26] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:19:27] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:19:28] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:19:28] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:19:28] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:19:28] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:19:28] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:19:28] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:19:29] [INFO ] Deduced a trap composed of 34 places in 85 ms of which 2 ms to minimize.
[2024-05-29 19:19:29] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:19:29] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:19:29] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:19:29] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:19:29] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:19:29] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:19:29] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:19:29] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:19:30] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:19:30] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:19:30] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/676 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.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 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.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 1.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 1.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 1.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 1.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 1.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.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 1.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 1.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 1.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 1.0)
(s229 0.0)
(s230 1.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 1.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 1.0)
(s243 0.0)
(s244 1.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 1.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 1.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 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 1.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 1.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 1.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 1.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 1.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 1.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 1.0)
(s363 0.0)
(s364 1.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 1.0)
(s370 0.0)
(s371 1.0)
(s372 1.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 1.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 1.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/1282 variables, and 171 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/676 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/676 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/676 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:19:39] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:19:40] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:19:40] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:19:40] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:19:40] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:19:41] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:19:41] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:19:41] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-05-29 19:19:42] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:19:42] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:19:42] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:19:42] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:19:42] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:19:42] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:19:42] [INFO ] Deduced a trap composed of 29 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:19:42] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-29 19:19:42] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:19:43] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:19:43] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:19:43] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/676 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:19:46] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:19:46] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:19:47] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:19:47] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:19:47] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:19:47] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:19:48] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:19:48] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:19:48] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:19:48] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:19:48] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:19:48] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:19:48] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:19:49] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/676 variables, 14/205 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:19:53] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:19:56] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:19:56] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/676 variables, 3/208 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:20:01] [INFO ] Deduced a trap composed of 26 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:20:01] [INFO ] Deduced a trap composed of 26 places in 21 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/1282 variables, and 210 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/676 constraints, PredecessorRefiner: 0/605 constraints, Known Traps: 99/99 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in LTL mode, iteration 1 : 676/695 places, 606/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60699 ms. Remains : 676/695 places, 606/625 transitions.
[2024-05-29 19:20:02] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:20:02] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:20:02] [INFO ] Input system was already deterministic with 606 transitions.
[2024-05-29 19:20:02] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:20:02] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:20:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9776651452220505451.gal : 2 ms
[2024-05-29 19:20:02] [INFO ] Time to serialize properties into /tmp/CTLFireability445541172963721028.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/CTLFireability9776651452220505451.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability445541172963721028.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:20:32] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:20:32] [INFO ] Applying decomposition
[2024-05-29 19:20:32] [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/graph11168490022320060609.txt' '-o' '/tmp/graph11168490022320060609.bin' '-w' '/tmp/graph11168490022320060609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11168490022320060609.bin' '-l' '-1' '-v' '-w' '/tmp/graph11168490022320060609.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:20:32] [INFO ] Decomposing Gal with order
[2024-05-29 19:20:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:20:32] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-29 19:20:32] [INFO ] Flatten gal took : 20 ms
[2024-05-29 19:20:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 19:20:32] [INFO ] Time to serialize gal into /tmp/CTLFireability6705699835421112636.gal : 4 ms
[2024-05-29 19:20:32] [INFO ] Time to serialize properties into /tmp/CTLFireability18139140674474720378.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/CTLFireability6705699835421112636.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18139140674474720378.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 : 695/695 places, 625/625 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 672 transition count 602
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 672 transition count 602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 671 transition count 601
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 671 transition count 601
Applied a total of 48 rules in 40 ms. Remains 671 /695 variables (removed 24) and now considering 601/625 (removed 24) transitions.
// Phase 1: matrix 601 rows 671 cols
[2024-05-29 19:21:02] [INFO ] Computed 111 invariants in 4 ms
[2024-05-29 19:21:02] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-05-29 19:21:02] [INFO ] Invariant cache hit.
[2024-05-29 19:21:03] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-29 19:21:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:21:14] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:21:14] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:21:14] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:21:14] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:21:14] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:21:14] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:21:14] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:21:14] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:21:15] [INFO ] Deduced a trap composed of 21 places in 171 ms of which 4 ms to minimize.
[2024-05-29 19:21:15] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:21:15] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:21:15] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:21:15] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:21:15] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:21:15] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-29 19:21:15] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:21:16] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 4 ms to minimize.
[2024-05-29 19:21:16] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:21:16] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:21:16] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:21:17] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:21:17] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 3 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:21:18] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:21:19] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 3 ms to minimize.
[2024-05-29 19:21:19] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:21:19] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:21:19] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:21:19] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-05-29 19:21:19] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:21:19] [INFO ] Deduced a trap composed of 26 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:21:20] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-05-29 19:21:20] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:21:20] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:21:28] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:21:28] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:21:28] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:21:28] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:21:28] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:21:29] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-29 19:21:29] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:21:29] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:21:29] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:21:29] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:21:29] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:21:29] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:21:29] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:21:29] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:21:29] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:21:30] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:21:30] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:21:30] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:21:30] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-29 19:21:30] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:21:33] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/1272 variables, and 172 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 61/61 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/671 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/671 variables, 61/172 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:21:39] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-29 19:21:42] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:21:43] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:21:43] [INFO ] Deduced a trap composed of 30 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:21:43] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-29 19:21:43] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:21:43] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:21:43] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-29 19:21:43] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
[2024-05-29 19:21:43] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:21:43] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:21:44] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:21:44] [INFO ] Deduced a trap composed of 25 places in 18 ms of which 1 ms to minimize.
[2024-05-29 19:21:44] [INFO ] Deduced a trap composed of 27 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:21:44] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/671 variables, 15/187 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:21:49] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:21:49] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:21:49] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:21:50] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/671 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/671 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 6 (OVERLAPS) 601/1272 variables, 671/862 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1272 variables, 600/1462 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-05-29 19:22:01] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:22:02] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:22:03] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1272/1272 variables, and 1465 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 671/671 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 83/83 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 671/695 places, 601/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60733 ms. Remains : 671/695 places, 601/625 transitions.
[2024-05-29 19:22:03] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:22:03] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:22:03] [INFO ] Input system was already deterministic with 601 transitions.
[2024-05-29 19:22:03] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:22:03] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:22:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4112966643087211416.gal : 7 ms
[2024-05-29 19:22:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10735021432809169831.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/CTLFireability4112966643087211416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10735021432809169831.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 19:24:34] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:24:34] [INFO ] Applying decomposition
[2024-05-29 19:24: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/graph2096164789252513237.txt' '-o' '/tmp/graph2096164789252513237.bin' '-w' '/tmp/graph2096164789252513237.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2096164789252513237.bin' '-l' '-1' '-v' '-w' '/tmp/graph2096164789252513237.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:24:34] [INFO ] Decomposing Gal with order
[2024-05-29 19:24:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:24:34] [INFO ] Removed a total of 103 redundant transitions.
[2024-05-29 19:24:34] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:24:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 19:24:34] [INFO ] Time to serialize gal into /tmp/CTLFireability6975649286500300045.gal : 5 ms
[2024-05-29 19:24:34] [INFO ] Time to serialize properties into /tmp/CTLFireability14810181940000959189.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/CTLFireability6975649286500300045.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14810181940000959189.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 : 695/695 places, 625/625 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 677 transition count 607
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 677 transition count 607
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 676 transition count 606
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 676 transition count 606
Applied a total of 38 rules in 26 ms. Remains 676 /695 variables (removed 19) and now considering 606/625 (removed 19) transitions.
// Phase 1: matrix 606 rows 676 cols
[2024-05-29 19:25:04] [INFO ] Computed 111 invariants in 5 ms
[2024-05-29 19:25:04] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-29 19:25:04] [INFO ] Invariant cache hit.
[2024-05-29 19:25:05] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2024-05-29 19:25:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/676 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:25:16] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-29 19:25:16] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:25:16] [INFO ] Deduced a trap composed of 17 places in 20 ms of which 1 ms to minimize.
[2024-05-29 19:25:16] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 0 ms to minimize.
[2024-05-29 19:25:16] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:25:16] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-29 19:25:16] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:25:16] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:25:17] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 3 ms to minimize.
[2024-05-29 19:25:17] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:25:17] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:25:17] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 19:25:17] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:25:17] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:25:18] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 4 ms to minimize.
[2024-05-29 19:25:18] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:25:18] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 19:25:18] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:25:18] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-29 19:25:18] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/676 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:25:19] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:25:19] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:25:20] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-29 19:25:20] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 3 ms to minimize.
[2024-05-29 19:25:20] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:25:20] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:25:20] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:25:20] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:25:20] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 19:25:21] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:25:21] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
[2024-05-29 19:25:21] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:25:21] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:25:21] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:25:21] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:25:21] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:25:22] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:25:22] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-29 19:25:22] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:25:22] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/676 variables, 20/151 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:25:30] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:25:30] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:25:30] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 1 ms to minimize.
[2024-05-29 19:25:31] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-29 19:25:32] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 1 ms to minimize.
[2024-05-29 19:25:32] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
[2024-05-29 19:25:32] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:25:32] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 19:25:32] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 0 ms to minimize.
[2024-05-29 19:25:32] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 0 ms to minimize.
[2024-05-29 19:25:32] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-29 19:25:32] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/676 variables, 20/171 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/1282 variables, and 171 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/676 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/675 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (OVERLAPS) 1/676 variables, 111/111 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/676 variables, 60/171 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:25:43] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-29 19:25:44] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:25:44] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-29 19:25:44] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 0 ms to minimize.
[2024-05-29 19:25:45] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:25:45] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:25:45] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-29 19:25:45] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-29 19:25:45] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 0 ms to minimize.
[2024-05-29 19:25:45] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-29 19:25:45] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-29 19:25:45] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-29 19:25:45] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-29 19:25:45] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 19:25:46] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-29 19:25:46] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 1 ms to minimize.
[2024-05-29 19:25:46] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/676 variables, 17/188 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:25:51] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/676 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:25:57] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 1 ms to minimize.
[2024-05-29 19:25:58] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-29 19:25:58] [INFO ] Deduced a trap composed of 26 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/676 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 605 unsolved
[2024-05-29 19:26:03] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
[2024-05-29 19:26:05] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/1282 variables, and 194 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 111/111 constraints, State Equation: 0/676 constraints, PredecessorRefiner: 0/605 constraints, Known Traps: 83/83 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 676/695 places, 606/625 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60673 ms. Remains : 676/695 places, 606/625 transitions.
[2024-05-29 19:26:05] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:26:05] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:26:05] [INFO ] Input system was already deterministic with 606 transitions.
[2024-05-29 19:26:05] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:26:05] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:26:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6941964109637647565.gal : 2 ms
[2024-05-29 19:26:05] [INFO ] Time to serialize properties into /tmp/CTLFireability9173833999492333268.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/CTLFireability6941964109637647565.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9173833999492333268.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-29 19:26:35] [INFO ] Flatten gal took : 16 ms
[2024-05-29 19:26:35] [INFO ] Applying decomposition
[2024-05-29 19:26: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/graph2627270649943523016.txt' '-o' '/tmp/graph2627270649943523016.bin' '-w' '/tmp/graph2627270649943523016.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2627270649943523016.bin' '-l' '-1' '-v' '-w' '/tmp/graph2627270649943523016.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:26:35] [INFO ] Decomposing Gal with order
[2024-05-29 19:26:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:26:35] [INFO ] Removed a total of 97 redundant transitions.
[2024-05-29 19:26:35] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:26:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 19:26:35] [INFO ] Time to serialize gal into /tmp/CTLFireability2285342715912270117.gal : 4 ms
[2024-05-29 19:26:35] [INFO ] Time to serialize properties into /tmp/CTLFireability12092346083156194918.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/CTLFireability2285342715912270117.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12092346083156194918.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-29 19:27:05] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:27:05] [INFO ] Flatten gal took : 11 ms
[2024-05-29 19:27:05] [INFO ] Applying decomposition
[2024-05-29 19:27:05] [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/graph749627701761650023.txt' '-o' '/tmp/graph749627701761650023.bin' '-w' '/tmp/graph749627701761650023.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph749627701761650023.bin' '-l' '-1' '-v' '-w' '/tmp/graph749627701761650023.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:27:05] [INFO ] Decomposing Gal with order
[2024-05-29 19:27:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:27:05] [INFO ] Removed a total of 86 redundant transitions.
[2024-05-29 19:27:05] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:27:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 19:27:05] [INFO ] Time to serialize gal into /tmp/CTLFireability6034689066402846673.gal : 4 ms
[2024-05-29 19:27:05] [INFO ] Time to serialize properties into /tmp/CTLFireability848536978261546648.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/CTLFireability6034689066402846673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability848536978261546648.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-29 19:42:30] [INFO ] Applying decomposition
[2024-05-29 19:42:30] [INFO ] Flatten gal took : 13 ms
[2024-05-29 19:42:30] [INFO ] Decomposing Gal with order
[2024-05-29 19:42:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:42:30] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-29 19:42:30] [INFO ] Flatten gal took : 18 ms
[2024-05-29 19:42:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 84 labels/synchronizations in 8 ms.
[2024-05-29 19:42:30] [INFO ] Time to serialize gal into /tmp/CTLFireability2587394455341587543.gal : 62 ms
[2024-05-29 19:42:30] [INFO ] Time to serialize properties into /tmp/CTLFireability8184060166897688715.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/CTLFireability2587394455341587543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8184060166897688715.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 15 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-29 19:49:56] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:49:56] [INFO ] Input system was already deterministic with 625 transitions.
[2024-05-29 19:49:56] [INFO ] Transformed 695 places.
[2024-05-29 19:49:56] [INFO ] Transformed 625 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-29 19:49:56] [INFO ] Time to serialize gal into /tmp/CTLFireability106932756365084979.gal : 3 ms
[2024-05-29 19:49:56] [INFO ] Time to serialize properties into /tmp/CTLFireability12234256394302108089.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/CTLFireability106932756365084979.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12234256394302108089.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 15 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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination 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="ShieldPPPt-PT-010B"
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 ShieldPPPt-PT-010B, 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 r356-tall-171683761500618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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