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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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 May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 21:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 11 21:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 21:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 119K 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 ShieldRVt-PT-010B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717076853156

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-010B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-30 13:47:34] [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-30 13:47:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 13:47:34] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-30 13:47:34] [INFO ] Transformed 503 places.
[2024-05-30 13:47:34] [INFO ] Transformed 503 transitions.
[2024-05-30 13:47:34] [INFO ] Found NUPN structural information;
[2024-05-30 13:47:34] [INFO ] Parsed PT model containing 503 places and 503 transitions and 1186 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 125 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 503/503 transitions.
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 68 place count 435 transition count 435
Iterating global reduction 0 with 68 rules applied. Total rules applied 136 place count 435 transition count 435
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 137 place count 434 transition count 434
Iterating global reduction 0 with 1 rules applied. Total rules applied 138 place count 434 transition count 434
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 139 place count 433 transition count 433
Iterating global reduction 0 with 1 rules applied. Total rules applied 140 place count 433 transition count 433
Applied a total of 140 rules in 100 ms. Remains 433 /503 variables (removed 70) and now considering 433/503 (removed 70) transitions.
// Phase 1: matrix 433 rows 433 cols
[2024-05-30 13:47:34] [INFO ] Computed 41 invariants in 27 ms
[2024-05-30 13:47:34] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-30 13:47:35] [INFO ] Invariant cache hit.
[2024-05-30 13:47:35] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 594 ms to find 0 implicit places.
Running 432 sub problems to find dead transitions.
[2024-05-30 13:47:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/433 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 21 places in 118 ms of which 12 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 23 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:47:41] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 21 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:47:42] [INFO ] Deduced a trap composed of 20 places in 22 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 24 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 2 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:47:43] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:47:44] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:47:45] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:47:45] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:47:45] [INFO ] Deduced a trap composed of 25 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:47:45] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 1 ms to minimize.
[2024-05-30 13:47:45] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:47:45] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:47:45] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:47:45] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:47:45] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:47:45] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:47:46] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:47:46] [INFO ] Deduced a trap composed of 27 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:47:46] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:47:46] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-30 13:47:51] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 0 ms to minimize.
[2024-05-30 13:47:51] [INFO ] Deduced a trap composed of 29 places in 27 ms of which 1 ms to minimize.
[2024-05-30 13:47:51] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:47:51] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:47:51] [INFO ] Deduced a trap composed of 28 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:47:51] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:47:51] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:47:51] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:47:51] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 0 ms to minimize.
[2024-05-30 13:47:51] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 0 ms to minimize.
[2024-05-30 13:47:52] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 2 ms to minimize.
[2024-05-30 13:47:52] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-30 13:47:54] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 0 ms to minimize.
[2024-05-30 13:47:54] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:47:55] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:47:55] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-05-30 13:47:55] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 2 ms to minimize.
[2024-05-30 13:47:55] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:47:55] [INFO ] Deduced a trap composed of 30 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 7/100 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-30 13:47:58] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:47:58] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:47:58] [INFO ] Deduced a trap composed of 29 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 8 (OVERLAPS) 433/866 variables, 433/536 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 866/866 variables, and 536 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 1/433 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/433 variables, 62/103 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/433 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 433/866 variables, 433/536 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/866 variables, 432/968 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-30 13:48:12] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 3 ms to minimize.
[2024-05-30 13:48:12] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:48:12] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:48:13] [INFO ] Deduced a trap composed of 38 places in 140 ms of which 2 ms to minimize.
[2024-05-30 13:48:13] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-30 13:48:13] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:48:13] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:48:13] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-05-30 13:48:13] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-05-30 13:48:14] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-05-30 13:48:14] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 2 ms to minimize.
[2024-05-30 13:48:15] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 3 ms to minimize.
[2024-05-30 13:48:15] [INFO ] Deduced a trap composed of 29 places in 123 ms of which 2 ms to minimize.
[2024-05-30 13:48:15] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-05-30 13:48:15] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:48:15] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 2 ms to minimize.
[2024-05-30 13:48:15] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:48:16] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:48:16] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-05-30 13:48:16] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/866 variables, 20/988 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-30 13:48:18] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 2 ms to minimize.
[2024-05-30 13:48:19] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-30 13:48:20] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 3 ms to minimize.
[2024-05-30 13:48:20] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-30 13:48:20] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 3 ms to minimize.
[2024-05-30 13:48:20] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-30 13:48:21] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 3 ms to minimize.
[2024-05-30 13:48:21] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-30 13:48:21] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 2 ms to minimize.
[2024-05-30 13:48:22] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 2 ms to minimize.
[2024-05-30 13:48:22] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:48:22] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 3 ms to minimize.
[2024-05-30 13:48:22] [INFO ] Deduced a trap composed of 39 places in 137 ms of which 3 ms to minimize.
[2024-05-30 13:48:22] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 2 ms to minimize.
[2024-05-30 13:48:23] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
[2024-05-30 13:48:23] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 3 ms to minimize.
[2024-05-30 13:48:23] [INFO ] Deduced a trap composed of 24 places in 121 ms of which 2 ms to minimize.
[2024-05-30 13:48:24] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:48:24] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 2 ms to minimize.
[2024-05-30 13:48:24] [INFO ] Deduced a trap composed of 34 places in 117 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/866 variables, 20/1008 constraints. Problems are: Problem set: 0 solved, 432 unsolved
[2024-05-30 13:48:27] [INFO ] Deduced a trap composed of 30 places in 127 ms of which 2 ms to minimize.
[2024-05-30 13:48:27] [INFO ] Deduced a trap composed of 31 places in 133 ms of which 2 ms to minimize.
[2024-05-30 13:48:30] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 3 ms to minimize.
[2024-05-30 13:48:30] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:48:30] [INFO ] Deduced a trap composed of 30 places in 141 ms of which 3 ms to minimize.
[2024-05-30 13:48:30] [INFO ] Deduced a trap composed of 48 places in 120 ms of which 2 ms to minimize.
[2024-05-30 13:48:30] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:48:30] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 3 ms to minimize.
[2024-05-30 13:48:30] [INFO ] Deduced a trap composed of 29 places in 114 ms of which 2 ms to minimize.
[2024-05-30 13:48:31] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 2 ms to minimize.
[2024-05-30 13:48:31] [INFO ] Deduced a trap composed of 33 places in 92 ms of which 3 ms to minimize.
[2024-05-30 13:48:32] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 3 ms to minimize.
[2024-05-30 13:48:32] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 3 ms to minimize.
[2024-05-30 13:48:32] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:48:32] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:48:32] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 3 ms to minimize.
[2024-05-30 13:48:33] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-05-30 13:48:33] [INFO ] Deduced a trap composed of 35 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:48:33] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:48:33] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/866 variables, 20/1028 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 866/866 variables, and 1028 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 122/122 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 433/503 places, 433/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60891 ms. Remains : 433/503 places, 433/503 transitions.
Support contains 125 out of 433 places after structural reductions.
[2024-05-30 13:48:35] [INFO ] Flatten gal took : 55 ms
[2024-05-30 13:48:35] [INFO ] Flatten gal took : 22 ms
[2024-05-30 13:48:35] [INFO ] Input system was already deterministic with 433 transitions.
RANDOM walk for 40000 steps (8 resets) in 1402 ms. (28 steps per ms) remains 4/84 properties
BEST_FIRST walk for 40003 steps (8 resets) in 160 ms. (248 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 3/3 properties
[2024-05-30 13:48:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 154/166 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 267/433 variables, 27/41 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 13:48:36] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:48:36] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-30 13:48:36] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-30 13:48:36] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 2 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 1 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 2 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2024-05-30 13:48:37] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/433 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 433/866 variables, 433/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/866 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/866 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 866/866 variables, and 489 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1447 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 154/166 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 13:48:38] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/166 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/166 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 267/433 variables, 27/42 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 15/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 13:48:38] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-05-30 13:48:38] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 433/866 variables, 433/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/866 variables, 3/495 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 13:48:38] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-05-30 13:48:38] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 1 ms to minimize.
[2024-05-30 13:48:38] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:48:38] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:48:38] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/866 variables, 5/500 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 13:48:39] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-05-30 13:48:39] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/866 variables, 2/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 13:48:39] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 2 ms to minimize.
[2024-05-30 13:48:39] [INFO ] Deduced a trap composed of 29 places in 127 ms of which 3 ms to minimize.
[2024-05-30 13:48:39] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/866 variables, 3/505 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 13:48:39] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/866 variables, 1/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-30 13:48:39] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-05-30 13:48:39] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 2 ms to minimize.
[2024-05-30 13:48:39] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-30 13:48:40] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/866 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/866 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/866 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 866/866 variables, and 510 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2260 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 433/433 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 33/33 constraints]
After SMT, in 3714ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1427 ms.
Support contains 12 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 433/433 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 433 transition count 325
Reduce places removed 108 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 109 rules applied. Total rules applied 217 place count 325 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 218 place count 324 transition count 324
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 218 place count 324 transition count 262
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 342 place count 262 transition count 262
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 371 place count 233 transition count 233
Iterating global reduction 3 with 29 rules applied. Total rules applied 400 place count 233 transition count 233
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 400 place count 233 transition count 214
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 438 place count 214 transition count 214
Performed 86 Post agglomeration using F-continuation condition.Transition count delta: 86
Deduced a syphon composed of 86 places in 0 ms
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 172 rules applied. Total rules applied 610 place count 128 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 611 place count 128 transition count 127
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 4 with 2 rules applied. Total rules applied 613 place count 127 transition count 126
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 669 place count 99 transition count 151
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 670 place count 99 transition count 150
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 671 place count 98 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 672 place count 97 transition count 149
Applied a total of 672 rules in 81 ms. Remains 97 /433 variables (removed 336) and now considering 149/433 (removed 284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 97/433 places, 149/433 transitions.
RANDOM walk for 40000 steps (13 resets) in 1004 ms. (39 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 105 ms. (377 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 1/2 properties
// Phase 1: matrix 149 rows 97 cols
[2024-05-30 13:48:42] [INFO ] Computed 40 invariants in 1 ms
[2024-05-30 13:48:42] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/73 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 86/159 variables, 32/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-30 13:48:42] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/161 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/161 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 65/226 variables, 27/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 12/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 2/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/227 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/227 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/227 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 5/232 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/232 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 14/246 variables, 11/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/246 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/246 variables, 6/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/246 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/246 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 162 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 97/97 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/73 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 6/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/73 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 86/159 variables, 32/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/161 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/161 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/161 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 65/226 variables, 27/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 12/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/226 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/227 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/227 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/227 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/232 variables, 2/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/232 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 14/246 variables, 11/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/246 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/246 variables, 6/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/246 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/246 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 163 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 97/97 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 293ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 149/149 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 96 transition count 148
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 96 transition count 145
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 93 transition count 145
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 90 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 88 transition count 140
Applied a total of 16 rules in 12 ms. Remains 88 /97 variables (removed 9) and now considering 140/149 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 88/97 places, 140/149 transitions.
RANDOM walk for 40000 steps (13 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1504399 steps, run timeout after 3001 ms. (steps per millisecond=501 ) properties seen :0 out of 1
Probabilistic random walk after 1504399 steps, saw 956010 distinct states, run finished after 3005 ms. (steps per millisecond=500 ) properties seen :0
// Phase 1: matrix 140 rows 88 cols
[2024-05-30 13:48:45] [INFO ] Computed 40 invariants in 0 ms
[2024-05-30 13:48:45] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/22 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/69 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 79/148 variables, 30/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 63/211 variables, 26/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 13/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 17/228 variables, 10/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/228 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 88/88 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/22 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 47/69 variables, 22/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 79/148 variables, 30/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 15/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/148 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 63/211 variables, 26/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 13/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/211 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 17/228 variables, 10/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/228 variables, 5/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/228 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/228 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 92 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 88/88 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 180ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 5 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 140/140 transitions.
Applied a total of 0 rules in 5 ms. Remains 88 /88 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 88/88 places, 140/140 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 140/140 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2024-05-30 13:48:45] [INFO ] Invariant cache hit.
[2024-05-30 13:48:45] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-30 13:48:45] [INFO ] Invariant cache hit.
[2024-05-30 13:48:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-30 13:48:45] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-30 13:48:45] [INFO ] Redundant transitions in 3 ms returned []
Running 138 sub problems to find dead transitions.
[2024-05-30 13:48:45] [INFO ] Invariant cache hit.
[2024-05-30 13:48:45] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 2/88 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 140/228 variables, 88/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 10/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 138 constraints, problems are : Problem set: 0 solved, 138 unsolved in 2050 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 88/88 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 2/88 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 140/228 variables, 88/128 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 10/138 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 138/276 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 276 constraints, problems are : Problem set: 0 solved, 138 unsolved in 2439 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 88/88 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 0/0 constraints]
After SMT, in 4532ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 4534ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4692 ms. Remains : 88/88 places, 140/140 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 37 edges and 88 vertex of which 4 / 88 are part of one of the 2 SCC in 6 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 274 edges and 86 vertex of which 84 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 6 place count 83 transition count 131
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 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 81 transition count 130
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 81 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 81 transition count 123
Applied a total of 16 rules in 26 ms. Remains 81 /88 variables (removed 7) and now considering 123/140 (removed 17) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 123 rows 81 cols
[2024-05-30 13:48:50] [INFO ] Computed 37 invariants in 1 ms
[2024-05-30 13:48:50] [INFO ] [Real]Absence check using 37 positive place invariants in 4 ms returned sat
[2024-05-30 13:48:50] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 13:48:50] [INFO ] [Nat]Absence check using 37 positive place invariants in 4 ms returned sat
[2024-05-30 13:48:50] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 13:48:50] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-30 13:48:50] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 13:48:50] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 13:48:50] [INFO ] After 95ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 209 ms.
[2024-05-30 13:48:50] [INFO ] Flatten gal took : 29 ms
[2024-05-30 13:48:50] [INFO ] Flatten gal took : 18 ms
[2024-05-30 13:48:50] [INFO ] Input system was already deterministic with 433 transitions.
Computed a total of 129 stabilizing places and 129 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 397 transition count 397
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 397 transition count 397
Applied a total of 72 rules in 13 ms. Remains 397 /433 variables (removed 36) and now considering 397/433 (removed 36) transitions.
// Phase 1: matrix 397 rows 397 cols
[2024-05-30 13:48:50] [INFO ] Computed 41 invariants in 3 ms
[2024-05-30 13:48:50] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-05-30 13:48:50] [INFO ] Invariant cache hit.
[2024-05-30 13:48:51] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-30 13:48:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:48:55] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:48:55] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:48:56] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:48:56] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:48:56] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2024-05-30 13:48:56] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:48:57] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:48:57] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:48:57] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:48:57] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:48:58] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-30 13:48:58] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:49:00] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:49:04] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-30 13:49:04] [INFO ] Deduced a trap composed of 23 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (OVERLAPS) 397/794 variables, 397/453 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:49:13] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/794 variables, 1/454 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/794 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.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 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 1.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 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 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.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 1.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 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 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 1.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.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 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 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 0.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 1.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 794/794 variables, and 454 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (OVERLAPS) 397/794 variables, 397/454 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/794 variables, 396/850 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:49:26] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 3 ms to minimize.
[2024-05-30 13:49:26] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 2 ms to minimize.
[2024-05-30 13:49:27] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 3 ms to minimize.
[2024-05-30 13:49:27] [INFO ] Deduced a trap composed of 21 places in 174 ms of which 2 ms to minimize.
[2024-05-30 13:49:27] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 3 ms to minimize.
[2024-05-30 13:49:27] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
[2024-05-30 13:49:28] [INFO ] Deduced a trap composed of 27 places in 129 ms of which 2 ms to minimize.
[2024-05-30 13:49:28] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 2 ms to minimize.
[2024-05-30 13:49:28] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-05-30 13:49:29] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:49:29] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-30 13:49:29] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 1 ms to minimize.
[2024-05-30 13:49:29] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-05-30 13:49:29] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 2 ms to minimize.
[2024-05-30 13:49:29] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 1 ms to minimize.
[2024-05-30 13:49:29] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:49:29] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:49:30] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:49:30] [INFO ] Deduced a trap composed of 25 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:49:30] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 20/870 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:49:32] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-05-30 13:49:32] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:49:33] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:49:33] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:49:33] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 3 ms to minimize.
[2024-05-30 13:49:34] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:49:34] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:49:34] [INFO ] Deduced a trap composed of 31 places in 109 ms of which 2 ms to minimize.
[2024-05-30 13:49:34] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:49:35] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:49:35] [INFO ] Deduced a trap composed of 33 places in 108 ms of which 2 ms to minimize.
[2024-05-30 13:49:35] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:49:35] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:49:36] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:49:36] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 3 ms to minimize.
[2024-05-30 13:49:36] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:49:36] [INFO ] Deduced a trap composed of 35 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:49:36] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:49:36] [INFO ] Deduced a trap composed of 31 places in 93 ms of which 3 ms to minimize.
[2024-05-30 13:49:37] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/794 variables, 20/890 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:49:39] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 2 ms to minimize.
[2024-05-30 13:49:41] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 3 ms to minimize.
[2024-05-30 13:49:41] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 3 ms to minimize.
[2024-05-30 13:49:42] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:49:42] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-30 13:49:42] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 3 ms to minimize.
[2024-05-30 13:49:42] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:49:43] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:49:43] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:49:43] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:49:43] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 3 ms to minimize.
[2024-05-30 13:49:44] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:49:44] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 3 ms to minimize.
[2024-05-30 13:49:44] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 3 ms to minimize.
[2024-05-30 13:49:44] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:49:44] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:49:44] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 3 ms to minimize.
[2024-05-30 13:49:45] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:49:45] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:49:45] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/794 variables, 20/910 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:49:49] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 3 ms to minimize.
[2024-05-30 13:49:49] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:49:49] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:49:50] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:49:50] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:49:50] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:49:50] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-30 13:49:50] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 918 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 84/84 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 397/433 places, 397/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60419 ms. Remains : 397/433 places, 397/433 transitions.
[2024-05-30 13:49:51] [INFO ] Flatten gal took : 15 ms
[2024-05-30 13:49:51] [INFO ] Flatten gal took : 15 ms
[2024-05-30 13:49:51] [INFO ] Input system was already deterministic with 397 transitions.
[2024-05-30 13:49:51] [INFO ] Flatten gal took : 13 ms
[2024-05-30 13:49:51] [INFO ] Flatten gal took : 13 ms
[2024-05-30 13:49:51] [INFO ] Time to serialize gal into /tmp/CTLFireability7875709733607323397.gal : 10 ms
[2024-05-30 13:49:51] [INFO ] Time to serialize properties into /tmp/CTLFireability2389959348639211888.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7875709733607323397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2389959348639211888.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,8.46105e+35,14.4108,414596,2,7793,5,1.02844e+06,6,0,1987,3.19126e+06,0


