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-171683761400602.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-005B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r356-tall-171683761400602
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.4K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 14:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 14:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 14:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 14:32 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 92K 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-005B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPt-PT-005B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717007018057

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-005B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-29 18:23: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:23:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:23:39] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-29 18:23:39] [INFO ] Transformed 393 places.
[2024-05-29 18:23:39] [INFO ] Transformed 358 transitions.
[2024-05-29 18:23:39] [INFO ] Found NUPN structural information;
[2024-05-29 18:23:39] [INFO ] Parsed PT model containing 393 places and 358 transitions and 896 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 111 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 358/358 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 358 transition count 323
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 358 transition count 323
Applied a total of 70 rules in 73 ms. Remains 358 /393 variables (removed 35) and now considering 323/358 (removed 35) transitions.
// Phase 1: matrix 323 rows 358 cols
[2024-05-29 18:23:39] [INFO ] Computed 56 invariants in 20 ms
[2024-05-29 18:23:39] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-29 18:23:39] [INFO ] Invariant cache hit.
[2024-05-29 18:23:40] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
Running 322 sub problems to find dead transitions.
[2024-05-29 18:23:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 12 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 2 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 2 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:23:44] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:23:45] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-29 18:23:46] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:23:46] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 2 ms to minimize.
[2024-05-29 18:23:46] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:23:46] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:23:46] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:23:46] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:23:46] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:23:46] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 24 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 2 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:23:47] [INFO ] Deduced a trap composed of 28 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-29 18:23:50] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:23:50] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:23:50] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:23:50] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:23:51] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:23:51] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:23:51] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:23:51] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:23:51] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:23:51] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:23:51] [INFO ] Deduced a trap composed of 31 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 11/107 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-29 18:23:53] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:23:53] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:23:53] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 3/110 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (OVERLAPS) 323/681 variables, 358/468 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-29 18:23:58] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:23:59] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:24:00] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 0 ms to minimize.
[2024-05-29 18:24:00] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:24:00] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:24:00] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:24:00] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:24:00] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 8/476 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-29 18:24:02] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:24:03] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-29 18:24:08] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:24:08] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:24:09] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 681/681 variables, and 481 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 322 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 67/123 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-29 18:24:13] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-29 18:24:15] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:24:16] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 6 (OVERLAPS) 323/681 variables, 358/484 constraints. Problems are: Problem set: 0 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/681 variables, 322/806 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-29 18:24:22] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-29 18:24:23] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:24:23] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-29 18:24:23] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2024-05-29 18:24:24] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:24:24] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 2 ms to minimize.
[2024-05-29 18:24:25] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:24:25] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 12 ms to minimize.
[2024-05-29 18:24:25] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:24:25] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:24:26] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:24:26] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:24:26] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-05-29 18:24:27] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 14/820 constraints. Problems are: Problem set: 0 solved, 322 unsolved
[2024-05-29 18:24:33] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:24:34] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:24:34] [INFO ] Deduced a trap composed of 33 places in 83 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/681 variables, 3/823 constraints. Problems are: Problem set: 0 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 681/681 variables, and 823 constraints, problems are : Problem set: 0 solved, 322 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 322/322 constraints, Known Traps: 87/87 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 322 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 358/393 places, 323/358 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60805 ms. Remains : 358/393 places, 323/358 transitions.
Support contains 111 out of 358 places after structural reductions.
[2024-05-29 18:24:40] [INFO ] Flatten gal took : 71 ms
[2024-05-29 18:24:40] [INFO ] Flatten gal took : 39 ms
[2024-05-29 18:24:40] [INFO ] Input system was already deterministic with 323 transitions.
RANDOM walk for 40000 steps (8 resets) in 1531 ms. (26 steps per ms) remains 3/79 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 1/2 properties
BEST_FIRST walk for 4005 steps (0 resets) in 7 ms. (500 steps per ms) remains 0/1 properties
[2024-05-29 18:24:41] [INFO ] Flatten gal took : 22 ms
[2024-05-29 18:24:41] [INFO ] Flatten gal took : 67 ms
[2024-05-29 18:24:41] [INFO ] Input system was already deterministic with 323 transitions.
Computed a total of 88 stabilizing places and 88 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 357 transition count 242
Reduce places removed 80 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 82 rules applied. Total rules applied 162 place count 277 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 163 place count 276 transition count 240
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 163 place count 276 transition count 209
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 225 place count 245 transition count 209
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 238 place count 232 transition count 196
Iterating global reduction 3 with 13 rules applied. Total rules applied 251 place count 232 transition count 196
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 251 place count 232 transition count 189
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 265 place count 225 transition count 189
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 419 place count 148 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 421 place count 146 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 145 transition count 110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 422 place count 145 transition count 108
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 426 place count 143 transition count 108
Applied a total of 426 rules in 130 ms. Remains 143 /358 variables (removed 215) and now considering 108/323 (removed 215) transitions.
// Phase 1: matrix 108 rows 143 cols
[2024-05-29 18:24:41] [INFO ] Computed 55 invariants in 2 ms
[2024-05-29 18:24:42] [INFO ] Implicit Places using invariants in 163 ms returned [123, 127]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 165 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 141/358 places, 108/323 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 139 transition count 106
Applied a total of 4 rules in 8 ms. Remains 139 /141 variables (removed 2) and now considering 106/108 (removed 2) transitions.
// Phase 1: matrix 106 rows 139 cols
[2024-05-29 18:24:42] [INFO ] Computed 53 invariants in 0 ms
[2024-05-29 18:24:42] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-29 18:24:42] [INFO ] Invariant cache hit.
[2024-05-29 18:24:42] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 139/358 places, 106/323 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 852 ms. Remains : 139/358 places, 106/323 transitions.
[2024-05-29 18:24:42] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:24:42] [INFO ] Flatten gal took : 24 ms
[2024-05-29 18:24:42] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-29 18:24:42] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:24:42] [INFO ] Flatten gal took : 20 ms
[2024-05-29 18:24:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16789841326765854308.gal : 3 ms
[2024-05-29 18:24:42] [INFO ] Time to serialize properties into /tmp/CTLFireability16528277010150262628.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16789841326765854308.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16528277010150262628.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.29307e+20,0.545093,26236,2,280,5,97020,6,0,664,156714,0


Converting to forward existential form...Done !
original formula: EF(AG(((p60==1) * AF((p60==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((p60==1) * !(EG(!((p60==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/tota...170
Detected timeout of ITS tools.
[2024-05-29 18:25:12] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:25:12] [INFO ] Applying decomposition
[2024-05-29 18:25:12] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12166582857616258620.txt' '-o' '/tmp/graph12166582857616258620.bin' '-w' '/tmp/graph12166582857616258620.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12166582857616258620.bin' '-l' '-1' '-v' '-w' '/tmp/graph12166582857616258620.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:25:13] [INFO ] Decomposing Gal with order
[2024-05-29 18:25:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:25:13] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-29 18:25:13] [INFO ] Flatten gal took : 87 ms
[2024-05-29 18:25:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 18:25:13] [INFO ] Time to serialize gal into /tmp/CTLFireability1337468995444394550.gal : 4 ms
[2024-05-29 18:25:13] [INFO ] Time to serialize properties into /tmp/CTLFireability2948684388564784205.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/CTLFireability1337468995444394550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2948684388564784205.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,3.29307e+20,0.14099,10048,48,18,12690,117,258,28935,39,717,0


Converting to forward existential form...Done !
original formula: EF(AG(((i3.u6.p60==1) * AF((i3.u6.p60==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((i3.u6.p60==1) * !(EG(!((i3.u6.p60==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions i2.u2.t0, i3.t12, Intersection with reachable at each step enabled. (destroyed/reverse/inter...179
Using saturation style SCC detection
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 338 transition count 303
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 338 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 337 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 337 transition count 302
Applied a total of 42 rules in 22 ms. Remains 337 /358 variables (removed 21) and now considering 302/323 (removed 21) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 18:25:43] [INFO ] Computed 56 invariants in 2 ms
[2024-05-29 18:25:43] [INFO ] Implicit Places using invariants in 420 ms returned []
[2024-05-29 18:25:43] [INFO ] Invariant cache hit.
[2024-05-29 18:25:43] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-29 18:25:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:25:47] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:25:48] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:25:48] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 0 ms to minimize.
[2024-05-29 18:25:48] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:25:48] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:25:48] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:25:48] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:25:48] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:25:48] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:25:48] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:25:49] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-29 18:25:49] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:25:49] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:25:49] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:25:49] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:25:49] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:25:49] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:25:50] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:25:50] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:25:50] [INFO ] Deduced a trap composed of 20 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:25:50] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:25:50] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:25:50] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:25:51] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:25:51] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:25:51] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 4 ms to minimize.
[2024-05-29 18:25:51] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-29 18:25:51] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2024-05-29 18:25:51] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:25:51] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 13/89 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:25:54] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:25:55] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:25:56] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 302/639 variables, 337/429 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:26:01] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
[2024-05-29 18:26:01] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:26:01] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 3/432 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:26:09] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:26:09] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:26:09] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:26:09] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/639 variables, 4/436 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:26:12] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:26:12] [INFO ] Deduced a trap composed of 25 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:26:12] [INFO ] Deduced a trap composed of 31 places in 24 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 301 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 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 1.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 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 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 1.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 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 1.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/639 variables, and 439 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 46/102 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:26:15] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (OVERLAPS) 302/639 variables, 337/440 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 301/741 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:26:20] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:26:20] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:26:21] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:26:21] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:26:22] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-05-29 18:26:22] [INFO ] Deduced a trap composed of 20 places in 133 ms of which 1 ms to minimize.
[2024-05-29 18:26:22] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:26:23] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 3 ms to minimize.
[2024-05-29 18:26:23] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-29 18:26:24] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:26:24] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:26:24] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:26:24] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:26:24] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:26:25] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:26:25] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 16/757 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:26:28] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-29 18:26:28] [INFO ] Deduced a trap composed of 17 places in 100 ms of which 2 ms to minimize.
[2024-05-29 18:26:29] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-29 18:26:29] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-05-29 18:26:29] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:26:30] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:26:31] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:26:32] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 8/765 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:26:37] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:26:37] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 4 ms to minimize.
[2024-05-29 18:26:38] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 3/768 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 768 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 74/74 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 337/358 places, 302/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60807 ms. Remains : 337/358 places, 302/323 transitions.
[2024-05-29 18:26:44] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:26:44] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:26:44] [INFO ] Input system was already deterministic with 302 transitions.
[2024-05-29 18:26:44] [INFO ] Flatten gal took : 29 ms
[2024-05-29 18:26:44] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:26:44] [INFO ] Time to serialize gal into /tmp/CTLFireability8713150759110399682.gal : 8 ms
[2024-05-29 18:26:44] [INFO ] Time to serialize properties into /tmp/CTLFireability17142117713404246259.ctl : 3 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/CTLFireability8713150759110399682.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17142117713404246259.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 18:27:14] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:27:14] [INFO ] Applying decomposition
[2024-05-29 18:27:14] [INFO ] Flatten gal took : 21 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/graph15114042628012982063.txt' '-o' '/tmp/graph15114042628012982063.bin' '-w' '/tmp/graph15114042628012982063.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15114042628012982063.bin' '-l' '-1' '-v' '-w' '/tmp/graph15114042628012982063.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:27:14] [INFO ] Decomposing Gal with order
[2024-05-29 18:27:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:27:14] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-29 18:27:14] [INFO ] Flatten gal took : 38 ms
[2024-05-29 18:27:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-29 18:27:14] [INFO ] Time to serialize gal into /tmp/CTLFireability4011256620133257307.gal : 6 ms
[2024-05-29 18:27:14] [INFO ] Time to serialize properties into /tmp/CTLFireability7868856354712538553.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/CTLFireability4011256620133257307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7868856354712538553.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.10112e+32,4.1956,108484,2753,63,186187,539,664,448477,64,1357,0


Converting to forward existential form...Done !
original formula: (EG(((i10.i2.u67.p211==1) + AF((AF((i11.i2.u74.p234==1)) * A((i7.i1.u60.p182==1) U (i0.i2.u117.p377==1)))))) * !(E(((EG(AX((i6.i1.u33.p98...430
=> equivalent forward existential formula: ([(Init * !(EG(((i10.i2.u67.p211==1) + !(EG(!((!(EG(!((i11.i2.u74.p234==1)))) * !((E(!((i0.i2.u117.p377==1)) U (...972
Reverse transition relation is NOT exact ! Due to transitions t49, t52, t95, t98, t141, t144, t188, t191, t234, t240, t267, t275, t276, t277, t286, t290, t...1222
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 357 transition count 242
Reduce places removed 80 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 82 rules applied. Total rules applied 162 place count 277 transition count 240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 163 place count 276 transition count 240
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 163 place count 276 transition count 208
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 227 place count 244 transition count 208
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 240 place count 231 transition count 195
Iterating global reduction 3 with 13 rules applied. Total rules applied 253 place count 231 transition count 195
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 253 place count 231 transition count 188
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 267 place count 224 transition count 188
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 419 place count 148 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 421 place count 146 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 422 place count 145 transition count 110
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 422 place count 145 transition count 108
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 426 place count 143 transition count 108
Applied a total of 426 rules in 95 ms. Remains 143 /358 variables (removed 215) and now considering 108/323 (removed 215) transitions.
// Phase 1: matrix 108 rows 143 cols
[2024-05-29 18:27:44] [INFO ] Computed 55 invariants in 0 ms
[2024-05-29 18:27:44] [INFO ] Implicit Places using invariants in 143 ms returned [123, 127]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 143 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 141/358 places, 108/323 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 139 transition count 106
Applied a total of 4 rules in 6 ms. Remains 139 /141 variables (removed 2) and now considering 106/108 (removed 2) transitions.
// Phase 1: matrix 106 rows 139 cols
[2024-05-29 18:27:44] [INFO ] Computed 53 invariants in 1 ms
[2024-05-29 18:27:45] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-29 18:27:45] [INFO ] Invariant cache hit.
[2024-05-29 18:27:45] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 139/358 places, 106/323 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 690 ms. Remains : 139/358 places, 106/323 transitions.
[2024-05-29 18:27:45] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:27:45] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:27:45] [INFO ] Input system was already deterministic with 106 transitions.
[2024-05-29 18:27:45] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:27:45] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:27:45] [INFO ] Time to serialize gal into /tmp/CTLFireability3291529941098384146.gal : 2 ms
[2024-05-29 18:27:45] [INFO ] Time to serialize properties into /tmp/CTLFireability8570412081368452330.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/CTLFireability3291529941098384146.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8570412081368452330.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,3.04513e+20,0.761034,29600,2,308,5,107813,6,0,664,180872,0


Converting to forward existential form...Done !
original formula: EG((p127==0))
=> equivalent forward existential formula: [FwdG(Init,(p127==0))] != FALSE
Hit Full ! (commute/partial/dont) 104/0/2
(forward)formula 0,1,0.997912,29600,1,0,9,107813,19,3,3212,180872,8
FORMULA ShieldPPPt-PT-005B-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 338 transition count 303
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 338 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 337 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 337 transition count 302
Applied a total of 42 rules in 17 ms. Remains 337 /358 variables (removed 21) and now considering 302/323 (removed 21) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 18:27:46] [INFO ] Computed 56 invariants in 2 ms
[2024-05-29 18:27:46] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-29 18:27:46] [INFO ] Invariant cache hit.
[2024-05-29 18:27:46] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 523 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-29 18:27:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:27:50] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:27:50] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
[2024-05-29 18:27:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:27:50] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:27:50] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:27:50] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:27:50] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:27:50] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:27:51] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:27:51] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 3 ms to minimize.
[2024-05-29 18:27:51] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:27:51] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 0 ms to minimize.
[2024-05-29 18:27:51] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:27:51] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:27:51] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:27:51] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:27:51] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:27:51] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:27:51] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-29 18:27:51] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:27:52] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:27:53] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:27:54] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:27:56] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (OVERLAPS) 302/639 variables, 337/428 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:28:02] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:28:03] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 2/430 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:28:05] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:28:06] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 2/432 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:28:07] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:28:07] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:28:08] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 3/435 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:28:13] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:28:15] [INFO ] Deduced a trap composed of 20 places in 24 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 Real declared 639/639 variables, and 437 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 44/44 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 44/100 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/639 variables, 337/437 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/639 variables, 301/738 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:28:22] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:28:22] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:28:22] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 2 ms to minimize.
[2024-05-29 18:28:23] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-29 18:28:23] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:28:23] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:28:24] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:28:24] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:28:24] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-29 18:28:25] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 2 ms to minimize.
[2024-05-29 18:28:25] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:28:25] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:28:25] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-05-29 18:28:25] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-29 18:28:26] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 2 ms to minimize.
[2024-05-29 18:28:26] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 16/754 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:28:29] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-29 18:28:30] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:28:31] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:28:32] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:28:33] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:28:33] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 7/761 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:28:40] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:28:45] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 763 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 69/69 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 337/358 places, 302/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60615 ms. Remains : 337/358 places, 302/323 transitions.
[2024-05-29 18:28:47] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:28:47] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:28:47] [INFO ] Input system was already deterministic with 302 transitions.
[2024-05-29 18:28:47] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:28:47] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:28:47] [INFO ] Time to serialize gal into /tmp/CTLFireability9107221053653154348.gal : 3 ms
[2024-05-29 18:28:47] [INFO ] Time to serialize properties into /tmp/CTLFireability4753218168342287446.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/CTLFireability9107221053653154348.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4753218168342287446.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 18:29:17] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:29:17] [INFO ] Applying decomposition
[2024-05-29 18:29:17] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9370885304130936210.txt' '-o' '/tmp/graph9370885304130936210.bin' '-w' '/tmp/graph9370885304130936210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9370885304130936210.bin' '-l' '-1' '-v' '-w' '/tmp/graph9370885304130936210.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:29:17] [INFO ] Decomposing Gal with order
[2024-05-29 18:29:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:29:17] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-29 18:29:17] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:29:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 18:29:17] [INFO ] Time to serialize gal into /tmp/CTLFireability555486363808171782.gal : 3 ms
[2024-05-29 18:29:17] [INFO ] Time to serialize properties into /tmp/CTLFireability10972206381697473081.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/CTLFireability555486363808171782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10972206381697473081.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.85108e+32,7.23006,188448,3351,52,290038,377,655,1.29034e+06,59,968,0