Converting to forward existential form...Done !
original formula: E(!(EX(AX(((p137==1)&&(p475==1))))) U ((!((EG((p46!=1)) * AF(((p196==1)||(p140==1))))) + (p253==1)) + (((!(((((p412!=1)&&(p266==1))&&((p3...302
=> equivalent forward existential formula: ((([(FwdU(Init,!(EX(!(EX(!(((p137==1)&&(p475==1)))))))) * !(EG((p46!=1))))] != FALSE + [FwdG(FwdU(Init,!(EX(!(EX...754
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t13, t17, t20, t22, t26, t30, t31, t37, t41, t46, t50, t55, t59, t62, t66, t67, t73, ...687
Detected timeout of ITS tools.
[2024-05-30 13:50:21] [INFO ] Flatten gal took : 20 ms
[2024-05-30 13:50:21] [INFO ] Applying decomposition
[2024-05-30 13:50:21] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1078157691535936133.txt' '-o' '/tmp/graph1078157691535936133.bin' '-w' '/tmp/graph1078157691535936133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1078157691535936133.bin' '-l' '-1' '-v' '-w' '/tmp/graph1078157691535936133.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:50:21] [INFO ] Decomposing Gal with order
[2024-05-30 13:50:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:50:21] [INFO ] Removed a total of 97 redundant transitions.
[2024-05-30 13:50:21] [INFO ] Flatten gal took : 67 ms
[2024-05-30 13:50:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-30 13:50:21] [INFO ] Time to serialize gal into /tmp/CTLFireability12015035195842426183.gal : 11 ms
[2024-05-30 13:50:21] [INFO ] Time to serialize properties into /tmp/CTLFireability7944202908390391398.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/CTLFireability12015035195842426183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7944202908390391398.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,8.46105e+35,1.04019,37752,659,38,61131,729,646,144264,52,1969,0


Converting to forward existential form...Done !
original formula: E(!(EX(AX(((i5.u44.p137==1)&&(i19.i2.u149.p475==1))))) U ((!((EG((i0.i4.u16.p46!=1)) * AF(((i6.i2.u60.p196==1)||(i5.u47.p140==1))))) + (i...483
=> equivalent forward existential formula: ((([(FwdU(Init,!(EX(!(EX(!(((i5.u44.p137==1)&&(i19.i2.u149.p475==1)))))))) * !(EG((i0.i4.u16.p46!=1))))] != FALS...1101
Reverse transition relation is NOT exact ! Due to transitions t358, t362, t364, t367, t369, t371, t373, i0.i0.u4.t354, i0.i2.t347, i0.i2.u9.t351, i0.i3.t34...1346
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 432 transition count 324
Reduce places removed 108 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 110 rules applied. Total rules applied 218 place count 324 transition count 322
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 220 place count 322 transition count 322
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 220 place count 322 transition count 259
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 346 place count 259 transition count 259
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 374 place count 231 transition count 231
Iterating global reduction 3 with 28 rules applied. Total rules applied 402 place count 231 transition count 231
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 402 place count 231 transition count 213
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 438 place count 213 transition count 213
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 588 place count 138 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 589 place count 138 transition count 137
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 4 with 2 rules applied. Total rules applied 591 place count 137 transition count 136
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 592 place count 137 transition count 136
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 594 place count 135 transition count 134
Applied a total of 594 rules in 56 ms. Remains 135 /433 variables (removed 298) and now considering 134/433 (removed 299) transitions.
// Phase 1: matrix 134 rows 135 cols
[2024-05-30 13:50:51] [INFO ] Computed 41 invariants in 3 ms
[2024-05-30 13:50:51] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-30 13:50:51] [INFO ] Invariant cache hit.
[2024-05-30 13:50:52] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-30 13:50:52] [INFO ] Redundant transitions in 2 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-30 13:50:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 132 unsolved
[2024-05-30 13:50:52] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 134/269 variables, 135/177 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/269 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/269 variables, and 177 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3209 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/134 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 1/135 variables, 29/41 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/135 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 134/269 variables, 135/177 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 132/309 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 8 (OVERLAPS) 0/269 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/269 variables, and 309 constraints, problems are : Problem set: 0 solved, 132 unsolved in 2929 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 135/135 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 1/1 constraints]
After SMT, in 6166ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 6167ms
Starting structural reductions in SI_CTL mode, iteration 1 : 135/433 places, 134/433 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6431 ms. Remains : 135/433 places, 134/433 transitions.
[2024-05-30 13:50:58] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:50:58] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:50:58] [INFO ] Input system was already deterministic with 134 transitions.
[2024-05-30 13:50:58] [INFO ] Flatten gal took : 5 ms
[2024-05-30 13:50:58] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:50:58] [INFO ] Time to serialize gal into /tmp/CTLFireability10181344961292848190.gal : 4 ms
[2024-05-30 13:50:58] [INFO ] Time to serialize properties into /tmp/CTLFireability2190540261860190063.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/CTLFireability10181344961292848190.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2190540261860190063.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.92354e+20,0.096765,8060,2,486,5,17411,6,0,676,27123,0


Converting to forward existential form...Done !
original formula: A(!((((p146==1)&&(p158==1))&&(p190==1))) U ((p446==1) + (A(A((p347!=1) U ((p414==1)&&(p4==1))) U (AG((p258==1)) * E((p164==1) U (p459==1)...202
=> equivalent forward existential formula: [((Init * !(EG(!(((p446==1) + (!((E(!((!(E(TRUE U !((p258==1)))) * E((p164==1) U (p459==1)))) U (!(!((E(!(((p414...1213
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t14, t16, t18, t22, t24, t26, t28, t32, t38, t41, t43, t46, t84, t86, t92, t94, t96, ...267
Detected timeout of ITS tools.
[2024-05-30 13:51:28] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:51:28] [INFO ] Applying decomposition
[2024-05-30 13:51:28] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9871880374377787763.txt' '-o' '/tmp/graph9871880374377787763.bin' '-w' '/tmp/graph9871880374377787763.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9871880374377787763.bin' '-l' '-1' '-v' '-w' '/tmp/graph9871880374377787763.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:51:28] [INFO ] Decomposing Gal with order
[2024-05-30 13:51:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:51:28] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-30 13:51:28] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:51:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-30 13:51:28] [INFO ] Time to serialize gal into /tmp/CTLFireability15874722360848187303.gal : 1 ms
[2024-05-30 13:51:28] [INFO ] Time to serialize properties into /tmp/CTLFireability14561927703744525562.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/CTLFireability15874722360848187303.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14561927703744525562.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.92354e+20,0.064142,6564,127,26,5691,123,357,12914,60,417,0


Converting to forward existential form...Done !
original formula: A(!((((i2.u12.p146==1)&&(i2.u13.p158==1))&&(i3.i1.u17.p190==1))) U ((i8.i1.u39.p446==1) + (A(A((i6.u30.p347!=1) U ((i8.i0.u35.p414==1)&&(...304
=> equivalent forward existential formula: [((Init * !(EG(!(((i8.i1.u39.p446==1) + (!((E(!((!(E(TRUE U !((i5.u24.p258==1)))) * E((i3.i0.u14.p164==1) U (i9....1711
Reverse transition relation is NOT exact ! Due to transitions i0.i0.u2.t14, i0.i0.u4.t18, i0.i1.u3.t16, i0.i1.u5.t22, i1.u6.t84, i1.u7.t24, i1.u8.t86, i1.u...426
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 397 transition count 397
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 397 transition count 397
Applied a total of 72 rules in 9 ms. Remains 397 /433 variables (removed 36) and now considering 397/433 (removed 36) transitions.
// Phase 1: matrix 397 rows 397 cols
[2024-05-30 13:51:58] [INFO ] Computed 41 invariants in 9 ms
[2024-05-30 13:51:58] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-30 13:51:58] [INFO ] Invariant cache hit.
[2024-05-30 13:51:58] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2024-05-30 13:51:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:52:03] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:52:03] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 0 ms to minimize.
[2024-05-30 13:52:04] [INFO ] Deduced a trap composed of 22 places in 39 ms of which 1 ms to minimize.
[2024-05-30 13:52:04] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-30 13:52:04] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:52:04] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 2 ms to minimize.
[2024-05-30 13:52:04] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 2 ms to minimize.
[2024-05-30 13:52:05] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:52:05] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 1 ms to minimize.
[2024-05-30 13:52:05] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:52:05] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:52:05] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:52:05] [INFO ] Deduced a trap composed of 27 places in 38 ms of which 0 ms to minimize.
[2024-05-30 13:52:06] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 1 ms to minimize.
[2024-05-30 13:52:06] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 8 ms to minimize.
[2024-05-30 13:52:06] [INFO ] Deduced a trap composed of 22 places in 40 ms of which 1 ms to minimize.
[2024-05-30 13:52:06] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:52:08] [INFO ] Deduced a trap composed of 27 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:52:08] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-30 13:52:09] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:52:09] [INFO ] Deduced a trap composed of 30 places in 33 ms of which 0 ms to minimize.
[2024-05-30 13:52:09] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 397/794 variables, 397/460 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 7 (OVERLAPS) 0/794 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 396 unsolved
No progress, stopping.
After SMT solving in domain Real declared 794/794 variables, and 460 constraints, problems are : Problem set: 0 solved, 396 unsolved in 27495 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 22/63 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:52:30] [INFO ] Deduced a trap composed of 33 places in 31 ms of which 0 ms to minimize.
[2024-05-30 13:52:30] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 5 (OVERLAPS) 397/794 variables, 397/462 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/794 variables, 396/858 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:52:34] [INFO ] Deduced a trap composed of 20 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:52:35] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 3 ms to minimize.
[2024-05-30 13:52:35] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-30 13:52:35] [INFO ] Deduced a trap composed of 29 places in 115 ms of which 2 ms to minimize.
[2024-05-30 13:52:35] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 2 ms to minimize.
[2024-05-30 13:52:35] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:52:36] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:52:36] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 3 ms to minimize.
[2024-05-30 13:52:36] [INFO ] Deduced a trap composed of 35 places in 119 ms of which 2 ms to minimize.
[2024-05-30 13:52:36] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2024-05-30 13:52:36] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:52:36] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 3 ms to minimize.
[2024-05-30 13:52:36] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:52:37] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-30 13:52:37] [INFO ] Deduced a trap composed of 22 places in 108 ms of which 3 ms to minimize.
[2024-05-30 13:52:37] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 3 ms to minimize.
[2024-05-30 13:52:37] [INFO ] Deduced a trap composed of 25 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:52:38] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:52:38] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-30 13:52:38] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/794 variables, 20/878 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:52:40] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 3 ms to minimize.
[2024-05-30 13:52:41] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 2 ms to minimize.
[2024-05-30 13:52:41] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:52:41] [INFO ] Deduced a trap composed of 17 places in 118 ms of which 2 ms to minimize.
[2024-05-30 13:52:42] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:52:42] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 2 ms to minimize.
[2024-05-30 13:52:42] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
[2024-05-30 13:52:43] [INFO ] Deduced a trap composed of 24 places in 113 ms of which 2 ms to minimize.
[2024-05-30 13:52:43] [INFO ] Deduced a trap composed of 25 places in 119 ms of which 3 ms to minimize.
[2024-05-30 13:52:43] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:52:44] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 3 ms to minimize.
[2024-05-30 13:52:44] [INFO ] Deduced a trap composed of 33 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:52:44] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 3 ms to minimize.
[2024-05-30 13:52:44] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 2 ms to minimize.
[2024-05-30 13:52:44] [INFO ] Deduced a trap composed of 33 places in 115 ms of which 2 ms to minimize.
[2024-05-30 13:52:44] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:52:44] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:52:45] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:52:45] [INFO ] Deduced a trap composed of 46 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:52:45] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/794 variables, 20/898 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:52:48] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 3 ms to minimize.
[2024-05-30 13:52:48] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:52:49] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:52:49] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:52:50] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 3 ms to minimize.
[2024-05-30 13:52:50] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:52:50] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:52:51] [INFO ] Deduced a trap composed of 27 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:52:51] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:52:51] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:52:51] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:52:51] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 3 ms to minimize.
[2024-05-30 13:52:51] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:52:51] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:52:51] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:52:52] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:52:52] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:52:52] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:52:53] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:52:53] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/794 variables, 20/918 constraints. Problems are: Problem set: 0 solved, 396 unsolved
[2024-05-30 13:52:56] [INFO ] Deduced a trap composed of 36 places in 138 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 794/794 variables, and 919 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 85/85 constraints]
After SMT, in 57559ms problems are : Problem set: 0 solved, 396 unsolved
Search for dead transitions found 0 dead transitions in 57563ms
Starting structural reductions in LTL mode, iteration 1 : 397/433 places, 397/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57938 ms. Remains : 397/433 places, 397/433 transitions.
[2024-05-30 13:52:56] [INFO ] Flatten gal took : 23 ms
[2024-05-30 13:52:56] [INFO ] Flatten gal took : 16 ms
[2024-05-30 13:52:56] [INFO ] Input system was already deterministic with 397 transitions.
[2024-05-30 13:52:56] [INFO ] Flatten gal took : 24 ms
[2024-05-30 13:52:56] [INFO ] Flatten gal took : 24 ms
[2024-05-30 13:52:56] [INFO ] Time to serialize gal into /tmp/CTLFireability2050515328762568897.gal : 2 ms
[2024-05-30 13:52:56] [INFO ] Time to serialize properties into /tmp/CTLFireability2002191465417940078.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/CTLFireability2050515328762568897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2002191465417940078.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03387e+36,15.5834,426056,2,8478,5,970279,6,0,1987,3.40466e+06,0


Converting to forward existential form...Done !
original formula: AG((EX((E(A((p188==1) U (p178==1)) U ((p185==1)||(p396==1))) + ((EF((((p48==1)&&(p60==1))&&(p92==1))) + AX((p298==1))) * (((p46==1)||(p14...190
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((p151==0))) * !(EX((E(!((E(!((p178==1)) U (!((p188==1)) * !((p178==1)))) + EG(!((p178==1)...306
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t65, t71, t75, t77, ...712
Detected timeout of ITS tools.
[2024-05-30 13:53:26] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:53:26] [INFO ] Applying decomposition
[2024-05-30 13:53:26] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2323937991572603904.txt' '-o' '/tmp/graph2323937991572603904.bin' '-w' '/tmp/graph2323937991572603904.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2323937991572603904.bin' '-l' '-1' '-v' '-w' '/tmp/graph2323937991572603904.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:53:26] [INFO ] Decomposing Gal with order
[2024-05-30 13:53:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:53:26] [INFO ] Removed a total of 97 redundant transitions.
[2024-05-30 13:53:26] [INFO ] Flatten gal took : 35 ms
[2024-05-30 13:53:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 13:53:26] [INFO ] Time to serialize gal into /tmp/CTLFireability11832763858873005974.gal : 22 ms
[2024-05-30 13:53:26] [INFO ] Time to serialize properties into /tmp/CTLFireability15139388285394006229.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/CTLFireability11832763858873005974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15139388285394006229.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.03387e+36,2.07151,67976,1497,38,111255,566,643,343948,49,1415,0


Converting to forward existential form...Done !
original formula: AG((EX((E(A((i6.u62.p188==1) U (i6.u59.p178==1)) U ((i6.u56.p185==1)||(i13.u129.p396==1))) + ((EF((((i1.u15.p48==1)&&(i1.u17.p60==1))&&(i...277
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((i4.u50.p151==0))) * !(EX((E(!((E(!((i6.u59.p178==1)) U (!((i6.u62.p188==1)) * !((i6.u59....407
Reverse transition relation is NOT exact ! Due to transitions t358, t360, t362, t364, t367, t369, t371, t373, t375, i0.t168, i0.t152, i0.u85.t172, i0.u92.t...1206
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 114 transitions
Trivial Post-agglo rules discarded 114 transitions
Performed 114 trivial Post agglomeration. Transition count delta: 114
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 432 transition count 318
Reduce places removed 114 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 115 rules applied. Total rules applied 229 place count 318 transition count 317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 230 place count 317 transition count 317
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 230 place count 317 transition count 256
Deduced a syphon composed of 61 places in 3 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 352 place count 256 transition count 256
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 382 place count 226 transition count 226
Iterating global reduction 3 with 30 rules applied. Total rules applied 412 place count 226 transition count 226
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 412 place count 226 transition count 205
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 454 place count 205 transition count 205
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 608 place count 128 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 609 place count 128 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 611 place count 127 transition count 126
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 613 place count 125 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 614 place count 124 transition count 124
Applied a total of 614 rules in 42 ms. Remains 124 /433 variables (removed 309) and now considering 124/433 (removed 309) transitions.
// Phase 1: matrix 124 rows 124 cols
[2024-05-30 13:53:56] [INFO ] Computed 40 invariants in 3 ms
[2024-05-30 13:53:57] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-30 13:53:57] [INFO ] Invariant cache hit.
[2024-05-30 13:53:57] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2024-05-30 13:53:57] [INFO ] Redundant transitions in 2 ms returned []
Running 121 sub problems to find dead transitions.
[2024-05-30 13:53:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 2/124 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 124/248 variables, 124/164 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/248 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/248 variables, and 164 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2358 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 2/124 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 124/248 variables, 124/164 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 121/285 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/248 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/248 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/248 variables, and 285 constraints, problems are : Problem set: 0 solved, 121 unsolved in 2250 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 4618ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 4619ms
Starting structural reductions in SI_CTL mode, iteration 1 : 124/433 places, 124/433 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4834 ms. Remains : 124/433 places, 124/433 transitions.
[2024-05-30 13:54:01] [INFO ] Flatten gal took : 9 ms
[2024-05-30 13:54:01] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:54:01] [INFO ] Input system was already deterministic with 124 transitions.
[2024-05-30 13:54:01] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:54:01] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:54:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2470019706893004373.gal : 1 ms
[2024-05-30 13:54:01] [INFO ] Time to serialize properties into /tmp/CTLFireability5525368134018538183.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/CTLFireability2470019706893004373.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5525368134018538183.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.7017e+19,0.0918,7168,2,209,5,14768,6,0,621,23957,0


Converting to forward existential form...Done !
original formula: E(((p322==1)&&(p224==1)) U !(EG((p219!=1))))
=> equivalent forward existential formula: [(FwdU(Init,((p322==1)&&(p224==1))) * !(EG((p219!=1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 121/0/3
Detected timeout of ITS tools.
[2024-05-30 13:54:31] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:54:31] [INFO ] Applying decomposition
[2024-05-30 13:54:31] [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/graph3189430255706944581.txt' '-o' '/tmp/graph3189430255706944581.bin' '-w' '/tmp/graph3189430255706944581.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3189430255706944581.bin' '-l' '-1' '-v' '-w' '/tmp/graph3189430255706944581.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:54:31] [INFO ] Decomposing Gal with order
[2024-05-30 13:54:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:54:31] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-30 13:54:31] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:54:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:54:31] [INFO ] Time to serialize gal into /tmp/CTLFireability11671702809034185223.gal : 11 ms
[2024-05-30 13:54:31] [INFO ] Time to serialize properties into /tmp/CTLFireability10223524966015880765.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/CTLFireability11671702809034185223.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10223524966015880765.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.7017e+19,0.047301,5560,33,9,3582,75,231,7975,35,153,0


Converting to forward existential form...Done !
original formula: E(((i7.u26.p322==1)&&(i4.u18.p224==1)) U !(EG((i4.u17.p219!=1))))
=> equivalent forward existential formula: [(FwdU(Init,((i7.u26.p322==1)&&(i4.u18.p224==1))) * !(EG((i4.u17.p219!=1))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 432 transition count 315
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 235 place count 315 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 236 place count 314 transition count 314
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 236 place count 314 transition count 253
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 358 place count 253 transition count 253
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 387 place count 224 transition count 224
Iterating global reduction 3 with 29 rules applied. Total rules applied 416 place count 224 transition count 224
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 416 place count 224 transition count 205
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 454 place count 205 transition count 205
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 614 place count 125 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 615 place count 125 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 617 place count 124 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 619 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 620 place count 121 transition count 121
Applied a total of 620 rules in 30 ms. Remains 121 /433 variables (removed 312) and now considering 121/433 (removed 312) transitions.
// Phase 1: matrix 121 rows 121 cols
[2024-05-30 13:55:01] [INFO ] Computed 40 invariants in 1 ms
[2024-05-30 13:55:02] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-30 13:55:02] [INFO ] Invariant cache hit.
[2024-05-30 13:55:02] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-30 13:55:02] [INFO ] Redundant transitions in 2 ms returned []
Running 120 sub problems to find dead transitions.
[2024-05-30 13:55:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 121/242 variables, 121/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 161 constraints, problems are : Problem set: 0 solved, 120 unsolved in 1720 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 121/242 variables, 121/161 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 120/281 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (OVERLAPS) 0/242 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 281 constraints, problems are : Problem set: 0 solved, 120 unsolved in 1840 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 3571ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 3572ms
Starting structural reductions in SI_CTL mode, iteration 1 : 121/433 places, 121/433 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3816 ms. Remains : 121/433 places, 121/433 transitions.
[2024-05-30 13:55:05] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:55:05] [INFO ] Flatten gal took : 4 ms
[2024-05-30 13:55:05] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-30 13:55:05] [INFO ] Flatten gal took : 2 ms
[2024-05-30 13:55:05] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:55:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13407935203288239883.gal : 1 ms
[2024-05-30 13:55:05] [INFO ] Time to serialize properties into /tmp/CTLFireability13340985334993707846.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/CTLFireability13407935203288239883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13340985334993707846.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44091e+19,0.043331,5308,2,203,5,7901,6,0,608,9894,0


Converting to forward existential form...Done !
original formula: EG(AF(((p449==1)||(p292==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((p449==1)||(p292==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 116/5/5
Detected timeout of ITS tools.
[2024-05-30 13:55:35] [INFO ] Flatten gal took : 3 ms
[2024-05-30 13:55:35] [INFO ] Applying decomposition
[2024-05-30 13:55:35] [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/graph8814557142469324832.txt' '-o' '/tmp/graph8814557142469324832.bin' '-w' '/tmp/graph8814557142469324832.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8814557142469324832.bin' '-l' '-1' '-v' '-w' '/tmp/graph8814557142469324832.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:55:35] [INFO ] Decomposing Gal with order
[2024-05-30 13:55:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:55:35] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-30 13:55:35] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:55:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 13:55:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17163395350507074183.gal : 2 ms
[2024-05-30 13:55:35] [INFO ] Time to serialize properties into /tmp/CTLFireability15585428251012837924.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/CTLFireability17163395350507074183.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15585428251012837924.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.44091e+19,0.030158,4748,26,8,2326,62,216,4161,36,148,0


Converting to forward existential form...Done !
original formula: EG(AF(((i8.u36.p449==1)||(i5.u23.p292==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(((i8.u36.p449==1)||(i5.u23.p292==1))))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 391 transition count 391
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 391 transition count 391
Applied a total of 84 rules in 13 ms. Remains 391 /433 variables (removed 42) and now considering 391/433 (removed 42) transitions.
// Phase 1: matrix 391 rows 391 cols
[2024-05-30 13:56:05] [INFO ] Computed 41 invariants in 1 ms
[2024-05-30 13:56:06] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-30 13:56:06] [INFO ] Invariant cache hit.
[2024-05-30 13:56:06] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 390 sub problems to find dead transitions.
[2024-05-30 13:56:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (OVERLAPS) 1/391 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 13:56:10] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:56:10] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-30 13:56:11] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:56:11] [INFO ] Deduced a trap composed of 23 places in 27 ms of which 0 ms to minimize.
[2024-05-30 13:56:11] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:56:11] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:56:12] [INFO ] Deduced a trap composed of 26 places in 24 ms of which 1 ms to minimize.
[2024-05-30 13:56:12] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 0 ms to minimize.
[2024-05-30 13:56:12] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-30 13:56:12] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:56:12] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 391/782 variables, 391/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (OVERLAPS) 0/782 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 782/782 variables, and 443 constraints, problems are : Problem set: 0 solved, 390 unsolved in 22935 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (OVERLAPS) 1/391 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 391/782 variables, 391/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 390/833 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 13:56:34] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:56:34] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:56:34] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:56:34] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:56:35] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 3 ms to minimize.
[2024-05-30 13:56:35] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:56:35] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2024-05-30 13:56:35] [INFO ] Deduced a trap composed of 43 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:56:35] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-30 13:56:35] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-05-30 13:56:35] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-05-30 13:56:36] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 2 ms to minimize.
[2024-05-30 13:56:36] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:56:36] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
[2024-05-30 13:56:37] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 2 ms to minimize.
[2024-05-30 13:56:37] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-05-30 13:56:37] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2024-05-30 13:56:37] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:56:38] [INFO ] Deduced a trap composed of 23 places in 117 ms of which 3 ms to minimize.
[2024-05-30 13:56:38] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/782 variables, 20/853 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 13:56:39] [INFO ] Deduced a trap composed of 20 places in 121 ms of which 2 ms to minimize.
[2024-05-30 13:56:39] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:56:40] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:56:41] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2024-05-30 13:56:41] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:56:41] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-30 13:56:41] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:56:41] [INFO ] Deduced a trap composed of 23 places in 115 ms of which 2 ms to minimize.
[2024-05-30 13:56:42] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 3 ms to minimize.
[2024-05-30 13:56:42] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:56:42] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 3 ms to minimize.
[2024-05-30 13:56:42] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:56:42] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:56:43] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:56:43] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:56:43] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:56:43] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:56:43] [INFO ] Deduced a trap composed of 31 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:56:43] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 3 ms to minimize.
[2024-05-30 13:56:43] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 20/873 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 13:56:46] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 3 ms to minimize.
[2024-05-30 13:56:46] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:56:47] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:56:47] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:56:47] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:56:48] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-05-30 13:56:48] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 3 ms to minimize.
[2024-05-30 13:56:48] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:56:48] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:56:49] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:56:49] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:56:49] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:56:49] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-05-30 13:56:50] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 3 ms to minimize.
[2024-05-30 13:56:50] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:56:50] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 3 ms to minimize.
[2024-05-30 13:56:50] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:56:50] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:56:50] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-05-30 13:56:50] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 20/893 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 13:56:55] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-30 13:56:55] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 3 ms to minimize.
[2024-05-30 13:56:56] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:56:56] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 3 ms to minimize.
[2024-05-30 13:56:57] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 3 ms to minimize.
[2024-05-30 13:56:57] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 3 ms to minimize.
[2024-05-30 13:56:57] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 2 ms to minimize.
[2024-05-30 13:56:57] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:56:58] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-05-30 13:56:58] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 2 ms to minimize.
[2024-05-30 13:56:58] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2024-05-30 13:56:59] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 3 ms to minimize.
[2024-05-30 13:56:59] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
SMT process timed out in 53029ms, After SMT, problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 53032ms
Starting structural reductions in LTL mode, iteration 1 : 391/433 places, 391/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53363 ms. Remains : 391/433 places, 391/433 transitions.
[2024-05-30 13:56:59] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:56:59] [INFO ] Flatten gal took : 8 ms
[2024-05-30 13:56:59] [INFO ] Input system was already deterministic with 391 transitions.
[2024-05-30 13:56:59] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:56:59] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:56:59] [INFO ] Time to serialize gal into /tmp/CTLFireability17456440521812517725.gal : 1 ms
[2024-05-30 13:56:59] [INFO ] Time to serialize properties into /tmp/CTLFireability12486892036166781585.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/CTLFireability17456440521812517725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12486892036166781585.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,5.56678e+35,12.6772,370424,2,7607,5,949042,6,0,1957,2.82851e+06,0