Converting to forward existential form...Done !
original formula: EX(E((i0.i1.u20.p67==1) U !(AF((i12.u88.p281==1)))))
=> equivalent forward existential formula: [FwdG(FwdU(EY(Init),(i0.i1.u20.p67==1)),!((i12.u88.p281==1)))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 341 transition count 306
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 341 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 340 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 340 transition count 305
Applied a total of 36 rules in 13 ms. Remains 340 /358 variables (removed 18) and now considering 305/323 (removed 18) transitions.
// Phase 1: matrix 305 rows 340 cols
[2024-05-29 18:29:47] [INFO ] Computed 56 invariants in 2 ms
[2024-05-29 18:29:47] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-05-29 18:29:47] [INFO ] Invariant cache hit.
[2024-05-29 18:29:47] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2024-05-29 18:29:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:29:50] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:29:50] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:29:50] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:29:51] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:29:51] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:29:51] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:29:51] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 0 ms to minimize.
[2024-05-29 18:29:51] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:29:51] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-29 18:29:51] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:29:51] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:29:51] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:29:51] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:29:51] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:29:52] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:29:52] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:29:52] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:29:52] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
[2024-05-29 18:29:52] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:29:52] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:29:52] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:29:53] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:29:53] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:29:53] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:29:53] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 8 ms to minimize.
[2024-05-29 18:29:53] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 11 ms to minimize.
[2024-05-29 18:29:53] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:29:53] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:29:53] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:29:53] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:29:54] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:29:54] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 2 ms to minimize.
[2024-05-29 18:29:54] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:29:54] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2024-05-29 18:29:54] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:29:54] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:29:54] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:29:54] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:29:54] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:29:54] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:29:57] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:29:57] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:29:57] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 305/645 variables, 340/439 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:30:02] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:30:02] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:30:03] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:30:03] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:30:03] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 5/444 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:30:06] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:30:08] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:30:12] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:30:13] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/645 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 304 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 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 1.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 1.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 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 1.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 1.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 1.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.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 1.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 1.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 1.0)
(s232 0.0)
(s233 1.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 1.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 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 645/645 variables, and 448 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 52/108 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 305/645 variables, 340/448 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 304/752 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:30:23] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-29 18:30:23] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:30:24] [INFO ] Deduced a trap composed of 18 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:30:24] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:30:24] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 1 ms to minimize.
[2024-05-29 18:30:25] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2024-05-29 18:30:25] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:30:25] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:30:26] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-05-29 18:30:26] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
[2024-05-29 18:30:26] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 2 ms to minimize.
[2024-05-29 18:30:27] [INFO ] Deduced a trap composed of 16 places in 120 ms of which 2 ms to minimize.
[2024-05-29 18:30:27] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 13/765 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:30:31] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2024-05-29 18:30:32] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:30:33] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:30:34] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 4/769 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:30:39] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 2 ms to minimize.
[2024-05-29 18:30:42] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 2/771 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 771 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 71/71 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Starting structural reductions in LTL mode, iteration 1 : 340/358 places, 305/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60399 ms. Remains : 340/358 places, 305/323 transitions.
[2024-05-29 18:30:47] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:30:47] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:30:47] [INFO ] Input system was already deterministic with 305 transitions.
[2024-05-29 18:30:47] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:30:47] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:30:47] [INFO ] Time to serialize gal into /tmp/CTLFireability16384473983861730964.gal : 2 ms
[2024-05-29 18:30:47] [INFO ] Time to serialize properties into /tmp/CTLFireability5998495438140544825.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/CTLFireability16384473983861730964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5998495438140544825.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.4437e+32,8.54733,217792,3407,33,396107,500,687,1.01353e+06,60,1707,0


Converting to forward existential form...Done !
original formula: ((AF((((i17.i0.u106.p339==1)&&(i20.i2.u118.p391==1))&&(i7.u39.p127==1))) * !(E((i4.u44.p139==1) U (((E(((i11.i0.u57.p184==1)&&(i11.i0.u57...443
=> equivalent forward existential formula: ([FwdG((Init * !((!(EG(!((((i17.i0.u106.p339==1)&&(i20.i2.u118.p391==1))&&(i7.u39.p127==1))))) * !(E((i4.u44.p13...860
Reverse transition relation is NOT exact ! Due to transitions t50, t53, t96, t99, t144, t147, t197, t237, t240, t270, t278, t279, t280, t288, t290, t297, i...1273
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 340 transition count 305
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 340 transition count 305
Applied a total of 36 rules in 6 ms. Remains 340 /358 variables (removed 18) and now considering 305/323 (removed 18) transitions.
// Phase 1: matrix 305 rows 340 cols
[2024-05-29 18:31:48] [INFO ] Computed 56 invariants in 4 ms
[2024-05-29 18:31:48] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-29 18:31:48] [INFO ] Invariant cache hit.
[2024-05-29 18:31:48] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2024-05-29 18:31:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:31:51] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:31:51] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:31:51] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:31:51] [INFO ] Deduced a trap composed of 19 places in 17 ms of which 0 ms to minimize.
[2024-05-29 18:31:51] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:31:51] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:31:52] [INFO ] Deduced a trap composed of 18 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:31:52] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:31:52] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:31:52] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:31:52] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 0 ms to minimize.
[2024-05-29 18:31:52] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:31:52] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:31:52] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:31:52] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:31:52] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:31:53] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
[2024-05-29 18:31:53] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:31:53] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:31:53] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:31:53] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:31:54] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:31:54] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:31:54] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:31:54] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:31:54] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 0 ms to minimize.
[2024-05-29 18:31:54] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:31:54] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:31:54] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:31:54] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:31:54] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:31:54] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:31:55] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:31:55] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:31:55] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:31:55] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:31:55] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:31:57] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:31:58] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:32:00] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/340 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 7 (OVERLAPS) 305/645 variables, 340/436 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:32:06] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:32:07] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:32:08] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:32:08] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:32:08] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 4/441 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:32:13] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:32:13] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 2/443 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/645 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:32:18] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/645 variables, and 444 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 48/104 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 305/645 variables, 340/444 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 304/748 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:32:23] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:32:23] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:32:24] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:32:24] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:32:25] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:32:25] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:32:25] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:32:26] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 2 ms to minimize.
[2024-05-29 18:32:26] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-05-29 18:32:26] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:32:27] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:32:27] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 2 ms to minimize.
[2024-05-29 18:32:27] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-29 18:32:27] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:32:28] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 15/763 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:32:34] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 2 ms to minimize.
[2024-05-29 18:32:34] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 2/765 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:32:39] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-29 18:32:41] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:32:42] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
[2024-05-29 18:32:42] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 4/769 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:32:48] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 770 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 70/70 constraints]
After SMT, in 60045ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 340/358 places, 305/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60384 ms. Remains : 340/358 places, 305/323 transitions.
[2024-05-29 18:32:48] [INFO ] Flatten gal took : 21 ms
[2024-05-29 18:32:48] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:32:48] [INFO ] Input system was already deterministic with 305 transitions.
[2024-05-29 18:32:48] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:32:48] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:32:48] [INFO ] Time to serialize gal into /tmp/CTLFireability15560196127849145206.gal : 1 ms
[2024-05-29 18:32:48] [INFO ] Time to serialize properties into /tmp/CTLFireability6346787100414050029.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/CTLFireability15560196127849145206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6346787100414050029.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 18:33:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:33:18] [INFO ] Applying decomposition
[2024-05-29 18:33:18] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6892871312097922453.txt' '-o' '/tmp/graph6892871312097922453.bin' '-w' '/tmp/graph6892871312097922453.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6892871312097922453.bin' '-l' '-1' '-v' '-w' '/tmp/graph6892871312097922453.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:33:18] [INFO ] Decomposing Gal with order
[2024-05-29 18:33:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:33:18] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-29 18:33:18] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:33:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 18:33:18] [INFO ] Time to serialize gal into /tmp/CTLFireability1043523755234330996.gal : 5 ms
[2024-05-29 18:33:18] [INFO ] Time to serialize properties into /tmp/CTLFireability2700774998434029128.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/CTLFireability1043523755234330996.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2700774998434029128.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.35811e+32,4.69775,131464,2564,52,240581,613,662,608428,61,2116,0