Converting to forward existential form...Done !
original formula: EF(EG((EX((p302==1)) + AX(A((p88==1) U (((p293==1)&&(p305==1))&&(p337==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(EX((p302==1)) + !(EX(!(!((E(!((((p293==1)&&(p305==1))&&(p337==1))) U (!((p88==1)) * !((((...252
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t65, t71, t75, t80, ...671
Detected timeout of ITS tools.
[2024-05-30 13:57:29] [INFO ] Flatten gal took : 13 ms
[2024-05-30 13:57:29] [INFO ] Applying decomposition
[2024-05-30 13:57:29] [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/graph10900180662637032049.txt' '-o' '/tmp/graph10900180662637032049.bin' '-w' '/tmp/graph10900180662637032049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10900180662637032049.bin' '-l' '-1' '-v' '-w' '/tmp/graph10900180662637032049.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:57:29] [INFO ] Decomposing Gal with order
[2024-05-30 13:57:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:57:29] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-30 13:57:29] [INFO ] Flatten gal took : 17 ms
[2024-05-30 13:57:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 13:57:29] [INFO ] Time to serialize gal into /tmp/CTLFireability15890151029812056550.gal : 3 ms
[2024-05-30 13:57:29] [INFO ] Time to serialize properties into /tmp/CTLFireability15498490420625792934.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/CTLFireability15890151029812056550.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15498490420625792934.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,5.56678e+35,0.963272,36344,1095,34,59904,622,605,156111,47,1623,0


Converting to forward existential form...Done !
original formula: EF(EG((EX((i12.i1.i2.u92.p302==1)) + AX(A((i4.u32.p88==1) U (((i12.i0.i1.u90.p293==1)&&(i12.i1.i2.u91.p305==1))&&(i13.u105.p337==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(EX((i12.i1.i2.u92.p302==1)) + !(EX(!(!((E(!((((i12.i0.i1.u90.p293==1)&&(i12.i1.i2.u91.p30...384
Reverse transition relation is NOT exact ! Due to transitions t352, t354, t356, t358, t361, t363, t365, t367, t369, i0.t131, i0.u97.t135, i1.t185, i1.u76.t...1139
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 392 transition count 392
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 392 transition count 392
Applied a total of 82 rules in 18 ms. Remains 392 /433 variables (removed 41) and now considering 392/433 (removed 41) transitions.
// Phase 1: matrix 392 rows 392 cols
[2024-05-30 13:57:59] [INFO ] Computed 41 invariants in 3 ms
[2024-05-30 13:57:59] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-30 13:57:59] [INFO ] Invariant cache hit.
[2024-05-30 13:57:59] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 391 sub problems to find dead transitions.
[2024-05-30 13:57:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:58:04] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-30 13:58:04] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 5 ms to minimize.
[2024-05-30 13:58:04] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-30 13:58:05] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:58:05] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:58:05] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 13:58:05] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-30 13:58:06] [INFO ] Deduced a trap composed of 27 places in 37 ms of which 0 ms to minimize.
[2024-05-30 13:58:06] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:58:06] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 13:58:06] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:58:08] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:58:14] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 392/784 variables, 392/446 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (OVERLAPS) 0/784 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 784/784 variables, and 446 constraints, problems are : Problem set: 0 solved, 391 unsolved in 28906 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 392/392 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/391 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (OVERLAPS) 1/392 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/392 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (OVERLAPS) 392/784 variables, 392/446 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/784 variables, 391/837 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:58:34] [INFO ] Deduced a trap composed of 20 places in 143 ms of which 3 ms to minimize.
[2024-05-30 13:58:34] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:58:35] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 3 ms to minimize.
[2024-05-30 13:58:35] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:58:35] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:58:35] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-30 13:58:35] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:58:36] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-05-30 13:58:36] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 2 ms to minimize.
[2024-05-30 13:58:36] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:58:36] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-05-30 13:58:36] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 2 ms to minimize.
[2024-05-30 13:58:36] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 2 ms to minimize.
[2024-05-30 13:58:37] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 3 ms to minimize.
[2024-05-30 13:58:37] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:58:37] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 2 ms to minimize.
[2024-05-30 13:58:37] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:58:37] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 2 ms to minimize.
[2024-05-30 13:58:38] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 3 ms to minimize.
[2024-05-30 13:58:38] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/784 variables, 20/857 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:58:40] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 2 ms to minimize.
[2024-05-30 13:58:40] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 3 ms to minimize.
[2024-05-30 13:58:40] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 3 ms to minimize.
[2024-05-30 13:58:41] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-30 13:58:41] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 3 ms to minimize.
[2024-05-30 13:58:41] [INFO ] Deduced a trap composed of 22 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:58:41] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2024-05-30 13:58:42] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 3 ms to minimize.
[2024-05-30 13:58:42] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2024-05-30 13:58:42] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-30 13:58:42] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-05-30 13:58:42] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-30 13:58:42] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-30 13:58:43] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 1 ms to minimize.
[2024-05-30 13:58:43] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2024-05-30 13:58:43] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:58:43] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 2 ms to minimize.
[2024-05-30 13:58:44] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 2 ms to minimize.
[2024-05-30 13:58:44] [INFO ] Deduced a trap composed of 41 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:58:44] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/784 variables, 20/877 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:58:46] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 2 ms to minimize.
[2024-05-30 13:58:48] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2024-05-30 13:58:48] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:58:48] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:58:48] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:58:49] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 3 ms to minimize.
[2024-05-30 13:58:49] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-30 13:58:49] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 2 ms to minimize.
[2024-05-30 13:58:49] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-30 13:58:50] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-05-30 13:58:50] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2024-05-30 13:58:50] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 2 ms to minimize.
[2024-05-30 13:58:51] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-30 13:58:51] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
[2024-05-30 13:58:51] [INFO ] Deduced a trap composed of 31 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:58:51] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-30 13:58:51] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 2 ms to minimize.
[2024-05-30 13:58:51] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-05-30 13:58:52] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-30 13:58:52] [INFO ] Deduced a trap composed of 32 places in 98 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/784 variables, 20/897 constraints. Problems are: Problem set: 0 solved, 391 unsolved
[2024-05-30 13:58:54] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2024-05-30 13:58:55] [INFO ] Deduced a trap composed of 34 places in 132 ms of which 2 ms to minimize.
[2024-05-30 13:58:57] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-05-30 13:58:57] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2024-05-30 13:58:57] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 2 ms to minimize.
[2024-05-30 13:58:57] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-05-30 13:58:57] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 2 ms to minimize.
[2024-05-30 13:58:57] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 784/784 variables, and 905 constraints, problems are : Problem set: 0 solved, 391 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 392/392 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 81/81 constraints]
After SMT, in 58970ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 58975ms
Starting structural reductions in LTL mode, iteration 1 : 392/433 places, 392/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59319 ms. Remains : 392/433 places, 392/433 transitions.
[2024-05-30 13:58:58] [INFO ] Flatten gal took : 10 ms
[2024-05-30 13:58:58] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:58:58] [INFO ] Input system was already deterministic with 392 transitions.
[2024-05-30 13:58:58] [INFO ] Flatten gal took : 6 ms
[2024-05-30 13:58:58] [INFO ] Flatten gal took : 7 ms
[2024-05-30 13:58:58] [INFO ] Time to serialize gal into /tmp/CTLFireability6726506833302574509.gal : 2 ms
[2024-05-30 13:58:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15282396780031442258.ctl : 15 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/CTLFireability6726506833302574509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15282396780031442258.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,6.17902e+35,12.3471,363328,2,7882,5,928220,6,0,1962,2.77754e+06,0


Converting to forward existential form...Done !
original formula: AG(AX(((p151==0) + EX(A((p480==1) U (p246==1))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * !((p151==0))) * !(EX(!((E(!((p246==1)) U (!((p480==1)) * !((p246==1)))) + EG(!((p246==1...172
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t65, t71, t75, t80, ...677
Detected timeout of ITS tools.
[2024-05-30 13:59:28] [INFO ] Flatten gal took : 11 ms
[2024-05-30 13:59:28] [INFO ] Applying decomposition
[2024-05-30 13:59:28] [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/graph6818681504256832105.txt' '-o' '/tmp/graph6818681504256832105.bin' '-w' '/tmp/graph6818681504256832105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6818681504256832105.bin' '-l' '-1' '-v' '-w' '/tmp/graph6818681504256832105.weights' '-q' '0' '-e' '0.001'
[2024-05-30 13:59:29] [INFO ] Decomposing Gal with order
[2024-05-30 13:59:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 13:59:29] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 13:59:29] [INFO ] Flatten gal took : 33 ms
[2024-05-30 13:59:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 13:59:29] [INFO ] Time to serialize gal into /tmp/CTLFireability9444194079516705423.gal : 4 ms
[2024-05-30 13:59:29] [INFO ] Time to serialize properties into /tmp/CTLFireability17989487750071698074.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/CTLFireability9444194079516705423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17989487750071698074.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,6.17902e+35,1.07529,40848,1283,22,69985,493,634,183007,38,1115,0


Converting to forward existential form...Done !
original formula: AG(AX(((i5.u50.p151==0) + EX(A((i17.u153.p480==1) U (i9.u76.p246==1))))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * !((i5.u50.p151==0))) * !(EX(!((E(!((i9.u76.p246==1)) U (!((i17.u153.p480==1)) * !((i9.u...209
Reverse transition relation is NOT exact ! Due to transitions t353, t355, t357, t359, t362, t364, t366, t368, t370, i0.t96, i0.t80, i0.u115.t100, i0.u123.t...1124
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 116 transitions
Trivial Post-agglo rules discarded 116 transitions
Performed 116 trivial Post agglomeration. Transition count delta: 116
Iterating post reduction 0 with 116 rules applied. Total rules applied 116 place count 432 transition count 316
Reduce places removed 116 places and 0 transitions.
Iterating post reduction 1 with 116 rules applied. Total rules applied 232 place count 316 transition count 316
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 62 Pre rules applied. Total rules applied 232 place count 316 transition count 254
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 2 with 124 rules applied. Total rules applied 356 place count 254 transition count 254
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 383 place count 227 transition count 227
Iterating global reduction 2 with 27 rules applied. Total rules applied 410 place count 227 transition count 227
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 410 place count 227 transition count 208
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 448 place count 208 transition count 208
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 604 place count 130 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 605 place count 130 transition count 129
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 3 with 2 rules applied. Total rules applied 607 place count 129 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 609 place count 127 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 610 place count 126 transition count 126
Applied a total of 610 rules in 33 ms. Remains 126 /433 variables (removed 307) and now considering 126/433 (removed 307) transitions.
// Phase 1: matrix 126 rows 126 cols
[2024-05-30 13:59:59] [INFO ] Computed 40 invariants in 1 ms
[2024-05-30 13:59:59] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-30 13:59:59] [INFO ] Invariant cache hit.
[2024-05-30 13:59:59] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-05-30 13:59:59] [INFO ] Redundant transitions in 1 ms returned []
Running 123 sub problems to find dead transitions.
[2024-05-30 13:59:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 2/126 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 126/252 variables, 126/166 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/252 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 252/252 variables, and 166 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2418 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (OVERLAPS) 2/126 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (OVERLAPS) 126/252 variables, 126/166 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 123/289 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 7 (OVERLAPS) 0/252 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 252/252 variables, and 289 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2854 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 5286ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 5287ms
Starting structural reductions in SI_CTL mode, iteration 1 : 126/433 places, 126/433 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5638 ms. Remains : 126/433 places, 126/433 transitions.
[2024-05-30 14:00:04] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:00:04] [INFO ] Flatten gal took : 3 ms
[2024-05-30 14:00:04] [INFO ] Input system was already deterministic with 126 transitions.
[2024-05-30 14:00:04] [INFO ] Flatten gal took : 3 ms
[2024-05-30 14:00:04] [INFO ] Flatten gal took : 3 ms
[2024-05-30 14:00:04] [INFO ] Time to serialize gal into /tmp/CTLFireability8939276229371321329.gal : 1 ms
[2024-05-30 14:00:04] [INFO ] Time to serialize properties into /tmp/CTLFireability10412265909549614485.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/CTLFireability8939276229371321329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10412265909549614485.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.92121e+19,0.085678,6648,2,319,5,12476,6,0,631,18524,0


Converting to forward existential form...Done !
original formula: EG((AF((EG(((p309==1)||(p250==1))) + AF(((p165==1)||(p54==1))))) + (p295==1)))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((EG(((p309==1)||(p250==1))) + !(EG(!(((p165==1)||(p54==1))))))))) + (p295==1)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t10, t12, t15, t19, t21, t23, t25, t29, t31, t34, t37, t39, t42, t46, t49, t5...309
Detected timeout of ITS tools.
[2024-05-30 14:00:34] [INFO ] Flatten gal took : 9 ms
[2024-05-30 14:00:34] [INFO ] Applying decomposition
[2024-05-30 14:00:34] [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/graph15414960006627878117.txt' '-o' '/tmp/graph15414960006627878117.bin' '-w' '/tmp/graph15414960006627878117.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15414960006627878117.bin' '-l' '-1' '-v' '-w' '/tmp/graph15414960006627878117.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:00:34] [INFO ] Decomposing Gal with order
[2024-05-30 14:00:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:00:34] [INFO ] Removed a total of 28 redundant transitions.
[2024-05-30 14:00:34] [INFO ] Flatten gal took : 8 ms
[2024-05-30 14:00:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-30 14:00:34] [INFO ] Time to serialize gal into /tmp/CTLFireability9756969303506735938.gal : 1 ms
[2024-05-30 14:00:34] [INFO ] Time to serialize properties into /tmp/CTLFireability7321702020209824848.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/CTLFireability9756969303506735938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7321702020209824848.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.92121e+19,0.054769,5320,88,18,3621,92,251,7622,38,230,0


Converting to forward existential form...Done !
original formula: EG((AF((EG(((i7.u26.p309==1)||(i4.u20.p250==1))) + AF(((i3.u13.p165==1)||(i0.i1.u4.p54==1))))) + (i5.u24.p295==1)))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((EG(((i7.u26.p309==1)||(i4.u20.p250==1))) + !(EG(!(((i3.u13.p165==1)||(i0.i1.u4.p54==1)))))))...188
Reverse transition relation is NOT exact ! Due to transitions t5, i0.i0.u1.t10, i0.i0.u3.t15, i0.i1.u2.t12, i0.i1.u4.t4, i0.i1.u4.t19, i1.u5.t80, i1.u6.t21...509
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 393 transition count 393
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 393 transition count 393
Applied a total of 80 rules in 15 ms. Remains 393 /433 variables (removed 40) and now considering 393/433 (removed 40) transitions.
// Phase 1: matrix 393 rows 393 cols
[2024-05-30 14:01:05] [INFO ] Computed 41 invariants in 1 ms
[2024-05-30 14:01:05] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-30 14:01:05] [INFO ] Invariant cache hit.
[2024-05-30 14:01:05] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2024-05-30 14:01:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/393 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:01:09] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:01:10] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:01:10] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:01:10] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:01:11] [INFO ] Deduced a trap composed of 24 places in 26 ms of which 1 ms to minimize.
[2024-05-30 14:01:11] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 1 ms to minimize.
[2024-05-30 14:01:11] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
[2024-05-30 14:01:11] [INFO ] Deduced a trap composed of 26 places in 23 ms of which 0 ms to minimize.
[2024-05-30 14:01:11] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 1 ms to minimize.
[2024-05-30 14:01:12] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:01:12] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 0 ms to minimize.
[2024-05-30 14:01:12] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:01:13] [INFO ] Deduced a trap composed of 24 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:01:19] [INFO ] Deduced a trap composed of 31 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (OVERLAPS) 393/786 variables, 393/448 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 8 (OVERLAPS) 0/786 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Real declared 786/786 variables, and 448 constraints, problems are : Problem set: 0 solved, 392 unsolved in 28905 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/393 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 393/786 variables, 393/448 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/786 variables, 392/840 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:01:40] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 3 ms to minimize.
[2024-05-30 14:01:40] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 3 ms to minimize.
[2024-05-30 14:01:40] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-05-30 14:01:40] [INFO ] Deduced a trap composed of 29 places in 116 ms of which 2 ms to minimize.
[2024-05-30 14:01:40] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 2 ms to minimize.
[2024-05-30 14:01:40] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
[2024-05-30 14:01:41] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 5 ms to minimize.
[2024-05-30 14:01:41] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 3 ms to minimize.
[2024-05-30 14:01:41] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2024-05-30 14:01:41] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:01:42] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 3 ms to minimize.
[2024-05-30 14:01:42] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 3 ms to minimize.
[2024-05-30 14:01:42] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-30 14:01:42] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:01:42] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:01:42] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-30 14:01:43] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
[2024-05-30 14:01:43] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-30 14:01:43] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:01:43] [INFO ] Deduced a trap composed of 35 places in 95 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 20/860 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:01:45] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 2 ms to minimize.
[2024-05-30 14:01:45] [INFO ] Deduced a trap composed of 31 places in 103 ms of which 3 ms to minimize.
[2024-05-30 14:01:46] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 3 ms to minimize.
[2024-05-30 14:01:46] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
[2024-05-30 14:01:46] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-30 14:01:47] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-30 14:01:47] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:01:47] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-30 14:01:47] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 3 ms to minimize.
[2024-05-30 14:01:47] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:01:48] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-30 14:01:48] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:01:48] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
[2024-05-30 14:01:48] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:01:48] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-30 14:01:49] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:01:49] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-30 14:01:49] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-30 14:01:50] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 2 ms to minimize.
[2024-05-30 14:01:50] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 20/880 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:01:53] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-05-30 14:01:53] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:01:54] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:01:54] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-30 14:01:55] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:01:55] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 2 ms to minimize.
[2024-05-30 14:01:55] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-05-30 14:01:56] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 1 ms to minimize.
[2024-05-30 14:01:56] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
[2024-05-30 14:01:56] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-30 14:01:56] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-30 14:01:56] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 2 ms to minimize.
[2024-05-30 14:01:56] [INFO ] Deduced a trap composed of 36 places in 76 ms of which 1 ms to minimize.
[2024-05-30 14:01:56] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-05-30 14:01:57] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 2 ms to minimize.
[2024-05-30 14:01:57] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-05-30 14:01:57] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-30 14:01:57] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 2 ms to minimize.
[2024-05-30 14:01:57] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-05-30 14:01:57] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 20/900 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:02:00] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 3 ms to minimize.
[2024-05-30 14:02:01] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2024-05-30 14:02:02] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 3 ms to minimize.
[2024-05-30 14:02:03] [INFO ] Deduced a trap composed of 32 places in 91 ms of which 2 ms to minimize.
[2024-05-30 14:02:04] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
SMT process timed out in 58948ms, After SMT, problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 58951ms
Starting structural reductions in LTL mode, iteration 1 : 393/433 places, 393/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59336 ms. Remains : 393/433 places, 393/433 transitions.
[2024-05-30 14:02:04] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:02:04] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:02:04] [INFO ] Input system was already deterministic with 393 transitions.
[2024-05-30 14:02:04] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:02:04] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:02:04] [INFO ] Time to serialize gal into /tmp/CTLFireability14240009021815596848.gal : 2 ms
[2024-05-30 14:02:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12241252684544027305.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/CTLFireability14240009021815596848.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12241252684544027305.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,5.98375e+35,15.3272,385536,2,8451,5,1.00172e+06,6,0,1967,2.93207e+06,0


Converting to forward existential form...Done !
original formula: EG(E(AX((((p490==1)&&(p57==1))&&((p259==1)&&((p329==1)||(p285==1))))) U E(!(((p327==1) * EF((p487==1)))) U EG(((p24==1)||(p359==1))))))
=> equivalent forward existential formula: [FwdG(Init,E(!(EX(!((((p490==1)&&(p57==1))&&((p259==1)&&((p329==1)||(p285==1))))))) U E(!(((p327==1) * E(TRUE U ...208
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t13, t18, t22, t26, t30, t31, t37, t41, t46, t50, t55, t59, t62, t66, t72, t76, t81, ...683
Detected timeout of ITS tools.
[2024-05-30 14:02:34] [INFO ] Flatten gal took : 9 ms
[2024-05-30 14:02:34] [INFO ] Applying decomposition
[2024-05-30 14:02:34] [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/graph7234548948386705952.txt' '-o' '/tmp/graph7234548948386705952.bin' '-w' '/tmp/graph7234548948386705952.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7234548948386705952.bin' '-l' '-1' '-v' '-w' '/tmp/graph7234548948386705952.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:02:34] [INFO ] Decomposing Gal with order
[2024-05-30 14:02:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:02:34] [INFO ] Removed a total of 101 redundant transitions.
[2024-05-30 14:02:34] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:02:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 14:02:34] [INFO ] Time to serialize gal into /tmp/CTLFireability11679509737474554651.gal : 2 ms
[2024-05-30 14:02:34] [INFO ] Time to serialize properties into /tmp/CTLFireability8280568030595187069.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/CTLFireability11679509737474554651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8280568030595187069.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,5.98375e+35,1.31989,42336,1302,39,68016,601,620,194357,49,1472,0


Converting to forward existential form...Done !
original formula: EG(E(AX((((i19.u152.p490==1)&&(i1.u18.p57==1))&&((i9.u79.p259==1)&&((i11.u101.p329==1)||(i10.u89.p285==1))))) U E(!(((i11.u100.p327==1) *...226
=> equivalent forward existential formula: [FwdG(Init,E(!(EX(!((((i19.u152.p490==1)&&(i1.u18.p57==1))&&((i9.u79.p259==1)&&((i11.u101.p329==1)||(i10.u89.p28...281
Reverse transition relation is NOT exact ! Due to transitions t354, t356, t358, t360, t363, t365, t367, t369, t371, i0.t343, i0.t327, i0.u4.t350, i0.u8.t34...1148
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
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 : 433/433 places, 433/433 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 396 transition count 396
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 396 transition count 396
Applied a total of 74 rules in 13 ms. Remains 396 /433 variables (removed 37) and now considering 396/433 (removed 37) transitions.
// Phase 1: matrix 396 rows 396 cols
[2024-05-30 14:03:04] [INFO ] Computed 41 invariants in 3 ms
[2024-05-30 14:03:04] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-30 14:03:04] [INFO ] Invariant cache hit.
[2024-05-30 14:03:04] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2024-05-30 14:03:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (OVERLAPS) 1/396 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-30 14:03:09] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:03:09] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2024-05-30 14:03:10] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:03:10] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:03:10] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 0 ms to minimize.
[2024-05-30 14:03:10] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:03:11] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2024-05-30 14:03:11] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 0 ms to minimize.
[2024-05-30 14:03:11] [INFO ] Deduced a trap composed of 25 places in 25 ms of which 0 ms to minimize.
[2024-05-30 14:03:11] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 1 ms to minimize.
[2024-05-30 14:03:11] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:03:11] [INFO ] Deduced a trap composed of 27 places in 26 ms of which 0 ms to minimize.
[2024-05-30 14:03:11] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:03:12] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2024-05-30 14:03:12] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:03:12] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:03:12] [INFO ] Deduced a trap composed of 29 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:03:12] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (OVERLAPS) 396/792 variables, 396/455 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/792 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (OVERLAPS) 0/792 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Real declared 792/792 variables, and 455 constraints, problems are : Problem set: 0 solved, 395 unsolved in 24556 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/395 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (OVERLAPS) 1/396 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 18/59 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-30 14:03:34] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-30 14:03:36] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:03:36] [INFO ] Deduced a trap composed of 37 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-30 14:03:37] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/396 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (OVERLAPS) 396/792 variables, 396/459 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/792 variables, 395/854 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-30 14:03:43] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:03:43] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:03:43] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 3 ms to minimize.
[2024-05-30 14:03:43] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-30 14:03:43] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-05-30 14:03:43] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:03:44] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 2 ms to minimize.
[2024-05-30 14:03:44] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:03:44] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-05-30 14:03:44] [INFO ] Deduced a trap composed of 25 places in 114 ms of which 2 ms to minimize.
[2024-05-30 14:03:44] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 3 ms to minimize.
[2024-05-30 14:03:44] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:03:45] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2024-05-30 14:03:45] [INFO ] Deduced a trap composed of 31 places in 107 ms of which 3 ms to minimize.
[2024-05-30 14:03:45] [INFO ] Deduced a trap composed of 23 places in 108 ms of which 2 ms to minimize.
[2024-05-30 14:03:45] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 3 ms to minimize.
[2024-05-30 14:03:45] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:03:45] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:03:45] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 3 ms to minimize.
[2024-05-30 14:03:46] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/792 variables, 20/874 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-30 14:03:48] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 3 ms to minimize.
[2024-05-30 14:03:48] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-30 14:03:48] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 3 ms to minimize.
[2024-05-30 14:03:49] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 3 ms to minimize.
[2024-05-30 14:03:49] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 3 ms to minimize.
[2024-05-30 14:03:49] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:03:50] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 3 ms to minimize.
[2024-05-30 14:03:50] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:03:50] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 3 ms to minimize.
[2024-05-30 14:03:50] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-05-30 14:03:50] [INFO ] Deduced a trap composed of 32 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:03:51] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 3 ms to minimize.
[2024-05-30 14:03:51] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-30 14:03:51] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:03:51] [INFO ] Deduced a trap composed of 32 places in 102 ms of which 3 ms to minimize.
[2024-05-30 14:03:51] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:03:52] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 3 ms to minimize.
[2024-05-30 14:03:52] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:03:52] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:03:52] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/792 variables, 20/894 constraints. Problems are: Problem set: 0 solved, 395 unsolved
[2024-05-30 14:03:55] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:03:55] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 3 ms to minimize.
[2024-05-30 14:03:56] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:03:56] [INFO ] Deduced a trap composed of 23 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:03:56] [INFO ] Deduced a trap composed of 30 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:03:56] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 3 ms to minimize.
[2024-05-30 14:03:56] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 3 ms to minimize.
[2024-05-30 14:03:57] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-30 14:03:57] [INFO ] Deduced a trap composed of 25 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:03:57] [INFO ] Deduced a trap composed of 49 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:03:57] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 3 ms to minimize.
[2024-05-30 14:03:58] [INFO ] Deduced a trap composed of 30 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:03:58] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:03:58] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 2 ms to minimize.
[2024-05-30 14:03:59] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 3 ms to minimize.
[2024-05-30 14:03:59] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:03:59] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 792/792 variables, and 911 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 396/396 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 79/79 constraints]
After SMT, in 54617ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 54621ms
Starting structural reductions in LTL mode, iteration 1 : 396/433 places, 396/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54962 ms. Remains : 396/433 places, 396/433 transitions.
[2024-05-30 14:03:59] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:03:59] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:03:59] [INFO ] Input system was already deterministic with 396 transitions.
[2024-05-30 14:03:59] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:03:59] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:03:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16257337877883887826.gal : 2 ms
[2024-05-30 14:03:59] [INFO ] Time to serialize properties into /tmp/CTLFireability9292151161238602564.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/CTLFireability16257337877883887826.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9292151161238602564.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,8.1503e+35,17.9447,441632,2,9016,5,1.08879e+06,6,0,1982,3.38026e+06,0