Converting to forward existential form...Done !
original formula: A(((i1.i0.u6.p14==1) + AF((!((((i8.i1.u59.p188==1)||(i14.i1.u76.p244==1))&&(i11.i1.u90.p283==1))) * !((((i4.i1.u31.p100==1)&&(i4.i1.u31.p...331
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !(EX(((!(EX((i1.i2.u18.p56==1))) * (i9.i0.u58.p185==1)) * ((i9.i1.u72.p237==1) * !(E...690
Reverse transition relation is NOT exact ! Due to transitions t53, t56, t105, t145, t148, t191, t194, t237, t240, t270, t284, t288, t302, i0.t297, i0.i0.u2...1226
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 357 transition count 242
Reduce places removed 80 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 82 rules applied. Total rules applied 162 place count 277 transition count 240
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 164 place count 276 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 165 place count 275 transition count 239
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 165 place count 275 transition count 209
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 225 place count 245 transition count 209
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 239 place count 231 transition count 195
Iterating global reduction 4 with 14 rules applied. Total rules applied 253 place count 231 transition count 195
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 253 place count 231 transition count 188
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 267 place count 224 transition count 188
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 419 place count 148 transition count 112
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 421 place count 146 transition count 110
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 422 place count 145 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 422 place count 145 transition count 109
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 424 place count 144 transition count 109
Applied a total of 424 rules in 31 ms. Remains 144 /358 variables (removed 214) and now considering 109/323 (removed 214) transitions.
// Phase 1: matrix 109 rows 144 cols
[2024-05-29 18:33:48] [INFO ] Computed 55 invariants in 1 ms
[2024-05-29 18:33:48] [INFO ] Implicit Places using invariants in 105 ms returned [128]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 115 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 143/358 places, 109/323 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 142 transition count 108
Applied a total of 2 rules in 5 ms. Remains 142 /143 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 142 cols
[2024-05-29 18:33:49] [INFO ] Computed 54 invariants in 1 ms
[2024-05-29 18:33:49] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-29 18:33:49] [INFO ] Invariant cache hit.
[2024-05-29 18:33:49] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 142/358 places, 108/323 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 419 ms. Remains : 142/358 places, 108/323 transitions.
[2024-05-29 18:33:49] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:33:49] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:33:49] [INFO ] Input system was already deterministic with 108 transitions.
[2024-05-29 18:33:49] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:33:49] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:33:49] [INFO ] Time to serialize gal into /tmp/CTLFireability10258289727060732925.gal : 1 ms
[2024-05-29 18:33:49] [INFO ] Time to serialize properties into /tmp/CTLFireability8492545346263255935.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/CTLFireability10258289727060732925.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8492545346263255935.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.21069e+21,0.279679,15572,2,257,5,50075,6,0,679,80961,0


Converting to forward existential form...Done !
original formula: EF(EG((((p300==1)||(p331==0))||(p333==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(((p300==1)||(p331==0))||(p333==0)))] != FALSE
Hit Full ! (commute/partial/dont) 103/0/5
(forward)formula 0,1,0.328361,15836,1,0,8,50075,19,3,3293,80961,8
FORMULA ShieldPPPt-PT-005B-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 339 transition count 304
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 339 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 338 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 338 transition count 303
Applied a total of 40 rules in 9 ms. Remains 338 /358 variables (removed 20) and now considering 303/323 (removed 20) transitions.
// Phase 1: matrix 303 rows 338 cols
[2024-05-29 18:33:49] [INFO ] Computed 56 invariants in 16 ms
[2024-05-29 18:33:49] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-29 18:33:49] [INFO ] Invariant cache hit.
[2024-05-29 18:33:50] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2024-05-29 18:33:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:33:53] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:33:53] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-05-29 18:33:53] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:33:53] [INFO ] Deduced a trap composed of 20 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:33:53] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:33:53] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:33:53] [INFO ] Deduced a trap composed of 21 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:33:53] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:33:53] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-29 18:33:53] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:33:53] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:33:53] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:33:54] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:33:54] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:33:54] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 1 ms to minimize.
[2024-05-29 18:33:54] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2024-05-29 18:33:54] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:33:54] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:33:54] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:33:54] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:33:55] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:33:55] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:33:55] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:33:55] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:33:55] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:33:56] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:33:56] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:33:56] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:33:56] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:33:56] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:33:56] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:33:56] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:33:56] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:33:56] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:33:56] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:33:56] [INFO ] Deduced a trap composed of 25 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:34:00] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:34:00] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 303/641 variables, 338/432 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:34:07] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:34:08] [INFO ] Deduced a trap composed of 20 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:34:08] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:34:08] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:34:08] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/641 variables, 5/437 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:34:11] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:34:11] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 2/439 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:34:19] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/641 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 641/641 variables, and 440 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 46/102 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:34:21] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:34:21] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (OVERLAPS) 303/641 variables, 338/442 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 302/744 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:34:26] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:34:27] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-29 18:34:27] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:34:28] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:34:28] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-29 18:34:28] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:34:29] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:34:29] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:34:29] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:34:30] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 1 ms to minimize.
[2024-05-29 18:34:30] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:34:31] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:34:31] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-29 18:34:31] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 14/758 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:34:35] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:34:36] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:34:38] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 3/761 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:34:42] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-29 18:34:44] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:34:44] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 3/764 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:34:50] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 641/641 variables, and 765 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 69/69 constraints]
After SMT, in 60072ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in LTL mode, iteration 1 : 338/358 places, 303/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60498 ms. Remains : 338/358 places, 303/323 transitions.
[2024-05-29 18:34:50] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:34:50] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:34:50] [INFO ] Input system was already deterministic with 303 transitions.
[2024-05-29 18:34:50] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:34:50] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:34:50] [INFO ] Time to serialize gal into /tmp/CTLFireability4972016533390148462.gal : 2 ms
[2024-05-29 18:34:50] [INFO ] Time to serialize properties into /tmp/CTLFireability16736791911605232112.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/CTLFireability4972016533390148462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16736791911605232112.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 18:35:20] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:35:20] [INFO ] Applying decomposition
[2024-05-29 18:35:20] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6767734138395814631.txt' '-o' '/tmp/graph6767734138395814631.bin' '-w' '/tmp/graph6767734138395814631.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6767734138395814631.bin' '-l' '-1' '-v' '-w' '/tmp/graph6767734138395814631.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:35:20] [INFO ] Decomposing Gal with order
[2024-05-29 18:35:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:35:20] [INFO ] Removed a total of 51 redundant transitions.
[2024-05-29 18:35:20] [INFO ] Flatten gal took : 23 ms
[2024-05-29 18:35:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:35:20] [INFO ] Time to serialize gal into /tmp/CTLFireability8935849407623665595.gal : 14 ms
[2024-05-29 18:35:20] [INFO ] Time to serialize properties into /tmp/CTLFireability15136469385849966112.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/CTLFireability8935849407623665595.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15136469385849966112.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,2.3577e+32,17.5882,379872,4252,50,599996,509,648,1.89445e+06,61,1578,0


Converting to forward existential form...Done !
original formula: !(E(AG(((((i14.i2.u80.p262==1)&&(i14.i4.u93.p314==1)) + (AG(((i2.i0.u11.p31==1)&&(i2.i1.u25.p83==1))) * AF((i1.u16.p46==1)))) + AG(!(((i1...300
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(((((i14.i2.u80.p262==1)&&(i14.i4.u93.p314==1)) + (!(E(TRUE U !(((i2.i0.u11.p31==1)&&(i2...396
Reverse transition relation is NOT exact ! Due to transitions t50, t53, t102, t142, t145, t189, t192, t235, t238, t268, t277, t286, t291, t295, t300, i0.t8...1224
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 339 transition count 304
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 339 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 338 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 338 transition count 303
Applied a total of 40 rules in 15 ms. Remains 338 /358 variables (removed 20) and now considering 303/323 (removed 20) transitions.
// Phase 1: matrix 303 rows 338 cols
[2024-05-29 18:35:50] [INFO ] Computed 56 invariants in 4 ms
[2024-05-29 18:35:50] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-29 18:35:50] [INFO ] Invariant cache hit.
[2024-05-29 18:35:50] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2024-05-29 18:35:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:35:53] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:35:53] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:35:54] [INFO ] Deduced a trap composed of 18 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:35:54] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:35:54] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:35:54] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:35:54] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:35:54] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:35:54] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:35:54] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:35:54] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:35:54] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:35:54] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:35:54] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:35:54] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:35:55] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:35:55] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:35:55] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:35:55] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:35:55] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:35:56] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:35:56] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:35:56] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:35:56] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:35:56] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:35:56] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:35:56] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:35:56] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:35:56] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:35:56] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:35:56] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:35:57] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:35:57] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:35:57] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:35:57] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:35:57] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-05-29 18:35:57] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:36:00] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:36:02] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:36:04] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 1/96 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:36:07] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/338 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 9 (OVERLAPS) 303/641 variables, 338/435 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:36:13] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:36:15] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:36:16] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:36:16] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 641/641 variables, and 439 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 45/101 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:36:22] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:36:22] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (OVERLAPS) 303/641 variables, 338/441 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 302/743 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:36:27] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:36:28] [INFO ] Deduced a trap composed of 18 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:36:29] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:36:29] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:36:29] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:36:29] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 2 ms to minimize.
[2024-05-29 18:36:30] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:36:30] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:36:30] [INFO ] Deduced a trap composed of 31 places in 57 ms of which 2 ms to minimize.
[2024-05-29 18:36:30] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:36:31] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:36:31] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 12/755 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:36:35] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:36:36] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:36:36] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2024-05-29 18:36:37] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 2 ms to minimize.
[2024-05-29 18:36:38] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:36:38] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 6/761 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:36:44] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:36:46] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 2/763 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 1)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 1)
(s149 0)
(s150 0)
(s151 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 641/641 variables, and 763 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 67/67 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60065ms
Starting structural reductions in LTL mode, iteration 1 : 338/358 places, 303/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60423 ms. Remains : 338/358 places, 303/323 transitions.
[2024-05-29 18:36:50] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:36:50] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:36:50] [INFO ] Input system was already deterministic with 303 transitions.
[2024-05-29 18:36:50] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:36:50] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:36:50] [INFO ] Time to serialize gal into /tmp/CTLFireability14854131090740653771.gal : 2 ms
[2024-05-29 18:36:50] [INFO ] Time to serialize properties into /tmp/CTLFireability709325273624548665.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/CTLFireability14854131090740653771.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability709325273624548665.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 18:37:20] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:37:20] [INFO ] Applying decomposition
[2024-05-29 18:37:20] [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/graph5606594862620797207.txt' '-o' '/tmp/graph5606594862620797207.bin' '-w' '/tmp/graph5606594862620797207.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5606594862620797207.bin' '-l' '-1' '-v' '-w' '/tmp/graph5606594862620797207.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:37:20] [INFO ] Decomposing Gal with order
[2024-05-29 18:37:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:37:20] [INFO ] Removed a total of 50 redundant transitions.
[2024-05-29 18:37:20] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:37:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 18:37:20] [INFO ] Time to serialize gal into /tmp/CTLFireability2310569469632993644.gal : 3 ms
[2024-05-29 18:37:20] [INFO ] Time to serialize properties into /tmp/CTLFireability14550661351854226067.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/CTLFireability2310569469632993644.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14550661351854226067.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,2.3779e+32,7.47381,197160,2868,49,333971,499,641,1.16534e+06,61,1487,0


Converting to forward existential form...Done !
original formula: E(!(AF((AX((i5.u38.p119!=1)) * (i4.i1.u45.p138==1)))) U ((i19.u119.p371!=1)&&(i15.u94.p304==1)))
=> equivalent forward existential formula: [(FwdU(Init,!(!(EG(!((!(EX(!((i5.u38.p119!=1)))) * (i4.i1.u45.p138==1))))))) * ((i19.u119.p371!=1)&&(i15.u94.p30...172
Reverse transition relation is NOT exact ! Due to transitions t50, t53, t96, t99, t148, t195, t235, t238, t268, t277, t285, t286, t300, i0.t228, i0.u15.t23...1214
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 338 transition count 303
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 338 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 337 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 337 transition count 302
Applied a total of 42 rules in 18 ms. Remains 337 /358 variables (removed 21) and now considering 302/323 (removed 21) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 18:37:51] [INFO ] Computed 56 invariants in 2 ms
[2024-05-29 18:37:51] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-29 18:37:51] [INFO ] Invariant cache hit.
[2024-05-29 18:37:51] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-29 18:37:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:37:54] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:37:54] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:37:54] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:37:54] [INFO ] Deduced a trap composed of 19 places in 16 ms of which 1 ms to minimize.
[2024-05-29 18:37:54] [INFO ] Deduced a trap composed of 22 places in 54 ms of which 19 ms to minimize.
[2024-05-29 18:37:54] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:37:54] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:37:55] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2024-05-29 18:37:55] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:37:55] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:37:55] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:37:55] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:37:55] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:37:55] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 2 ms to minimize.
[2024-05-29 18:37:55] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:37:55] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:37:55] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:37:55] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:37:56] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:37:56] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:37:56] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:37:57] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:37:57] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:37:57] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:37:57] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:37:57] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:37:57] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:37:57] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:37:57] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:37:57] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:37:57] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 18:37:57] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:37:57] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2024-05-29 18:37:58] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:37:58] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 15/91 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:38:00] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:38:01] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (OVERLAPS) 302/639 variables, 337/430 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:38:07] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 1/431 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:38:09] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:38:10] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:38:11] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 2/434 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:38:16] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 18:38:16] [INFO ] Deduced a trap composed of 22 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:38:17] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 3/437 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:38:18] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/639 variables, and 438 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 45/101 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/639 variables, 337/438 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/639 variables, 301/739 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:38:26] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-29 18:38:26] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 2 ms to minimize.
[2024-05-29 18:38:26] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 2 ms to minimize.
[2024-05-29 18:38:26] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:38:27] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:38:27] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 1 ms to minimize.
[2024-05-29 18:38:27] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2024-05-29 18:38:27] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:38:27] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:38:27] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:38:28] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-29 18:38:28] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 2 ms to minimize.
[2024-05-29 18:38:29] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-29 18:38:29] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-05-29 18:38:29] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:38:29] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-05-29 18:38:30] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:38:30] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:38:30] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 19/758 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:38:35] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-05-29 18:38:36] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:38:36] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:38:36] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 2 ms to minimize.
[2024-05-29 18:38:36] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:38:37] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:38:37] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 7/765 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 0/765 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:38:49] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 1)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 1)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 1)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 1)
(s96 0)
(s97 1)
(s98 0)
(s99 1)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 1)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 1)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 1)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 1)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(timeout
s183 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 766 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 72/72 constraints]
After SMT, in 60051ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 337/358 places, 302/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60395 ms. Remains : 337/358 places, 302/323 transitions.
[2024-05-29 18:38:51] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:38:51] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:38:51] [INFO ] Input system was already deterministic with 302 transitions.
[2024-05-29 18:38:51] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:38:51] [INFO ] Flatten gal took : 29 ms
[2024-05-29 18:38:51] [INFO ] Time to serialize gal into /tmp/CTLFireability17692079100504226810.gal : 15 ms
[2024-05-29 18:38:51] [INFO ] Time to serialize properties into /tmp/CTLFireability11931678548028294218.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/CTLFireability17692079100504226810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11931678548028294218.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 18:39:21] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:39:21] [INFO ] Applying decomposition
[2024-05-29 18:39:21] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8128413233048662204.txt' '-o' '/tmp/graph8128413233048662204.bin' '-w' '/tmp/graph8128413233048662204.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8128413233048662204.bin' '-l' '-1' '-v' '-w' '/tmp/graph8128413233048662204.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:39:21] [INFO ] Decomposing Gal with order
[2024-05-29 18:39:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:39:21] [INFO ] Removed a total of 54 redundant transitions.
[2024-05-29 18:39:21] [INFO ] Flatten gal took : 16 ms
[2024-05-29 18:39:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 18:39:21] [INFO ] Time to serialize gal into /tmp/CTLFireability10519245078701690172.gal : 5 ms
[2024-05-29 18:39:21] [INFO ] Time to serialize properties into /tmp/CTLFireability17418459267871315170.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/CTLFireability10519245078701690172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17418459267871315170.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.83849e+32,5.07375,148360,2755,29,274912,414,630,811827,50,1116,0