Converting to forward existential form...Done !
original formula: E(!(((p313==1) * !(AX(E((p110==1) U (p241==1)))))) U E((A(!(AX((p252==1))) U A((((p418==1)&&(p424==1))&&(p440==1)) U (p339==1))) * (A(((p...369
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,!(((p313==1) * !(!(EX(!(E((p110==1) U (p241==1))))))))),(!((E(!(!((E(!((p339==1)) U (!((((p418...1409
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t8, t13, t17, t22, t26, t30, t31, t37, t41, t46, t50, t55, t59, t62, t66, t72, t76, t...699
Detected timeout of ITS tools.
[2024-05-30 14:04:29] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:04:29] [INFO ] Applying decomposition
[2024-05-30 14:04:29] [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/graph8994690317385223084.txt' '-o' '/tmp/graph8994690317385223084.bin' '-w' '/tmp/graph8994690317385223084.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8994690317385223084.bin' '-l' '-1' '-v' '-w' '/tmp/graph8994690317385223084.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:04:29] [INFO ] Decomposing Gal with order
[2024-05-30 14:04:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:04:29] [INFO ] Removed a total of 98 redundant transitions.
[2024-05-30 14:04:29] [INFO ] Flatten gal took : 25 ms
[2024-05-30 14:04:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 14:04:29] [INFO ] Time to serialize gal into /tmp/CTLFireability14772992804273131813.gal : 4 ms
[2024-05-30 14:04:29] [INFO ] Time to serialize properties into /tmp/CTLFireability1745834818582541698.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/CTLFireability14772992804273131813.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1745834818582541698.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,8.1503e+35,1.09324,37108,703,38,59085,652,620,147502,52,1585,0


Converting to forward existential form...Done !
original formula: E(!(((i13.i1.u99.p313==1) * !(AX(E((i2.i3.u33.p110==1) U (i10.u75.p241==1)))))) U E((A(!(AX((i6.i3.u79.p252==1))) U A((((i18.u129.p418==1...608
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,!(((i13.i1.u99.p313==1) * !(!(EX(!(E((i2.i3.u33.p110==1) U (i10.u75.p241==1))))))))),(!((E(!(!...2139
Reverse transition relation is NOT exact ! Due to transitions t357, t359, t361, t363, t366, t368, t370, t372, t374, i0.i0.u4.t353, i0.i2.t339, i0.i2.t343, ...1349
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 432 transition count 315
Reduce places removed 117 places and 0 transitions.
Iterating post reduction 1 with 117 rules applied. Total rules applied 234 place count 315 transition count 315
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 61 Pre rules applied. Total rules applied 234 place count 315 transition count 254
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 2 with 122 rules applied. Total rules applied 356 place count 254 transition count 254
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 386 place count 224 transition count 224
Iterating global reduction 2 with 30 rules applied. Total rules applied 416 place count 224 transition count 224
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 416 place count 224 transition count 203
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 458 place count 203 transition count 203
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 616 place count 124 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 617 place count 124 transition count 123
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 3 with 2 rules applied. Total rules applied 619 place count 123 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 621 place count 121 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 622 place count 120 transition count 120
Applied a total of 622 rules in 42 ms. Remains 120 /433 variables (removed 313) and now considering 120/433 (removed 313) transitions.
// Phase 1: matrix 120 rows 120 cols
[2024-05-30 14:04:59] [INFO ] Computed 40 invariants in 1 ms
[2024-05-30 14:05:00] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-05-30 14:05:00] [INFO ] Invariant cache hit.
[2024-05-30 14:05:00] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2024-05-30 14:05:00] [INFO ] Redundant transitions in 1 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-30 14:05:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 120/240 variables, 120/160 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 0/240 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 160 constraints, problems are : Problem set: 0 solved, 119 unsolved in 1732 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 120/240 variables, 120/160 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 119/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 0/240 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 279 constraints, problems are : Problem set: 0 solved, 119 unsolved in 1820 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 120/120 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 3581ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 3583ms
Starting structural reductions in SI_CTL mode, iteration 1 : 120/433 places, 120/433 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3946 ms. Remains : 120/433 places, 120/433 transitions.
[2024-05-30 14:05:03] [INFO ] Flatten gal took : 2 ms
[2024-05-30 14:05:03] [INFO ] Flatten gal took : 2 ms
[2024-05-30 14:05:03] [INFO ] Input system was already deterministic with 120 transitions.
[2024-05-30 14:05:03] [INFO ] Flatten gal took : 2 ms
RANDOM walk for 462 steps (0 resets) in 5 ms. (77 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-010B-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-30 14:05:03] [INFO ] Flatten gal took : 3 ms
[2024-05-30 14:05:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11759947938667186973.gal : 9 ms
[2024-05-30 14:05:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8522038632226527040.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11759947938667186973.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8522038632226527040.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 393 transition count 393
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 393 transition count 393
Applied a total of 80 rules in 8 ms. Remains 393 /433 variables (removed 40) and now considering 393/433 (removed 40) transitions.
// Phase 1: matrix 393 rows 393 cols
[2024-05-30 14:05:03] [INFO ] Computed 41 invariants in 2 ms
[2024-05-30 14:05:03] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-30 14:05:03] [INFO ] Invariant cache hit.
[2024-05-30 14:05:04] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2024-05-30 14:05:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/393 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:05:08] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 0 ms to minimize.
[2024-05-30 14:05:08] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:05:09] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:05:09] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:05:09] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:05:09] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:05:09] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:05:10] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 0 ms to minimize.
[2024-05-30 14:05:10] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 0 ms to minimize.
[2024-05-30 14:05:10] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2024-05-30 14:05:11] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:05:11] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:05:13] [INFO ] Deduced a trap composed of 31 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/393 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (OVERLAPS) 393/786 variables, 393/447 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 0/786 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Real declared 786/786 variables, and 447 constraints, problems are : Problem set: 0 solved, 392 unsolved in 26200 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/392 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (OVERLAPS) 1/393 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/393 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (OVERLAPS) 393/786 variables, 393/447 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/786 variables, 392/839 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:05:36] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 3 ms to minimize.
[2024-05-30 14:05:36] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 3 ms to minimize.
[2024-05-30 14:05:36] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 2 ms to minimize.
[2024-05-30 14:05:37] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 3 ms to minimize.
[2024-05-30 14:05:37] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2024-05-30 14:05:37] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-30 14:05:37] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 3 ms to minimize.
[2024-05-30 14:05:37] [INFO ] Deduced a trap composed of 45 places in 109 ms of which 2 ms to minimize.
[2024-05-30 14:05:37] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:05:38] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 3 ms to minimize.
[2024-05-30 14:05:38] [INFO ] Deduced a trap composed of 30 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:05:38] [INFO ] Deduced a trap composed of 37 places in 104 ms of which 2 ms to minimize.
[2024-05-30 14:05:38] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 2 ms to minimize.
[2024-05-30 14:05:38] [INFO ] Deduced a trap composed of 32 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:05:38] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-05-30 14:05:38] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-30 14:05:38] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:05:39] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:05:39] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 3 ms to minimize.
[2024-05-30 14:05:39] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 20/859 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:05:41] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-30 14:05:41] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:05:42] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 3 ms to minimize.
[2024-05-30 14:05:42] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-30 14:05:42] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 2 ms to minimize.
[2024-05-30 14:05:43] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-30 14:05:43] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 3 ms to minimize.
[2024-05-30 14:05:43] [INFO ] Deduced a trap composed of 36 places in 114 ms of which 2 ms to minimize.
[2024-05-30 14:05:43] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2024-05-30 14:05:43] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:05:43] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 2 ms to minimize.
[2024-05-30 14:05:44] [INFO ] Deduced a trap composed of 34 places in 119 ms of which 3 ms to minimize.
[2024-05-30 14:05:44] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 3 ms to minimize.
[2024-05-30 14:05:44] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 3 ms to minimize.
[2024-05-30 14:05:44] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 3 ms to minimize.
[2024-05-30 14:05:44] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:05:45] [INFO ] Deduced a trap composed of 35 places in 117 ms of which 3 ms to minimize.
[2024-05-30 14:05:45] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-30 14:05:45] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:05:45] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 20/879 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:05:47] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
[2024-05-30 14:05:48] [INFO ] Deduced a trap composed of 26 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:05:48] [INFO ] Deduced a trap composed of 23 places in 110 ms of which 2 ms to minimize.
[2024-05-30 14:05:48] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-30 14:05:49] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 3 ms to minimize.
[2024-05-30 14:05:49] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:05:50] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-30 14:05:51] [INFO ] Deduced a trap composed of 41 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:05:51] [INFO ] Deduced a trap composed of 29 places in 103 ms of which 2 ms to minimize.
[2024-05-30 14:05:51] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:05:52] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:05:52] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 3 ms to minimize.
[2024-05-30 14:05:52] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:05:52] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:05:52] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 3 ms to minimize.
[2024-05-30 14:05:53] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 3 ms to minimize.
[2024-05-30 14:05:53] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:05:53] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:05:54] [INFO ] Deduced a trap composed of 36 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:05:54] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 20/899 constraints. Problems are: Problem set: 0 solved, 392 unsolved
[2024-05-30 14:05:57] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:05:58] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2024-05-30 14:05:59] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:05:59] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:05:59] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:05:59] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-30 14:06:00] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:06:00] [INFO ] Deduced a trap composed of 44 places in 95 ms of which 2 ms to minimize.
[2024-05-30 14:06:00] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 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 786/786 variables, and 908 constraints, problems are : Problem set: 0 solved, 392 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 393/393 constraints, PredecessorRefiner: 392/392 constraints, Known Traps: 82/82 constraints]
After SMT, in 56271ms problems are : Problem set: 0 solved, 392 unsolved
Search for dead transitions found 0 dead transitions in 56275ms
Starting structural reductions in LTL mode, iteration 1 : 393/433 places, 393/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56621 ms. Remains : 393/433 places, 393/433 transitions.
[2024-05-30 14:06:00] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:06:00] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:06:00] [INFO ] Input system was already deterministic with 393 transitions.
[2024-05-30 14:06:00] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:06:00] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:06:00] [INFO ] Time to serialize gal into /tmp/CTLFireability14453395603450851079.gal : 1 ms
[2024-05-30 14:06:00] [INFO ] Time to serialize properties into /tmp/CTLFireability5303256969386637888.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/CTLFireability14453395603450851079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5303256969386637888.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,7.06233e+35,16.6051,411468,2,7556,5,916228,6,0,1967,3.34296e+06,0


Converting to forward existential form...Done !
original formula: AF(EG(EX(((p434==1)||((p322==0)&&(p396==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(EX(((p434==1)||((p322==0)&&(p396==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t50, t55, t59, t62, t66, t72, t76, ...681
Detected timeout of ITS tools.
[2024-05-30 14:06:30] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:06:30] [INFO ] Applying decomposition
[2024-05-30 14:06:30] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15908992218562874575.txt' '-o' '/tmp/graph15908992218562874575.bin' '-w' '/tmp/graph15908992218562874575.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15908992218562874575.bin' '-l' '-1' '-v' '-w' '/tmp/graph15908992218562874575.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:06:30] [INFO ] Decomposing Gal with order
[2024-05-30 14:06:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:06:30] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 14:06:30] [INFO ] Flatten gal took : 21 ms
[2024-05-30 14:06:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 14:06:30] [INFO ] Time to serialize gal into /tmp/CTLFireability13753359521581569315.gal : 3 ms
[2024-05-30 14:06:30] [INFO ] Time to serialize properties into /tmp/CTLFireability5386549746343015588.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/CTLFireability13753359521581569315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5386549746343015588.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,7.06233e+35,1.18382,36828,650,23,60304,588,565,146173,38,1511,0


Converting to forward existential form...Done !
original formula: AF(EG(EX(((i16.i1.u138.p434==1)||((i0.i1.u99.p322==0)&&(i14.i3.u125.p396==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(EX(((i16.i1.u138.p434==1)||((i0.i1.u99.p322==0)&&(i14.i3.u125.p396==0)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t354, t356, t358, t360, t363, t365, t367, t369, t371, i0.i1.t133, i0.i1.u97.t137, i0.i2.t126,...1301
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 a local SCC at level 17
Fast SCC detection found an SCC at level 18
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 : 433/433 places, 433/433 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 117 place count 432 transition count 315
Reduce places removed 117 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 118 rules applied. Total rules applied 235 place count 315 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 236 place count 314 transition count 314
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 236 place count 314 transition count 253
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 358 place count 253 transition count 253
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 388 place count 223 transition count 223
Iterating global reduction 3 with 30 rules applied. Total rules applied 418 place count 223 transition count 223
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 418 place count 223 transition count 202
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 460 place count 202 transition count 202
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 614 place count 125 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 615 place count 125 transition count 124
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 4 with 2 rules applied. Total rules applied 617 place count 124 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 619 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 620 place count 121 transition count 121
Applied a total of 620 rules in 30 ms. Remains 121 /433 variables (removed 312) and now considering 121/433 (removed 312) transitions.
// Phase 1: matrix 121 rows 121 cols
[2024-05-30 14:07:00] [INFO ] Computed 40 invariants in 0 ms
[2024-05-30 14:07:00] [INFO ] Implicit Places using invariants in 116 ms returned []
[2024-05-30 14:07:00] [INFO ] Invariant cache hit.
[2024-05-30 14:07:00] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-05-30 14:07:00] [INFO ] Redundant transitions in 1 ms returned []
Running 119 sub problems to find dead transitions.
[2024-05-30 14:07:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 121/242 variables, 121/161 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 161 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2332 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/120 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/120 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 1/121 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 121/242 variables, 121/161 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 119/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 0/242 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 280 constraints, problems are : Problem set: 0 solved, 119 unsolved in 2114 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 121/121 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 0/0 constraints]
After SMT, in 4474ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 4476ms
Starting structural reductions in SI_CTL mode, iteration 1 : 121/433 places, 121/433 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4759 ms. Remains : 121/433 places, 121/433 transitions.
[2024-05-30 14:07:05] [INFO ] Flatten gal took : 5 ms
[2024-05-30 14:07:05] [INFO ] Flatten gal took : 3 ms
[2024-05-30 14:07:05] [INFO ] Input system was already deterministic with 121 transitions.
[2024-05-30 14:07:05] [INFO ] Flatten gal took : 3 ms
[2024-05-30 14:07:05] [INFO ] Flatten gal took : 3 ms
[2024-05-30 14:07:05] [INFO ] Time to serialize gal into /tmp/CTLFireability7823667696363790429.gal : 1 ms
[2024-05-30 14:07:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10939952623079048418.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/CTLFireability7823667696363790429.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10939952623079048418.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.17074e+19,0.055758,5564,2,207,5,8991,6,0,607,12407,0


Converting to forward existential form...Done !
original formula: EG(EF((p360==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (p360==1)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-30 14:07:35] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:07:35] [INFO ] Applying decomposition
[2024-05-30 14:07:35] [INFO ] Flatten gal took : 2 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/graph12656697132233260390.txt' '-o' '/tmp/graph12656697132233260390.bin' '-w' '/tmp/graph12656697132233260390.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12656697132233260390.bin' '-l' '-1' '-v' '-w' '/tmp/graph12656697132233260390.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:07:35] [INFO ] Decomposing Gal with order
[2024-05-30 14:07:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:07:35] [INFO ] Removed a total of 29 redundant transitions.
[2024-05-30 14:07:35] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:07:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 14:07:35] [INFO ] Time to serialize gal into /tmp/CTLFireability1745101607887710634.gal : 2 ms
[2024-05-30 14:07:35] [INFO ] Time to serialize properties into /tmp/CTLFireability5793126712002827368.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/CTLFireability1745101607887710634.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5793126712002827368.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.17074e+19,0.035663,5008,31,15,2676,62,219,5193,37,149,0


Converting to forward existential form...Done !
original formula: EG(EF((i7.u29.p360==1)))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U (i7.u29.p360==1)))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 391 transition count 391
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 391 transition count 391
Applied a total of 84 rules in 8 ms. Remains 391 /433 variables (removed 42) and now considering 391/433 (removed 42) transitions.
// Phase 1: matrix 391 rows 391 cols
[2024-05-30 14:08:05] [INFO ] Computed 41 invariants in 1 ms
[2024-05-30 14:08:05] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-30 14:08:05] [INFO ] Invariant cache hit.
[2024-05-30 14:08:05] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 390 sub problems to find dead transitions.
[2024-05-30 14:08:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (OVERLAPS) 1/391 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 14:08:10] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-30 14:08:10] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 0 ms to minimize.
[2024-05-30 14:08:10] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
[2024-05-30 14:08:11] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:08:11] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:08:11] [INFO ] Deduced a trap composed of 25 places in 31 ms of which 0 ms to minimize.
[2024-05-30 14:08:11] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:08:12] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-30 14:08:12] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-30 14:08:12] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
[2024-05-30 14:08:12] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 391/782 variables, 391/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (OVERLAPS) 0/782 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 782/782 variables, and 443 constraints, problems are : Problem set: 0 solved, 390 unsolved in 23568 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (OVERLAPS) 1/391 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/391 variables, 11/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 391/782 variables, 391/443 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/782 variables, 390/833 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 14:08:34] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-30 14:08:35] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:08:35] [INFO ] Deduced a trap composed of 21 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:08:35] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:08:35] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2024-05-30 14:08:35] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 1 ms to minimize.
[2024-05-30 14:08:35] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 1 ms to minimize.
[2024-05-30 14:08:35] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-05-30 14:08:35] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-30 14:08:36] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2024-05-30 14:08:36] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-30 14:08:36] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 3 ms to minimize.
[2024-05-30 14:08:36] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 3 ms to minimize.
[2024-05-30 14:08:37] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-05-30 14:08:37] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-30 14:08:37] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:08:37] [INFO ] Deduced a trap composed of 36 places in 120 ms of which 3 ms to minimize.
[2024-05-30 14:08:38] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 3 ms to minimize.
[2024-05-30 14:08:38] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-30 14:08:38] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/782 variables, 20/853 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 14:08:40] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 3 ms to minimize.
[2024-05-30 14:08:40] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 2 ms to minimize.
[2024-05-30 14:08:40] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 2 ms to minimize.
[2024-05-30 14:08:41] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:08:41] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 2 ms to minimize.
[2024-05-30 14:08:41] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2024-05-30 14:08:41] [INFO ] Deduced a trap composed of 31 places in 112 ms of which 2 ms to minimize.
[2024-05-30 14:08:42] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 2 ms to minimize.
[2024-05-30 14:08:42] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-30 14:08:42] [INFO ] Deduced a trap composed of 25 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:08:42] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 2 ms to minimize.
[2024-05-30 14:08:43] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:08:43] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-30 14:08:43] [INFO ] Deduced a trap composed of 31 places in 127 ms of which 2 ms to minimize.
[2024-05-30 14:08:43] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 2 ms to minimize.
[2024-05-30 14:08:43] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:08:44] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 2 ms to minimize.
[2024-05-30 14:08:44] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 2 ms to minimize.
[2024-05-30 14:08:44] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-30 14:08:44] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 20/873 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 14:08:46] [INFO ] Deduced a trap composed of 23 places in 137 ms of which 3 ms to minimize.
[2024-05-30 14:08:47] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2024-05-30 14:08:47] [INFO ] Deduced a trap composed of 27 places in 114 ms of which 2 ms to minimize.
[2024-05-30 14:08:47] [INFO ] Deduced a trap composed of 22 places in 118 ms of which 2 ms to minimize.
[2024-05-30 14:08:48] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 2 ms to minimize.
[2024-05-30 14:08:48] [INFO ] Deduced a trap composed of 41 places in 128 ms of which 2 ms to minimize.
[2024-05-30 14:08:48] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:08:49] [INFO ] Deduced a trap composed of 25 places in 107 ms of which 2 ms to minimize.
[2024-05-30 14:08:49] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:08:49] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-05-30 14:08:49] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-05-30 14:08:50] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 2 ms to minimize.
[2024-05-30 14:08:50] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 2 ms to minimize.
[2024-05-30 14:08:50] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-05-30 14:08:51] [INFO ] Deduced a trap composed of 25 places in 109 ms of which 2 ms to minimize.
[2024-05-30 14:08:51] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-05-30 14:08:51] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:08:51] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:08:51] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:08:51] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 20/893 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-30 14:08:55] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
[2024-05-30 14:08:56] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:08:56] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2024-05-30 14:08:57] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-05-30 14:08:57] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 3 ms to minimize.
[2024-05-30 14:08:57] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 2 ms to minimize.
[2024-05-30 14:08:58] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-05-30 14:08:58] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:08:59] [INFO ] Deduced a trap composed of 35 places in 124 ms of which 2 ms to minimize.
[2024-05-30 14:08:59] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 3 ms to minimize.
[2024-05-30 14:08:59] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 3 ms to minimize.
[2024-05-30 14:08:59] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 782/782 variables, and 905 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 83/83 constraints]
After SMT, in 53614ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 53617ms
Starting structural reductions in LTL mode, iteration 1 : 391/433 places, 391/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54030 ms. Remains : 391/433 places, 391/433 transitions.
[2024-05-30 14:08:59] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:08:59] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:08:59] [INFO ] Input system was already deterministic with 391 transitions.
[2024-05-30 14:08:59] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:08:59] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:08:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1409338065633696391.gal : 1 ms
[2024-05-30 14:08:59] [INFO ] Time to serialize properties into /tmp/CTLFireability4687143420537018541.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/CTLFireability1409338065633696391.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4687143420537018541.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,5.56678e+35,13.4563,370340,2,7607,5,949042,6,0,1957,2.82851e+06,0