Converting to forward existential form...Done !
original formula: E(((i12.u88.p278!=1) * (!(AX(!(E((i8.u73.p226==1) U (i6.i3.u44.p138==1))))) + AG((i2.u21.p68!=1)))) U ((i4.i0.u37.p115==1)&&(i4.i1.u45.p1...163
=> equivalent forward existential formula: [(FwdU(Init,((i12.u88.p278!=1) * (!(!(EX(!(!(E((i8.u73.p226==1) U (i6.i3.u44.p138==1))))))) + !(E(TRUE U !((i2.u...227
Reverse transition relation is NOT exact ! Due to transitions t49, t55, t95, t98, t148, t188, t194, t234, t237, t267, t276, t290, t294, i0.i0.u10.t239, i0....1188
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 77 place count 357 transition count 245
Reduce places removed 77 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 79 rules applied. Total rules applied 156 place count 280 transition count 243
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 158 place count 279 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 159 place count 278 transition count 242
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 31 Pre rules applied. Total rules applied 159 place count 278 transition count 211
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 221 place count 247 transition count 211
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 235 place count 233 transition count 197
Iterating global reduction 4 with 14 rules applied. Total rules applied 249 place count 233 transition count 197
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 249 place count 233 transition count 190
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 263 place count 226 transition count 190
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 407 place count 154 transition count 118
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 409 place count 152 transition count 116
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 410 place count 151 transition count 116
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 410 place count 151 transition count 114
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 414 place count 149 transition count 114
Applied a total of 414 rules in 56 ms. Remains 149 /358 variables (removed 209) and now considering 114/323 (removed 209) transitions.
// Phase 1: matrix 114 rows 149 cols
[2024-05-29 18:39:51] [INFO ] Computed 55 invariants in 0 ms
[2024-05-29 18:39:51] [INFO ] Implicit Places using invariants in 86 ms returned [129, 133]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 88 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 147/358 places, 114/323 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 145 transition count 112
Applied a total of 4 rules in 4 ms. Remains 145 /147 variables (removed 2) and now considering 112/114 (removed 2) transitions.
// Phase 1: matrix 112 rows 145 cols
[2024-05-29 18:39:51] [INFO ] Computed 53 invariants in 0 ms
[2024-05-29 18:39:51] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-29 18:39:51] [INFO ] Invariant cache hit.
[2024-05-29 18:39:52] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 145/358 places, 112/323 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 351 ms. Remains : 145/358 places, 112/323 transitions.
[2024-05-29 18:39:52] [INFO ] Flatten gal took : 15 ms
[2024-05-29 18:39:52] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:39:52] [INFO ] Input system was already deterministic with 112 transitions.
[2024-05-29 18:39:52] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:39:52] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:39:52] [INFO ] Time to serialize gal into /tmp/CTLFireability14107466848091686941.gal : 1 ms
[2024-05-29 18:39:52] [INFO ] Time to serialize properties into /tmp/CTLFireability8381721532288509896.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/CTLFireability14107466848091686941.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8381721532288509896.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.17183e+21,0.34065,18760,2,456,5,62601,6,0,693,103677,0


Converting to forward existential form...Done !
original formula: AF((EF(((p176==1)&&(p203==1))) * EG(AF((((p80==1)&&(p322==1)) * A((p64==1) U ((p173==1)&&(p209==1))))))))
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((p176==1)&&(p203==1))) * EG(!(EG(!((((p80==1)&&(p322==1)) * !((E(!(((p173==1)&&(p209==1)...253
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t13, t15, t16, t39, t46, t48, t49, t51, t52, t55...323
Detected timeout of ITS tools.
[2024-05-29 18:40:22] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:40:22] [INFO ] Applying decomposition
[2024-05-29 18:40:22] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4470805231802052328.txt' '-o' '/tmp/graph4470805231802052328.bin' '-w' '/tmp/graph4470805231802052328.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4470805231802052328.bin' '-l' '-1' '-v' '-w' '/tmp/graph4470805231802052328.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:40:22] [INFO ] Decomposing Gal with order
[2024-05-29 18:40:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:40:22] [INFO ] Removed a total of 14 redundant transitions.
[2024-05-29 18:40:22] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:40:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-29 18:40:22] [INFO ] Time to serialize gal into /tmp/CTLFireability5667977016803976027.gal : 2 ms
[2024-05-29 18:40:22] [INFO ] Time to serialize properties into /tmp/CTLFireability1952354946779197827.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/CTLFireability5667977016803976027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1952354946779197827.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17183e+21,0.113237,8292,125,26,9249,137,317,20835,55,816,0


Converting to forward existential form...Done !
original formula: AF((EF(((i8.i0.u19.p176==1)&&(i8.i0.u22.p203==1))) * EG(AF((((i0.u8.p80==1)&&(i12.i2.u38.p322==1)) * A((i1.u7.p64==1) U ((i8.i0.u18.p173=...186
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((i8.i0.u19.p176==1)&&(i8.i0.u22.p203==1))) * EG(!(EG(!((((i0.u8.p80==1)&&(i12.i2.u38.p32...356
Reverse transition relation is NOT exact ! Due to transitions i0.u3.t1, i0.u8.t15, i1.u4.t2, i1.u7.t16, i2.u2.t0, i2.u6.t39, i3.u5.t75, i3.u11.t4, i3.u16.t...570
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 338 transition count 303
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 338 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 337 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 337 transition count 302
Applied a total of 42 rules in 16 ms. Remains 337 /358 variables (removed 21) and now considering 302/323 (removed 21) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 18:40:52] [INFO ] Computed 56 invariants in 2 ms
[2024-05-29 18:40:52] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-29 18:40:52] [INFO ] Invariant cache hit.
[2024-05-29 18:40:52] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-29 18:40:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:40:55] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:40:55] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:40:55] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:40:55] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:40:55] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:40:56] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 18:40:56] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:40:56] [INFO ] Deduced a trap composed of 16 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:40:56] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 0 ms to minimize.
[2024-05-29 18:40:56] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 0 ms to minimize.
[2024-05-29 18:40:56] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:40:56] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:40:56] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:40:56] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:40:56] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:40:57] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:40:57] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:40:57] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:40:57] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:40:57] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:40:57] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:40:57] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:40:58] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:40:58] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:40:58] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:40:58] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:40:58] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:40:58] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:40:58] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:40:58] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:40:59] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:40:59] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:40:59] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:40:59] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 18:40:59] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:40:59] [INFO ] Deduced a trap composed of 25 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:40:59] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:41:02] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:41:02] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:41:02] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:41:02] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:41:02] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:41:02] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:41:02] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:41:04] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:41:04] [INFO ] Deduced a trap composed of 19 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 302/639 variables, 337/439 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 9 (OVERLAPS) 0/639 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 639/639 variables, and 439 constraints, problems are : Problem set: 0 solved, 301 unsolved in 23567 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 46/102 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:41:18] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:41:20] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (OVERLAPS) 302/639 variables, 337/441 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 301/742 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:41:24] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 0 ms to minimize.
[2024-05-29 18:41:24] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:41:25] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:41:25] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 2 ms to minimize.
[2024-05-29 18:41:26] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:41:26] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 10 ms to minimize.
[2024-05-29 18:41:27] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:41:28] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-05-29 18:41:28] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:41:29] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 10/752 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:41:32] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 2 ms to minimize.
[2024-05-29 18:41:32] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2024-05-29 18:41:34] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 3/755 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:41:42] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 756 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 62/62 constraints]
After SMT, in 53606ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 53609ms
Starting structural reductions in LTL mode, iteration 1 : 337/358 places, 302/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53960 ms. Remains : 337/358 places, 302/323 transitions.
[2024-05-29 18:41:46] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:41:46] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:41:46] [INFO ] Input system was already deterministic with 302 transitions.
[2024-05-29 18:41:46] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:41:46] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:41:46] [INFO ] Time to serialize gal into /tmp/CTLFireability8802315417686605654.gal : 14 ms
[2024-05-29 18:41:46] [INFO ] Time to serialize properties into /tmp/CTLFireability4948734706245665438.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/CTLFireability8802315417686605654.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4948734706245665438.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 18:42:16] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:42:16] [INFO ] Applying decomposition
[2024-05-29 18:42:16] [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/graph6818478502093421984.txt' '-o' '/tmp/graph6818478502093421984.bin' '-w' '/tmp/graph6818478502093421984.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6818478502093421984.bin' '-l' '-1' '-v' '-w' '/tmp/graph6818478502093421984.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:42:16] [INFO ] Decomposing Gal with order
[2024-05-29 18:42:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:42:16] [INFO ] Removed a total of 50 redundant transitions.
[2024-05-29 18:42:16] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:42:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:42:16] [INFO ] Time to serialize gal into /tmp/CTLFireability16168470245863419850.gal : 2 ms
[2024-05-29 18:42:16] [INFO ] Time to serialize properties into /tmp/CTLFireability13834226470824628984.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/CTLFireability16168470245863419850.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13834226470824628984.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.86614e+32,3.70619,104476,3170,55,184560,546,667,468110,62,1480,0


Converting to forward existential form...Done !
original formula: AF((((i13.i1.u76.p247==1)&&(i13.i4.u95.p309==1)) + ((i4.i1.u18.p56==1) * AG(E((i8.u67.p227==1) U EX((i4.i1.u17.p60==1)))))))
=> equivalent forward existential formula: [FwdG(Init,!((((i13.i1.u76.p247==1)&&(i13.i4.u95.p309==1)) + ((i4.i1.u18.p56==1) * !(E(TRUE U !(E((i8.u67.p227==...199
Reverse transition relation is NOT exact ! Due to transitions t52, t55, t101, t141, t144, t187, t190, t234, t240, t267, t276, t281, t285, t299, i0.t294, i0...1193
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 338 transition count 303
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 338 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 337 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 337 transition count 302
Applied a total of 42 rules in 21 ms. Remains 337 /358 variables (removed 21) and now considering 302/323 (removed 21) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 18:42:46] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 18:42:46] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-29 18:42:46] [INFO ] Invariant cache hit.
[2024-05-29 18:42:46] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-29 18:42:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:42:49] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:42:49] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:42:50] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-29 18:42:50] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:42:50] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:42:50] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:42:50] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:42:50] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:42:50] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:42:50] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:42:50] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:42:50] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:42:50] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:42:50] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-29 18:42:51] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:42:51] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:42:51] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:42:51] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:42:51] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:42:51] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:42:52] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:42:52] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 2 ms to minimize.
[2024-05-29 18:42:52] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
[2024-05-29 18:42:52] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 0 ms to minimize.
[2024-05-29 18:42:52] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:42:52] [INFO ] Deduced a trap composed of 15 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:42:52] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:42:52] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:42:52] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:42:53] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:42:53] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:42:53] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:42:53] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:42:53] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:42:56] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:42:56] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:42:57] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:42:58] [INFO ] Deduced a trap composed of 23 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 302/639 variables, 337/431 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:43:02] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:43:03] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 2/433 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:43:05] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-05-29 18:43:06] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:43:06] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 3/436 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:43:11] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:43:16] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/639 variables, and 438 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 45/101 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:43:19] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (OVERLAPS) 302/639 variables, 337/439 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 301/740 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:43:23] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
[2024-05-29 18:43:24] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:43:24] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 3 ms to minimize.
[2024-05-29 18:43:24] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-29 18:43:25] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2024-05-29 18:43:25] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2024-05-29 18:43:25] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-05-29 18:43:26] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:43:26] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-29 18:43:26] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:43:26] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 2 ms to minimize.
[2024-05-29 18:43:27] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:43:27] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 13/753 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:43:32] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:43:33] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:43:34] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-29 18:43:35] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-05-29 18:43:36] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 5/758 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:43:41] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 1/759 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 759 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 65/65 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in LTL mode, iteration 1 : 337/358 places, 302/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60431 ms. Remains : 337/358 places, 302/323 transitions.
[2024-05-29 18:43:46] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:43:46] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:43:46] [INFO ] Input system was already deterministic with 302 transitions.
[2024-05-29 18:43:46] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:43:46] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:43:46] [INFO ] Time to serialize gal into /tmp/CTLFireability11471061545045330074.gal : 2 ms
[2024-05-29 18:43:46] [INFO ] Time to serialize properties into /tmp/CTLFireability1492196591044684417.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/CTLFireability11471061545045330074.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1492196591044684417.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 18:44:17] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:44:17] [INFO ] Applying decomposition
[2024-05-29 18:44:17] [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/graph7208054542241408596.txt' '-o' '/tmp/graph7208054542241408596.bin' '-w' '/tmp/graph7208054542241408596.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7208054542241408596.bin' '-l' '-1' '-v' '-w' '/tmp/graph7208054542241408596.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:44:17] [INFO ] Decomposing Gal with order
[2024-05-29 18:44:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:44:17] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-29 18:44:17] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:44:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:44:17] [INFO ] Time to serialize gal into /tmp/CTLFireability16811006516580849868.gal : 7 ms
[2024-05-29 18:44:17] [INFO ] Time to serialize properties into /tmp/CTLFireability6500078927025214444.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/CTLFireability16811006516580849868.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6500078927025214444.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,2.0824e+32,10.7186,268932,4512,29,435413,571,646,1.5594e+06,47,1434,0