Converting to forward existential form...Done !
original formula: (AF((((AG((p94==0)) + AF((p290==1))) * EG(AX((p225==1)))) * (EX((((p281==0)||(p300==0))||((p366==1)||(p17==1)))) * (p213==1)))) + AX((p43...162
=> equivalent forward existential formula: [(EY((Init * !(!(EG(!((((!(E(TRUE U !((p94==0)))) + !(EG(!((p290==1))))) * EG(!(EX(!((p225==1)))))) * (EX((((p28...242
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t12, t16, t21, t25, t29, t30, t36, t40, t45, t49, t54, t58, t61, t65, t71, t75, t80, ...671
Using saturation style SCC detection
Detected timeout of ITS tools.
[2024-05-30 14:09:29] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:09:29] [INFO ] Applying decomposition
[2024-05-30 14:09:29] [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/graph10587213211876539728.txt' '-o' '/tmp/graph10587213211876539728.bin' '-w' '/tmp/graph10587213211876539728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10587213211876539728.bin' '-l' '-1' '-v' '-w' '/tmp/graph10587213211876539728.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:09:29] [INFO ] Decomposing Gal with order
[2024-05-30 14:09:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:09:29] [INFO ] Removed a total of 102 redundant transitions.
[2024-05-30 14:09:29] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:09:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-30 14:09:29] [INFO ] Time to serialize gal into /tmp/CTLFireability4669671646551693708.gal : 3 ms
[2024-05-30 14:09:29] [INFO ] Time to serialize properties into /tmp/CTLFireability16813042964921007662.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/CTLFireability4669671646551693708.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16813042964921007662.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,5.56678e+35,0.697767,26348,629,38,39232,549,567,103415,47,1515,0


Converting to forward existential form...Done !
original formula: (AF((((AG((i2.u31.p94==0)) + AF((i11.u88.p290==1))) * EG(AX((i7.i2.u69.p225==1)))) * (EX((((i9.i1.u87.p281==0)||(i9.i2.u92.p300==0))||((i...247
=> equivalent forward existential formula: [(EY((Init * !(!(EG(!((((!(E(TRUE U !((i2.u31.p94==0)))) + !(EG(!((i11.u88.p290==1))))) * EG(!(EX(!((i7.i2.u69.p...327
Reverse transition relation is NOT exact ! Due to transitions t352, t354, t356, t358, t361, t363, t365, t367, t369, i0.i1.t306, i0.i1.u23.t310, i0.i2.t299,...1265
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 a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 433/433 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 398 transition count 398
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 398 transition count 398
Applied a total of 70 rules in 7 ms. Remains 398 /433 variables (removed 35) and now considering 398/433 (removed 35) transitions.
// Phase 1: matrix 398 rows 398 cols
[2024-05-30 14:09:59] [INFO ] Computed 41 invariants in 3 ms
[2024-05-30 14:09:59] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-30 14:09:59] [INFO ] Invariant cache hit.
[2024-05-30 14:10:00] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2024-05-30 14:10:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/398 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-30 14:10:04] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
[2024-05-30 14:10:04] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:10:04] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:10:05] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:10:05] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:10:05] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
[2024-05-30 14:10:05] [INFO ] Deduced a trap composed of 26 places in 28 ms of which 1 ms to minimize.
[2024-05-30 14:10:05] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:10:05] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2024-05-30 14:10:05] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-30 14:10:05] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:10:06] [INFO ] Deduced a trap composed of 25 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:10:06] [INFO ] Deduced a trap composed of 26 places in 26 ms of which 0 ms to minimize.
[2024-05-30 14:10:06] [INFO ] Deduced a trap composed of 27 places in 24 ms of which 0 ms to minimize.
[2024-05-30 14:10:06] [INFO ] Deduced a trap composed of 29 places in 25 ms of which 0 ms to minimize.
[2024-05-30 14:10:07] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 0 ms to minimize.
[2024-05-30 14:10:07] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:10:07] [INFO ] Deduced a trap composed of 27 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:10:07] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-05-30 14:10:07] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-30 14:10:09] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (OVERLAPS) 398/796 variables, 398/460 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-30 14:10:22] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:10:24] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/796 variables, 2/462 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/796 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 796/796 variables, and 462 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/397 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (OVERLAPS) 1/398 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/398 variables, 23/64 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-30 14:10:34] [INFO ] Deduced a trap composed of 30 places in 35 ms of which 0 ms to minimize.
[2024-05-30 14:10:34] [INFO ] Deduced a trap composed of 31 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-30 14:10:35] [INFO ] Deduced a trap composed of 23 places in 30 ms of which 0 ms to minimize.
[2024-05-30 14:10:35] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-30 14:10:38] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 7 (OVERLAPS) 398/796 variables, 398/467 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/796 variables, 397/864 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-30 14:10:43] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 3 ms to minimize.
[2024-05-30 14:10:43] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 2 ms to minimize.
[2024-05-30 14:10:44] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:10:44] [INFO ] Deduced a trap composed of 19 places in 114 ms of which 3 ms to minimize.
[2024-05-30 14:10:44] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 2 ms to minimize.
[2024-05-30 14:10:45] [INFO ] Deduced a trap composed of 28 places in 104 ms of which 2 ms to minimize.
[2024-05-30 14:10:45] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2024-05-30 14:10:45] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 3 ms to minimize.
[2024-05-30 14:10:45] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 2 ms to minimize.
[2024-05-30 14:10:46] [INFO ] Deduced a trap composed of 35 places in 114 ms of which 2 ms to minimize.
[2024-05-30 14:10:46] [INFO ] Deduced a trap composed of 30 places in 116 ms of which 2 ms to minimize.
[2024-05-30 14:10:46] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 2 ms to minimize.
[2024-05-30 14:10:46] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 2 ms to minimize.
[2024-05-30 14:10:46] [INFO ] Deduced a trap composed of 26 places in 115 ms of which 2 ms to minimize.
[2024-05-30 14:10:46] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-05-30 14:10:46] [INFO ] Deduced a trap composed of 25 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:10:47] [INFO ] Deduced a trap composed of 34 places in 128 ms of which 2 ms to minimize.
[2024-05-30 14:10:47] [INFO ] Deduced a trap composed of 34 places in 110 ms of which 2 ms to minimize.
[2024-05-30 14:10:47] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-30 14:10:47] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/796 variables, 20/884 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-30 14:10:50] [INFO ] Deduced a trap composed of 25 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:10:50] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 2 ms to minimize.
[2024-05-30 14:10:50] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-30 14:10:51] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 2 ms to minimize.
[2024-05-30 14:10:51] [INFO ] Deduced a trap composed of 32 places in 103 ms of which 1 ms to minimize.
[2024-05-30 14:10:52] [INFO ] Deduced a trap composed of 35 places in 107 ms of which 2 ms to minimize.
[2024-05-30 14:10:52] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 2 ms to minimize.
[2024-05-30 14:10:52] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 2 ms to minimize.
[2024-05-30 14:10:53] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:10:53] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 1 ms to minimize.
[2024-05-30 14:10:53] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:10:53] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:10:53] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:10:53] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:10:54] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:10:54] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-05-30 14:10:54] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:10:54] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:10:55] [INFO ] Deduced a trap composed of 27 places in 108 ms of which 2 ms to minimize.
[2024-05-30 14:10:55] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/796 variables, 20/904 constraints. Problems are: Problem set: 0 solved, 397 unsolved
[2024-05-30 14:10:57] [INFO ] Deduced a trap composed of 22 places in 119 ms of which 2 ms to minimize.
[2024-05-30 14:10:58] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:10:58] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-30 14:10:58] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 2 ms to minimize.
[2024-05-30 14:10:59] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 2 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/796 variables, and 909 constraints, problems are : Problem set: 0 solved, 397 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 398/398 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 73/73 constraints]
After SMT, in 60069ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 398/433 places, 398/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60440 ms. Remains : 398/433 places, 398/433 transitions.
[2024-05-30 14:11:00] [INFO ] Flatten gal took : 8 ms
[2024-05-30 14:11:00] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:11:00] [INFO ] Input system was already deterministic with 398 transitions.
[2024-05-30 14:11:00] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:11:00] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:11:00] [INFO ] Time to serialize gal into /tmp/CTLFireability17146504277967262178.gal : 1 ms
[2024-05-30 14:11:00] [INFO ] Time to serialize properties into /tmp/CTLFireability4543427293078517511.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/CTLFireability17146504277967262178.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4543427293078517511.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,8.16059e+35,19.0535,497308,2,10300,5,1.25318e+06,6,0,1992,3.79782e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-30 14:11:30] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:11:30] [INFO ] Applying decomposition
[2024-05-30 14:11:30] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3246150277292158937.txt' '-o' '/tmp/graph3246150277292158937.bin' '-w' '/tmp/graph3246150277292158937.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3246150277292158937.bin' '-l' '-1' '-v' '-w' '/tmp/graph3246150277292158937.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:11:30] [INFO ] Decomposing Gal with order
[2024-05-30 14:11:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:11:30] [INFO ] Removed a total of 96 redundant transitions.
[2024-05-30 14:11:30] [INFO ] Flatten gal took : 16 ms
[2024-05-30 14:11:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 14:11:30] [INFO ] Time to serialize gal into /tmp/CTLFireability17102920692456071033.gal : 21 ms
[2024-05-30 14:11:30] [INFO ] Time to serialize properties into /tmp/CTLFireability15178064047666184976.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/CTLFireability17102920692456071033.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15178064047666184976.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,8.16059e+35,1.76351,56100,1469,38,96958,687,666,249267,52,1828,0