Converting to forward existential form...Done !
original formula: (A(!(E(((i9.u52.p170==1)&&(i11.u71.p232==1)) U ((i16.u99.p324==1)&&(i17.u117.p386==1)))) U ((AG(((i4.u12.p38==1)&&(i1.u21.p71==1))) * EG(...349
=> equivalent forward existential formula: [(EY((Init * !(!((E(!(((!(E(TRUE U !(((i4.u12.p38==1)&&(i1.u21.p71==1))))) * EG(((i2.u3.p8!=1)&&((i11.u71.p234==...808
Reverse transition relation is NOT exact ! Due to transitions t49, t52, t95, t98, t141, t144, t190, t234, t240, t272, t276, t285, t290, t294, t299, i0.t117...1084
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 341 transition count 306
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 341 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 340 transition count 305
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 340 transition count 305
Applied a total of 36 rules in 20 ms. Remains 340 /358 variables (removed 18) and now considering 305/323 (removed 18) transitions.
// Phase 1: matrix 305 rows 340 cols
[2024-05-29 18:44:47] [INFO ] Computed 56 invariants in 4 ms
[2024-05-29 18:44:47] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-29 18:44:47] [INFO ] Invariant cache hit.
[2024-05-29 18:44:47] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 304 sub problems to find dead transitions.
[2024-05-29 18:44:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:44:50] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-29 18:44:50] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:44:50] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:44:50] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:44:50] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:44:50] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:44:51] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:44:51] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:44:51] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 0 ms to minimize.
[2024-05-29 18:44:51] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:44:51] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:44:51] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:44:51] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:44:51] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-29 18:44:51] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-29 18:44:51] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-29 18:44:51] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 0 ms to minimize.
[2024-05-29 18:44:52] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:44:52] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:44:52] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:44:53] [INFO ] Deduced a trap composed of 18 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:44:53] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:44:53] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:44:53] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 2 ms to minimize.
[2024-05-29 18:44:53] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:44:53] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:44:53] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:44:53] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:44:53] [INFO ] Deduced a trap composed of 23 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:44:53] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:44:53] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:44:53] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:44:53] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:44:54] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:44:54] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 18:44:54] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:44:54] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:44:54] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:44:54] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:44:54] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:44:57] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 6 (OVERLAPS) 305/645 variables, 340/437 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:45:03] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-05-29 18:45:03] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:45:03] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 3/440 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:45:04] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:45:05] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:45:07] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:45:08] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-29 18:45:09] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 3/445 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:45:12] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:45:12] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-29 18:45:14] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 3/448 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 645/645 variables, and 448 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 52/52 constraints]
Escalating to Integer solving :Problem set: 0 solved, 304 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/339 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 1 (OVERLAPS) 1/340 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/340 variables, 52/108 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 4 (OVERLAPS) 305/645 variables, 340/448 constraints. Problems are: Problem set: 0 solved, 304 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/645 variables, 304/752 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:45:22] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-29 18:45:23] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:45:23] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-29 18:45:23] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:45:24] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:45:24] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 1 ms to minimize.
[2024-05-29 18:45:24] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 2 ms to minimize.
[2024-05-29 18:45:25] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:45:25] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:45:25] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-29 18:45:26] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-29 18:45:26] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-05-29 18:45:26] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/645 variables, 14/766 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:45:31] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-29 18:45:33] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:45:33] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:45:34] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 2 ms to minimize.
[2024-05-29 18:45:34] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/645 variables, 5/771 constraints. Problems are: Problem set: 0 solved, 304 unsolved
[2024-05-29 18:45:39] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 1/772 constraints. Problems are: Problem set: 0 solved, 304 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 645/645 variables, and 772 constraints, problems are : Problem set: 0 solved, 304 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 340/340 constraints, PredecessorRefiner: 304/304 constraints, Known Traps: 72/72 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 304 unsolved
Search for dead transitions found 0 dead transitions in 60052ms
Starting structural reductions in LTL mode, iteration 1 : 340/358 places, 305/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60453 ms. Remains : 340/358 places, 305/323 transitions.
[2024-05-29 18:45:47] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:45:47] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:45:47] [INFO ] Input system was already deterministic with 305 transitions.
[2024-05-29 18:45:47] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:45:47] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:45:47] [INFO ] Time to serialize gal into /tmp/CTLFireability8748870173009734574.gal : 1 ms
[2024-05-29 18:45:47] [INFO ] Time to serialize properties into /tmp/CTLFireability11463425643832825478.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/CTLFireability8748870173009734574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11463425643832825478.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-29 18:46:17] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:46:17] [INFO ] Applying decomposition
[2024-05-29 18:46:17] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph10569179323188764068.txt' '-o' '/tmp/graph10569179323188764068.bin' '-w' '/tmp/graph10569179323188764068.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10569179323188764068.bin' '-l' '-1' '-v' '-w' '/tmp/graph10569179323188764068.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:46:17] [INFO ] Decomposing Gal with order
[2024-05-29 18:46:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:46:17] [INFO ] Removed a total of 50 redundant transitions.
[2024-05-29 18:46:17] [INFO ] Flatten gal took : 22 ms
[2024-05-29 18:46:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:46:17] [INFO ] Time to serialize gal into /tmp/CTLFireability7916149247439061856.gal : 15 ms
[2024-05-29 18:46:17] [INFO ] Time to serialize properties into /tmp/CTLFireability1463193233083153291.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/CTLFireability7916149247439061856.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1463193233083153291.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.69958e+32,17.592,461456,4129,51,875328,564,649,1.9999e+06,64,1561,0


Converting to forward existential form...Done !
original formula: E(E(EF(AX(((i17.i0.u86.p268==1)&&(i17.i0.u86.p270==1)))) U (i3.i1.u9.p21==1)) U E(AX(A((i12.i1.u55.p167==1) U (i6.u46.p147!=1))) U A(!(A(...268
=> equivalent forward existential formula: [((FwdU(FwdU(Init,E(E(TRUE U !(EX(!(((i17.i0.u86.p268==1)&&(i17.i0.u86.p270==1)))))) U (i3.i1.u9.p21==1))),!(EX(...858
Reverse transition relation is NOT exact ! Due to transitions t52, t55, t95, t98, t142, t145, t197, t237, t240, t270, t278, t290, t302, i0.i1.t49, i0.i1.u1...1278
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 338 transition count 303
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 338 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 337 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 337 transition count 302
Applied a total of 42 rules in 15 ms. Remains 337 /358 variables (removed 21) and now considering 302/323 (removed 21) transitions.
// Phase 1: matrix 302 rows 337 cols
[2024-05-29 18:46:47] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 18:46:48] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-29 18:46:48] [INFO ] Invariant cache hit.
[2024-05-29 18:46:48] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-29 18:46:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 17 places in 18 ms of which 0 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 19 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 0 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 0 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:46:51] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 0 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 19 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:46:52] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:46:53] [INFO ] Deduced a trap composed of 16 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:46:53] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:46:53] [INFO ] Deduced a trap composed of 18 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:46:53] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:46:53] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:46:53] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-05-29 18:46:54] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-29 18:46:54] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:46:54] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:46:54] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:46:54] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-29 18:46:54] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-29 18:46:54] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:46:54] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:46:54] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
[2024-05-29 18:46:54] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-29 18:46:54] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 17/93 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:46:57] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:46:59] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/337 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 302/639 variables, 337/432 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:47:04] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:47:04] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 2/434 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:47:06] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:47:12] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:47:14] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:47:14] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 1 ms to minimize.
[2024-05-29 18:47:15] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:47:16] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/639 variables, and 440 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 47/47 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/337 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/337 variables, 47/103 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:47:20] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/337 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/337 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (OVERLAPS) 302/639 variables, 337/441 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 301/742 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:47:24] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-05-29 18:47:25] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 2 ms to minimize.
[2024-05-29 18:47:25] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:47:26] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:47:26] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:47:26] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:47:27] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-29 18:47:28] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 2 ms to minimize.
[2024-05-29 18:47:28] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 9/751 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:47:34] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:47:35] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-29 18:47:35] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-29 18:47:37] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-05-29 18:47:37] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 5/756 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:47:43] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 757 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 337/337 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 63/63 constraints]
After SMT, in 60050ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Starting structural reductions in LTL mode, iteration 1 : 337/358 places, 302/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60427 ms. Remains : 337/358 places, 302/323 transitions.
[2024-05-29 18:47:48] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:47:48] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:47:48] [INFO ] Input system was already deterministic with 302 transitions.
[2024-05-29 18:47:48] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:47:48] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:47:48] [INFO ] Time to serialize gal into /tmp/CTLFireability6526319444375017657.gal : 2 ms
[2024-05-29 18:47:48] [INFO ] Time to serialize properties into /tmp/CTLFireability8461877117839431333.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/CTLFireability6526319444375017657.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8461877117839431333.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 18:48:18] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:48:18] [INFO ] Applying decomposition
[2024-05-29 18:48:18] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17583748130850716619.txt' '-o' '/tmp/graph17583748130850716619.bin' '-w' '/tmp/graph17583748130850716619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17583748130850716619.bin' '-l' '-1' '-v' '-w' '/tmp/graph17583748130850716619.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:48:18] [INFO ] Decomposing Gal with order
[2024-05-29 18:48:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:48:18] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-29 18:48:18] [INFO ] Flatten gal took : 24 ms
[2024-05-29 18:48:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 18:48:18] [INFO ] Time to serialize gal into /tmp/CTLFireability2779027810642181424.gal : 3 ms
[2024-05-29 18:48:18] [INFO ] Time to serialize properties into /tmp/CTLFireability17123734582238283386.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/CTLFireability2779027810642181424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17123734582238283386.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.86584e+32,9.41442,253924,3123,45,481914,571,634,1.25221e+06,57,1830,0