Converting to forward existential form...Done !
original formula: ((EF(((i17.u127.p417==1) * ((i14.u107.p355==0) + AX((i19.u150.p486==0))))) * AF(((i17.u128.p411==0) * AG(AF((i7.u49.p159==0)))))) * ((EX(...375
=> equivalent forward existential formula: (([(Init * !(E(TRUE U ((i17.u127.p417==1) * ((i14.u107.p355==0) + !(EX(!((i19.u150.p486==0)))))))))] = FALSE * [...1098
Reverse transition relation is NOT exact ! Due to transitions t361, t363, t365, t370, t372, t374, t376, i0.t260, i0.u46.t264, i1.t312, i1.u24.t313, i1.u24....1281
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 a local 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 : 433/433 places, 433/433 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 399 transition count 399
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 399 transition count 399
Applied a total of 68 rules in 15 ms. Remains 399 /433 variables (removed 34) and now considering 399/433 (removed 34) transitions.
// Phase 1: matrix 399 rows 399 cols
[2024-05-30 14:12:00] [INFO ] Computed 41 invariants in 17 ms
[2024-05-30 14:12:00] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-30 14:12:00] [INFO ] Invariant cache hit.
[2024-05-30 14:12:00] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 398 sub problems to find dead transitions.
[2024-05-30 14:12:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (OVERLAPS) 1/399 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-30 14:12:05] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 10 ms to minimize.
[2024-05-30 14:12:05] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-30 14:12:05] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2024-05-30 14:12:05] [INFO ] Deduced a trap composed of 21 places in 25 ms of which 0 ms to minimize.
[2024-05-30 14:12:06] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-30 14:12:06] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2024-05-30 14:12:06] [INFO ] Deduced a trap composed of 24 places in 24 ms of which 0 ms to minimize.
[2024-05-30 14:12:06] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-05-30 14:12:07] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 0 ms to minimize.
[2024-05-30 14:12:07] [INFO ] Deduced a trap composed of 24 places in 28 ms of which 0 ms to minimize.
[2024-05-30 14:12:07] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-05-30 14:12:07] [INFO ] Deduced a trap composed of 27 places in 47 ms of which 1 ms to minimize.
[2024-05-30 14:12:07] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 0 ms to minimize.
[2024-05-30 14:12:07] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2024-05-30 14:12:07] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-30 14:12:07] [INFO ] Deduced a trap composed of 25 places in 44 ms of which 1 ms to minimize.
[2024-05-30 14:12:08] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-05-30 14:12:08] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-05-30 14:12:08] [INFO ] Deduced a trap composed of 29 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (OVERLAPS) 399/798 variables, 399/459 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/798 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 6 (OVERLAPS) 0/798 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Real declared 798/798 variables, and 459 constraints, problems are : Problem set: 0 solved, 398 unsolved in 24464 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 399/399 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/398 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (OVERLAPS) 1/399 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-30 14:12:28] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 3 ms to minimize.
[2024-05-30 14:12:28] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-05-30 14:12:29] [INFO ] Deduced a trap composed of 23 places in 41 ms of which 1 ms to minimize.
[2024-05-30 14:12:30] [INFO ] Deduced a trap composed of 26 places in 39 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 4/64 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-30 14:12:32] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-30 14:12:35] [INFO ] Deduced a trap composed of 31 places in 33 ms of which 1 ms to minimize.
[2024-05-30 14:12:35] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-30 14:12:37] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/399 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/399 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 8 (OVERLAPS) 399/798 variables, 399/467 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 398/865 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-30 14:12:41] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 2 ms to minimize.
[2024-05-30 14:12:42] [INFO ] Deduced a trap composed of 33 places in 110 ms of which 2 ms to minimize.
[2024-05-30 14:12:42] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 2 ms to minimize.
[2024-05-30 14:12:42] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-05-30 14:12:42] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2024-05-30 14:12:43] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 2 ms to minimize.
[2024-05-30 14:12:43] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-30 14:12:43] [INFO ] Deduced a trap composed of 37 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:12:43] [INFO ] Deduced a trap composed of 25 places in 116 ms of which 3 ms to minimize.
[2024-05-30 14:12:44] [INFO ] Deduced a trap composed of 28 places in 133 ms of which 3 ms to minimize.
[2024-05-30 14:12:44] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 2 ms to minimize.
[2024-05-30 14:12:44] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-05-30 14:12:44] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2024-05-30 14:12:44] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 3 ms to minimize.
[2024-05-30 14:12:44] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-30 14:12:44] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 2 ms to minimize.
[2024-05-30 14:12:45] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-30 14:12:45] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2024-05-30 14:12:45] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2024-05-30 14:12:45] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/798 variables, 20/885 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-30 14:12:48] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 3 ms to minimize.
[2024-05-30 14:12:48] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 3 ms to minimize.
[2024-05-30 14:12:48] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-30 14:12:48] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 2 ms to minimize.
[2024-05-30 14:12:48] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-30 14:12:49] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-30 14:12:49] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
[2024-05-30 14:12:50] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 3 ms to minimize.
[2024-05-30 14:12:50] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 2 ms to minimize.
[2024-05-30 14:12:51] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-05-30 14:12:51] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2024-05-30 14:12:51] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2024-05-30 14:12:51] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2024-05-30 14:12:51] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
[2024-05-30 14:12:51] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 3 ms to minimize.
[2024-05-30 14:12:51] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 2 ms to minimize.
[2024-05-30 14:12:51] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:12:52] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2024-05-30 14:12:52] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-30 14:12:52] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 20/905 constraints. Problems are: Problem set: 0 solved, 398 unsolved
[2024-05-30 14:12:55] [INFO ] Deduced a trap composed of 40 places in 87 ms of which 2 ms to minimize.
[2024-05-30 14:12:55] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 798/798 variables, and 907 constraints, problems are : Problem set: 0 solved, 398 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 41/41 constraints, State Equation: 399/399 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 69/69 constraints]
After SMT, in 54515ms problems are : Problem set: 0 solved, 398 unsolved
Search for dead transitions found 0 dead transitions in 54519ms
Starting structural reductions in LTL mode, iteration 1 : 399/433 places, 399/433 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54905 ms. Remains : 399/433 places, 399/433 transitions.
[2024-05-30 14:12:55] [INFO ] Flatten gal took : 10 ms
[2024-05-30 14:12:55] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:12:55] [INFO ] Input system was already deterministic with 399 transitions.
[2024-05-30 14:12:55] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:12:55] [INFO ] Flatten gal took : 6 ms
[2024-05-30 14:12:55] [INFO ] Time to serialize gal into /tmp/CTLFireability12644376404431756177.gal : 1 ms
[2024-05-30 14:12:55] [INFO ] Time to serialize properties into /tmp/CTLFireability11693097681757332021.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/CTLFireability12644376404431756177.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11693097681757332021.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.18256e+36,20.9775,547364,2,10253,5,1.30336e+06,6,0,1997,4.33343e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-30 14:13:25] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:13:25] [INFO ] Applying decomposition
[2024-05-30 14:13:25] [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/graph86350353310236417.txt' '-o' '/tmp/graph86350353310236417.bin' '-w' '/tmp/graph86350353310236417.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph86350353310236417.bin' '-l' '-1' '-v' '-w' '/tmp/graph86350353310236417.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:13:25] [INFO ] Decomposing Gal with order
[2024-05-30 14:13:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:13:25] [INFO ] Removed a total of 96 redundant transitions.
[2024-05-30 14:13:25] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:13:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 14:13:25] [INFO ] Time to serialize gal into /tmp/CTLFireability12454915469566698547.gal : 3 ms
[2024-05-30 14:13:25] [INFO ] Time to serialize properties into /tmp/CTLFireability6206783502308283852.ctl : 11 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/CTLFireability12454915469566698547.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6206783502308283852.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.18256e+36,1.50317,46000,827,38,72270,964,666,173525,49,2341,0