Converting to forward existential form...Done !
original formula: A(AX((i9.i0.u33.p98==1)) U EF((EF((i9.i2.u44.p137==1)) + (i0.u92.p299==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (E(TRUE U (i9.i2.u44.p137==1)) + (i0.u92.p299==1))))))) * !(E(!(E(TRUE U (E(TRUE U (i9...309
Reverse transition relation is NOT exact ! Due to transitions t55, t95, t98, t147, t194, t234, t237, t267, t276, t285, t299, i0.t71, i0.u92.t75, i1.t294, i...1203
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 358/358 places, 323/323 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 339 transition count 304
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 339 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 338 transition count 303
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 338 transition count 303
Applied a total of 40 rules in 9 ms. Remains 338 /358 variables (removed 20) and now considering 303/323 (removed 20) transitions.
// Phase 1: matrix 303 rows 338 cols
[2024-05-29 18:48:48] [INFO ] Computed 56 invariants in 1 ms
[2024-05-29 18:48:48] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-29 18:48:48] [INFO ] Invariant cache hit.
[2024-05-29 18:48:48] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 302 sub problems to find dead transitions.
[2024-05-29 18:48:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:48:51] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-05-29 18:48:52] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-29 18:48:52] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:48:52] [INFO ] Deduced a trap composed of 19 places in 20 ms of which 0 ms to minimize.
[2024-05-29 18:48:52] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 0 ms to minimize.
[2024-05-29 18:48:52] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-29 18:48:52] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:48:52] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-05-29 18:48:52] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 0 ms to minimize.
[2024-05-29 18:48:52] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:48:52] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:48:52] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:48:53] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:48:53] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:48:53] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-05-29 18:48:53] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 0 ms to minimize.
[2024-05-29 18:48:53] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:48:53] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-29 18:48:53] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:48:53] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:48:53] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:48:54] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-29 18:48:54] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:48:54] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 0 ms to minimize.
[2024-05-29 18:48:54] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
[2024-05-29 18:48:54] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:48:54] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-29 18:48:55] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:48:55] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-29 18:48:55] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2024-05-29 18:48:55] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 18:48:55] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-29 18:48:55] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-29 18:48:55] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 1 ms to minimize.
[2024-05-29 18:48:55] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-29 18:48:55] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 16/92 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:48:58] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-29 18:48:58] [INFO ] Deduced a trap composed of 21 places in 29 ms of which 0 ms to minimize.
[2024-05-29 18:48:58] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:49:00] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 0 ms to minimize.
[2024-05-29 18:49:00] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-29 18:49:00] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/338 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 303/641 variables, 338/436 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:49:06] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:49:08] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:49:13] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:49:15] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-29 18:49:16] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:49:17] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 3/442 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:49:18] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 641/641 variables, and 443 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/337 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (OVERLAPS) 1/338 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/338 variables, 49/105 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:49:21] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (OVERLAPS) 303/641 variables, 338/444 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/641 variables, 302/746 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:49:26] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 2 ms to minimize.
[2024-05-29 18:49:26] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 3 ms to minimize.
[2024-05-29 18:49:27] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:49:27] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-29 18:49:27] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-29 18:49:27] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-29 18:49:27] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 2 ms to minimize.
[2024-05-29 18:49:28] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 2 ms to minimize.
[2024-05-29 18:49:28] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2024-05-29 18:49:29] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
[2024-05-29 18:49:29] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-29 18:49:29] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:49:30] [INFO ] Deduced a trap composed of 22 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:49:30] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-29 18:49:30] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/641 variables, 15/761 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:49:34] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 2 ms to minimize.
[2024-05-29 18:49:35] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-05-29 18:49:36] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/641 variables, 3/764 constraints. Problems are: Problem set: 0 solved, 302 unsolved
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:49:42] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 2/766 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 641/641 variables, and 766 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, State Equation: 338/338 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 70/70 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 60058ms
Starting structural reductions in LTL mode, iteration 1 : 338/358 places, 303/323 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60364 ms. Remains : 338/358 places, 303/323 transitions.
[2024-05-29 18:49:48] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:49:48] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:49:48] [INFO ] Input system was already deterministic with 303 transitions.
[2024-05-29 18:49:48] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:49:48] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:49:48] [INFO ] Time to serialize gal into /tmp/CTLFireability13298228130882039395.gal : 1 ms
[2024-05-29 18:49:48] [INFO ] Time to serialize properties into /tmp/CTLFireability56700500845187396.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/CTLFireability13298228130882039395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability56700500845187396.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 18:50:19] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:50:19] [INFO ] Applying decomposition
[2024-05-29 18:50:19] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15705006638127345746.txt' '-o' '/tmp/graph15705006638127345746.bin' '-w' '/tmp/graph15705006638127345746.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15705006638127345746.bin' '-l' '-1' '-v' '-w' '/tmp/graph15705006638127345746.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:50:19] [INFO ] Decomposing Gal with order
[2024-05-29 18:50:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:50:19] [INFO ] Removed a total of 51 redundant transitions.
[2024-05-29 18:50:19] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:50:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-29 18:50:19] [INFO ] Time to serialize gal into /tmp/CTLFireability2718745775650826802.gal : 6 ms
[2024-05-29 18:50:19] [INFO ] Time to serialize properties into /tmp/CTLFireability17234610390534604615.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/CTLFireability2718745775650826802.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17234610390534604615.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,2.08935e+32,8.94491,229912,4654,29,421781,415,610,1.0098e+06,45,1146,0


Converting to forward existential form...Done !
original formula: !(A((EX(!(((i0.i3.u19.p61!=1) * EG((i9.i4.u74.p230==1))))) + AF((i0.i1.u6.p17==1))) U !(EG(((EF(((i2.i1.u34.p108==1)&&(i5.u50.p160==1))) ...249
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(((E(TRUE U ((i2.i1.u34.p108==1)&&(i5.u50.p160==1))) + ((i20.u115.p366==1)&&(i5.u50.p161...674
Reverse transition relation is NOT exact ! Due to transitions t55, t95, t98, t148, t189, t192, t235, t238, t268, t273, t277, t291, t295, i0.t241, i0.i1.u6....1193
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
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
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
[2024-05-29 18:50:49] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:50:49] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:50:49] [INFO ] Applying decomposition
[2024-05-29 18:50:49] [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/graph5982864016251680015.txt' '-o' '/tmp/graph5982864016251680015.bin' '-w' '/tmp/graph5982864016251680015.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5982864016251680015.bin' '-l' '-1' '-v' '-w' '/tmp/graph5982864016251680015.weights' '-q' '0' '-e' '0.001'
[2024-05-29 18:50:49] [INFO ] Decomposing Gal with order
[2024-05-29 18:50:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 18:50:49] [INFO ] Removed a total of 38 redundant transitions.
[2024-05-29 18:50:49] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:50:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-29 18:50:49] [INFO ] Time to serialize gal into /tmp/CTLFireability23213690674553848.gal : 3 ms
[2024-05-29 18:50:49] [INFO ] Time to serialize properties into /tmp/CTLFireability314149694859986775.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/CTLFireability23213690674553848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability314149694859986775.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 -...259
No direction supplied, using forward translation only.
Parsed 14 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.58056e+32,31.9356,788136,6669,49,1.40143e+06,844,752,4.42982e+06,73,2705,0


Converting to forward existential form...Done !
original formula: EF(AG(((i3.i2.u19.p60==1) * AF((i3.i2.u19.p60==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(((i3.i2.u19.p60==1) * !(EG(!((i3.i2.u19.p60==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t54, t60, t107, t151, t154, t212, t255, t258, t288, t296, t297, t298, t320, i0.i1.u2.t265, i0...1472
ITS-tools command line returned an error code 137
[2024-05-29 19:17:48] [INFO ] Applying decomposition
[2024-05-29 19:17:49] [INFO ] Flatten gal took : 7 ms
[2024-05-29 19:17:49] [INFO ] Decomposing Gal with order
[2024-05-29 19:17:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:17:49] [INFO ] Removed a total of 10 redundant transitions.
[2024-05-29 19:17:49] [INFO ] Flatten gal took : 17 ms
[2024-05-29 19:17:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 4 ms.
[2024-05-29 19:17:49] [INFO ] Time to serialize gal into /tmp/CTLFireability15779575815333675525.gal : 3 ms
[2024-05-29 19:17:49] [INFO ] Time to serialize properties into /tmp/CTLFireability8176774196192000986.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/CTLFireability15779575815333675525.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8176774196192000986.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 14 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-005B"
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-005B, 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-171683761400602"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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