Converting to forward existential form...Done !
original formula: (E(((!(AX((i18.u139.p432==1))) + (((i4.u76.p243==1)||(i19.i2.u149.p474==1))&&((i14.i1.u103.p331==1)||(i2.i1.u24.p76==1)))) + (((i10.i0.u5...323
=> equivalent forward existential formula: ([(Init * !(E(((!(!(EX(!((i18.u139.p432==1))))) + (((i4.u76.p243==1)||(i19.i2.u149.p474==1))&&((i14.i1.u103.p331...467
Reverse transition relation is NOT exact ! Due to transitions t360, t362, t364, t369, t371, t373, t375, t377, i0.i0.t169, i0.i0.u85.t173, i0.i1.t153, i0.i1...1462
Detected timeout of ITS tools.
[2024-05-30 14:13:55] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:13:55] [INFO ] Flatten gal took : 11 ms
[2024-05-30 14:13:55] [INFO ] Applying decomposition
[2024-05-30 14:13:55] [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/graph10026323725615207961.txt' '-o' '/tmp/graph10026323725615207961.bin' '-w' '/tmp/graph10026323725615207961.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10026323725615207961.bin' '-l' '-1' '-v' '-w' '/tmp/graph10026323725615207961.weights' '-q' '0' '-e' '0.001'
[2024-05-30 14:13:55] [INFO ] Decomposing Gal with order
[2024-05-30 14:13:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:13:55] [INFO ] Removed a total of 76 redundant transitions.
[2024-05-30 14:13:55] [INFO ] Flatten gal took : 14 ms
[2024-05-30 14:13:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 14:13:55] [INFO ] Time to serialize gal into /tmp/CTLFireability6000803423437805307.gal : 3 ms
[2024-05-30 14:13:55] [INFO ] Time to serialize properties into /tmp/CTLFireability7939505095627279895.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/CTLFireability6000803423437805307.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7939505095627279895.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 15 CTL formulae.
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.23178e+37,7.93558,175048,1825,27,270673,461,742,719251,45,1193,0


Converting to forward existential form...Done !
original formula: E(!(EX(AX(((i8.u54.p137==1)&&(i20.i1.u169.p475==1))))) U ((!((EG((i4.i3.u15.p46!=1)) * AF(((i2.i2.u69.p196==1)||(i8.u53.p140==1))))) + (i...482
=> equivalent forward existential formula: ((([(FwdU(Init,!(EX(!(EX(!(((i8.u54.p137==1)&&(i20.i1.u169.p475==1)))))))) * !(EG((i4.i3.u15.p46!=1))))] != FALS...1100
Reverse transition relation is NOT exact ! Due to transitions t23, t398, t407, t409, i0.i3.t52, i0.i3.t59, i0.i3.u155.t53, i0.i3.u155.t60, i0.i3.u157.t58, ...2005
Detected timeout of ITS tools.
[2024-05-30 14:42:43] [INFO ] Applying decomposition
[2024-05-30 14:42:43] [INFO ] Flatten gal took : 7 ms
[2024-05-30 14:42:43] [INFO ] Decomposing Gal with order
[2024-05-30 14:42:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-30 14:42:43] [INFO ] Removed a total of 16 redundant transitions.
[2024-05-30 14:42:43] [INFO ] Flatten gal took : 13 ms
[2024-05-30 14:42:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-30 14:42:43] [INFO ] Time to serialize gal into /tmp/CTLFireability11347670382055891081.gal : 5 ms
[2024-05-30 14:42:43] [INFO ] Time to serialize properties into /tmp/CTLFireability15070320747741322535.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11347670382055891081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15070320747741322535.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 15 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.23178e+37,22.7057,468012,1539,447,760607,1175,481,3.5966e+06,148,15844,0


Converting to forward existential form...Done !
original formula: E(!(EX(AX(((i0.i0.i0.i0.i0.i0.i0.i1.i0.u30.p137==1)&&(i1.i0.i0.u78.p475==1))))) U ((!((EG((i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u16.p46!=1)) ...731
=> equivalent forward existential formula: ((([(FwdU(Init,!(EX(!(EX(!(((i0.i0.i0.i0.i0.i0.i0.i1.i0.u30.p137==1)&&(i1.i0.i0.u78.p475==1)))))))) * !(EG((i0.i...1581
Reverse transition relation is NOT exact ! Due to transitions i0.i0.t409, i0.i0.i0.i0.t407, i0.i0.i0.i0.i0.t398, i0.i0.i0.i0.i0.i0.i0.i0.i0.u10.t390, i0.i0...4089

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="ShieldRVt-PT-010B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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