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.r180-tall-171640604300826.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 HealthRecord-PT-17, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604300826
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 20:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Apr 12 20:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 20:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 20:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 175K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716521503053

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 03:31:44] [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-24 03:31:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:31:44] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2024-05-24 03:31:44] [INFO ] Transformed 624 places.
[2024-05-24 03:31:44] [INFO ] Transformed 828 transitions.
[2024-05-24 03:31:44] [INFO ] Found NUPN structural information;
[2024-05-24 03:31:44] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 202 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 119 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 828/828 transitions.
Discarding 103 places :
Symmetric choice reduction at 0 with 103 rule applications. Total rules 103 place count 521 transition count 707
Iterating global reduction 0 with 103 rules applied. Total rules applied 206 place count 521 transition count 707
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 244 place count 483 transition count 663
Iterating global reduction 0 with 38 rules applied. Total rules applied 282 place count 483 transition count 663
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 288 place count 483 transition count 657
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 301 place count 470 transition count 638
Iterating global reduction 1 with 13 rules applied. Total rules applied 314 place count 470 transition count 638
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 317 place count 467 transition count 635
Iterating global reduction 1 with 3 rules applied. Total rules applied 320 place count 467 transition count 635
Applied a total of 320 rules in 123 ms. Remains 467 /624 variables (removed 157) and now considering 635/828 (removed 193) transitions.
// Phase 1: matrix 635 rows 467 cols
[2024-05-24 03:31:44] [INFO ] Computed 18 invariants in 25 ms
[2024-05-24 03:31:45] [INFO ] Implicit Places using invariants in 406 ms returned []
[2024-05-24 03:31:45] [INFO ] Invariant cache hit.
[2024-05-24 03:31:45] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Running 634 sub problems to find dead transitions.
[2024-05-24 03:31:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (OVERLAPS) 1/467 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-05-24 03:31:54] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 29 ms to minimize.
[2024-05-24 03:31:54] [INFO ] Deduced a trap composed of 173 places in 156 ms of which 4 ms to minimize.
[2024-05-24 03:31:55] [INFO ] Deduced a trap composed of 192 places in 147 ms of which 3 ms to minimize.
[2024-05-24 03:31:55] [INFO ] Deduced a trap composed of 220 places in 145 ms of which 3 ms to minimize.
[2024-05-24 03:31:55] [INFO ] Deduced a trap composed of 102 places in 183 ms of which 3 ms to minimize.
[2024-05-24 03:31:55] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 3 ms to minimize.
[2024-05-24 03:31:56] [INFO ] Deduced a trap composed of 94 places in 132 ms of which 3 ms to minimize.
[2024-05-24 03:31:56] [INFO ] Deduced a trap composed of 146 places in 136 ms of which 3 ms to minimize.
[2024-05-24 03:31:56] [INFO ] Deduced a trap composed of 129 places in 137 ms of which 3 ms to minimize.
[2024-05-24 03:31:56] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 3 ms to minimize.
[2024-05-24 03:31:56] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 3 ms to minimize.
[2024-05-24 03:31:56] [INFO ] Deduced a trap composed of 97 places in 165 ms of which 3 ms to minimize.
[2024-05-24 03:31:57] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 3 ms to minimize.
[2024-05-24 03:31:57] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 3 ms to minimize.
[2024-05-24 03:31:57] [INFO ] Deduced a trap composed of 131 places in 125 ms of which 3 ms to minimize.
[2024-05-24 03:31:57] [INFO ] Deduced a trap composed of 95 places in 127 ms of which 3 ms to minimize.
[2024-05-24 03:31:57] [INFO ] Deduced a trap composed of 97 places in 120 ms of which 2 ms to minimize.
[2024-05-24 03:31:57] [INFO ] Deduced a trap composed of 93 places in 120 ms of which 3 ms to minimize.
[2024-05-24 03:31:58] [INFO ] Deduced a trap composed of 134 places in 133 ms of which 3 ms to minimize.
[2024-05-24 03:31:58] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-05-24 03:32:03] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 3 ms to minimize.
[2024-05-24 03:32:03] [INFO ] Deduced a trap composed of 159 places in 114 ms of which 3 ms to minimize.
[2024-05-24 03:32:03] [INFO ] Deduced a trap composed of 81 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:32:04] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:32:04] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 3 ms to minimize.
[2024-05-24 03:32:04] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:32:05] [INFO ] Deduced a trap composed of 133 places in 137 ms of which 3 ms to minimize.
[2024-05-24 03:32:05] [INFO ] Deduced a trap composed of 160 places in 120 ms of which 2 ms to minimize.
[2024-05-24 03:32:05] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:32:06] [INFO ] Deduced a trap composed of 90 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:32:06] [INFO ] Deduced a trap composed of 86 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:32:06] [INFO ] Deduced a trap composed of 90 places in 111 ms of which 3 ms to minimize.
[2024-05-24 03:32:06] [INFO ] Deduced a trap composed of 100 places in 100 ms of which 3 ms to minimize.
[2024-05-24 03:32:07] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 3 ms to minimize.
[2024-05-24 03:32:07] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 6 ms to minimize.
[2024-05-24 03:32:07] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 2 ms to minimize.
[2024-05-24 03:32:07] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 3 ms to minimize.
[2024-05-24 03:32:08] [INFO ] Deduced a trap composed of 100 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:32:08] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:32:08] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-05-24 03:32:09] [INFO ] Deduced a trap composed of 93 places in 112 ms of which 2 ms to minimize.
[2024-05-24 03:32:12] [INFO ] Deduced a trap composed of 103 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:32:12] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:32:12] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:32:12] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 3 ms to minimize.
[2024-05-24 03:32:13] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 3 ms to minimize.
[2024-05-24 03:32:13] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:32:13] [INFO ] Deduced a trap composed of 100 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:32:14] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 1 ms to minimize.
[2024-05-24 03:32:14] [INFO ] Deduced a trap composed of 98 places in 83 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/1102 variables, and 68 constraints, problems are : Problem set: 0 solved, 634 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 634/634 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 634 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 1 (OVERLAPS) 1/467 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/467 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 634 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 50/68 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-05-24 03:32:20] [INFO ] Deduced a trap composed of 51 places in 151 ms of which 3 ms to minimize.
[2024-05-24 03:32:20] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:32:20] [INFO ] Deduced a trap composed of 95 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:32:20] [INFO ] Deduced a trap composed of 93 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:32:21] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:32:21] [INFO ] Deduced a trap composed of 97 places in 97 ms of which 7 ms to minimize.
[2024-05-24 03:32:21] [INFO ] Deduced a trap composed of 97 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:32:21] [INFO ] Deduced a trap composed of 94 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:32:21] [INFO ] Deduced a trap composed of 80 places in 117 ms of which 2 ms to minimize.
[2024-05-24 03:32:22] [INFO ] Deduced a trap composed of 109 places in 125 ms of which 2 ms to minimize.
[2024-05-24 03:32:22] [INFO ] Deduced a trap composed of 97 places in 116 ms of which 2 ms to minimize.
[2024-05-24 03:32:22] [INFO ] Deduced a trap composed of 128 places in 112 ms of which 2 ms to minimize.
[2024-05-24 03:32:22] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-24 03:32:22] [INFO ] Deduced a trap composed of 96 places in 116 ms of which 2 ms to minimize.
[2024-05-24 03:32:22] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 3 ms to minimize.
[2024-05-24 03:32:22] [INFO ] Deduced a trap composed of 125 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:32:22] [INFO ] Deduced a trap composed of 100 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:32:23] [INFO ] Deduced a trap composed of 99 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:32:23] [INFO ] Deduced a trap composed of 64 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:32:23] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-05-24 03:32:23] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-05-24 03:32:24] [INFO ] Deduced a trap composed of 73 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:32:24] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:32:24] [INFO ] Deduced a trap composed of 103 places in 100 ms of which 3 ms to minimize.
[2024-05-24 03:32:24] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:32:24] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 2 ms to minimize.
[2024-05-24 03:32:24] [INFO ] Deduced a trap composed of 85 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:32:24] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-05-24 03:32:25] [INFO ] Deduced a trap composed of 66 places in 123 ms of which 3 ms to minimize.
[2024-05-24 03:32:25] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:32:25] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:32:25] [INFO ] Deduced a trap composed of 62 places in 108 ms of which 3 ms to minimize.
[2024-05-24 03:32:25] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 2 ms to minimize.
[2024-05-24 03:32:25] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 2 ms to minimize.
[2024-05-24 03:32:26] [INFO ] Deduced a trap composed of 102 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:32:26] [INFO ] Deduced a trap composed of 100 places in 91 ms of which 3 ms to minimize.
[2024-05-24 03:32:26] [INFO ] Deduced a trap composed of 96 places in 118 ms of which 3 ms to minimize.
[2024-05-24 03:32:26] [INFO ] Deduced a trap composed of 95 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:32:26] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:32:26] [INFO ] Deduced a trap composed of 96 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-05-24 03:32:27] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:32:27] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2024-05-24 03:32:27] [INFO ] Deduced a trap composed of 103 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:32:28] [INFO ] Deduced a trap composed of 94 places in 88 ms of which 1 ms to minimize.
[2024-05-24 03:32:28] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:32:28] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 3 ms to minimize.
[2024-05-24 03:32:28] [INFO ] Deduced a trap composed of 60 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:32:31] [INFO ] Deduced a trap composed of 123 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:32:32] [INFO ] Deduced a trap composed of 125 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:32:32] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:32:32] [INFO ] Deduced a trap composed of 98 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:32:34] [INFO ] Deduced a trap composed of 73 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 12/120 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-05-24 03:32:35] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:32:36] [INFO ] Deduced a trap composed of 232 places in 138 ms of which 3 ms to minimize.
[2024-05-24 03:32:36] [INFO ] Deduced a trap composed of 253 places in 124 ms of which 2 ms to minimize.
[2024-05-24 03:32:37] [INFO ] Deduced a trap composed of 104 places in 141 ms of which 3 ms to minimize.
[2024-05-24 03:32:37] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:32:39] [INFO ] Deduced a trap composed of 163 places in 91 ms of which 1 ms to minimize.
[2024-05-24 03:32:41] [INFO ] Deduced a trap composed of 95 places in 118 ms of which 2 ms to minimize.
[2024-05-24 03:32:42] [INFO ] Deduced a trap composed of 99 places in 111 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 8/128 constraints. Problems are: Problem set: 0 solved, 634 unsolved
[2024-05-24 03:32:43] [INFO ] Deduced a trap composed of 169 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:32:44] [INFO ] Deduced a trap composed of 136 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:32:44] [INFO ] Deduced a trap composed of 129 places in 101 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/1102 variables, and 131 constraints, problems are : Problem set: 0 solved, 634 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 0/634 constraints, Known Traps: 113/113 constraints]
After SMT, in 60256ms problems are : Problem set: 0 solved, 634 unsolved
Search for dead transitions found 0 dead transitions in 60277ms
Starting structural reductions in LTL mode, iteration 1 : 467/624 places, 635/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61151 ms. Remains : 467/624 places, 635/828 transitions.
Support contains 119 out of 467 places after structural reductions.
[2024-05-24 03:32:45] [INFO ] Flatten gal took : 63 ms
[2024-05-24 03:32:45] [INFO ] Flatten gal took : 30 ms
[2024-05-24 03:32:46] [INFO ] Input system was already deterministic with 635 transitions.
Support contains 118 out of 467 places (down from 119) after GAL structural reductions.
RANDOM walk for 40000 steps (351 resets) in 2384 ms. (16 steps per ms) remains 63/89 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 63/63 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 63/63 properties
[2024-05-24 03:32:47] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 1 (OVERLAPS) 107/198 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 60 unsolved
Problem AtomicPropp84 is UNSAT
At refinement iteration 3 (OVERLAPS) 269/467 variables, 8/18 constraints. Problems are: Problem set: 4 solved, 59 unsolved
[2024-05-24 03:32:48] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 3 ms to minimize.
[2024-05-24 03:32:48] [INFO ] Deduced a trap composed of 227 places in 144 ms of which 3 ms to minimize.
[2024-05-24 03:32:48] [INFO ] Deduced a trap composed of 97 places in 63 ms of which 2 ms to minimize.
[2024-05-24 03:32:48] [INFO ] Deduced a trap composed of 97 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:32:48] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:32:48] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 3 ms to minimize.
[2024-05-24 03:32:48] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:32:48] [INFO ] Deduced a trap composed of 62 places in 142 ms of which 3 ms to minimize.
[2024-05-24 03:32:49] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 3 ms to minimize.
[2024-05-24 03:32:49] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:32:49] [INFO ] Deduced a trap composed of 96 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:32:49] [INFO ] Deduced a trap composed of 119 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:32:49] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:32:49] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:32:49] [INFO ] Deduced a trap composed of 94 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:32:49] [INFO ] Deduced a trap composed of 97 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:32:49] [INFO ] Deduced a trap composed of 98 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:32:50] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:32:50] [INFO ] Deduced a trap composed of 95 places in 111 ms of which 2 ms to minimize.
[2024-05-24 03:32:50] [INFO ] Deduced a trap composed of 95 places in 66 ms of which 1 ms to minimize.
Problem AtomicPropp46 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 20/38 constraints. Problems are: Problem set: 5 solved, 58 unsolved
[2024-05-24 03:32:50] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:32:50] [INFO ] Deduced a trap composed of 115 places in 115 ms of which 2 ms to minimize.
[2024-05-24 03:32:51] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 3 ms to minimize.
[2024-05-24 03:32:51] [INFO ] Deduced a trap composed of 98 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:32:51] [INFO ] Deduced a trap composed of 95 places in 97 ms of which 3 ms to minimize.
[2024-05-24 03:32:51] [INFO ] Deduced a trap composed of 62 places in 147 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 6/44 constraints. Problems are: Problem set: 5 solved, 58 unsolved
[2024-05-24 03:32:51] [INFO ] Deduced a trap composed of 192 places in 141 ms of which 3 ms to minimize.
[2024-05-24 03:32:52] [INFO ] Deduced a trap composed of 100 places in 133 ms of which 3 ms to minimize.
SMT process timed out in 5068ms, After SMT, problems are : Problem set: 5 solved, 58 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 74 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 635/635 transitions.
Graph (trivial) has 410 edges and 467 vertex of which 56 / 467 are part of one of the 16 SCC in 5 ms
Free SCC test removed 40 places
Drop transitions (Empty/Sink Transition effects.) removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Graph (complete) has 973 edges and 427 vertex of which 419 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 133 place count 419 transition count 441
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 141 rules applied. Total rules applied 274 place count 288 transition count 431
Reduce places removed 5 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 15 rules applied. Total rules applied 289 place count 283 transition count 421
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 299 place count 273 transition count 421
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 299 place count 273 transition count 413
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 315 place count 265 transition count 413
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 325 place count 255 transition count 393
Iterating global reduction 4 with 10 rules applied. Total rules applied 335 place count 255 transition count 393
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 336 place count 255 transition count 392
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 337 place count 254 transition count 392
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 339 place count 252 transition count 388
Iterating global reduction 6 with 2 rules applied. Total rules applied 341 place count 252 transition count 388
Performed 54 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 6 with 108 rules applied. Total rules applied 449 place count 198 transition count 330
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 456 place count 198 transition count 323
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 460 place count 194 transition count 315
Iterating global reduction 7 with 4 rules applied. Total rules applied 464 place count 194 transition count 315
Performed 11 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 486 place count 183 transition count 364
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 490 place count 183 transition count 360
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 8 with 24 rules applied. Total rules applied 514 place count 183 transition count 336
Free-agglomeration rule applied 28 times.
Iterating global reduction 8 with 28 rules applied. Total rules applied 542 place count 183 transition count 308
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 8 with 28 rules applied. Total rules applied 570 place count 155 transition count 308
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 577 place count 155 transition count 301
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 578 place count 155 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 579 place count 154 transition count 302
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 582 place count 154 transition count 302
Applied a total of 582 rules in 153 ms. Remains 154 /467 variables (removed 313) and now considering 302/635 (removed 333) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 154/467 places, 302/635 transitions.
RANDOM walk for 40000 steps (2774 resets) in 800 ms. (49 steps per ms) remains 39/58 properties
BEST_FIRST walk for 4004 steps (49 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (47 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (49 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (49 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (52 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (48 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (49 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (47 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (45 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (43 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (45 resets) in 13 ms. (286 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (47 resets) in 28 ms. (138 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (52 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (49 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (50 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (49 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (49 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (44 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (49 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (51 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (51 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (47 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (53 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (45 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (50 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (47 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (49 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (46 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (48 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (49 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (43 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (51 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (51 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (52 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (47 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (52 resets) in 10 ms. (363 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (48 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (49 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
[2024-05-24 03:32:52] [INFO ] Flow matrix only has 295 transitions (discarded 7 similar events)
// Phase 1: matrix 295 rows 154 cols
[2024-05-24 03:32:52] [INFO ] Computed 11 invariants in 2 ms
[2024-05-24 03:32:52] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 49/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 55/154 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-24 03:32:53] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2024-05-24 03:32:53] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:32:53] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 295/449 variables, 154/168 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/449 variables, 15/183 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/449 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/449 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 183 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1286 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 154/154 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 49/99 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-05-24 03:32:54] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:32:54] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 3 ms to minimize.
[2024-05-24 03:32:54] [INFO ] Deduced a trap composed of 47 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:32:54] [INFO ] Deduced a trap composed of 37 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:32:54] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 0 ms to minimize.
Problem AtomicPropp30 is UNSAT
[2024-05-24 03:32:54] [INFO ] Deduced a trap composed of 33 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:32:54] [INFO ] Deduced a trap composed of 27 places in 34 ms of which 1 ms to minimize.
[2024-05-24 03:32:54] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:32:54] [INFO ] Deduced a trap composed of 49 places in 43 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 38 unsolved
[2024-05-24 03:32:54] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:32:54] [INFO ] Deduced a trap composed of 37 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:32:54] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 3/15 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 38 unsolved
Problem AtomicPropp77 is UNSAT
At refinement iteration 5 (OVERLAPS) 55/154 variables, 8/23 constraints. Problems are: Problem set: 2 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 3/26 constraints. Problems are: Problem set: 2 solved, 37 unsolved
[2024-05-24 03:32:55] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:32:55] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:32:55] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:32:55] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-05-24 03:32:55] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:32:55] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:32:55] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:32:55] [INFO ] Deduced a trap composed of 48 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:32:55] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:32:55] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:32:55] [INFO ] Deduced a trap composed of 49 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:32:55] [INFO ] Deduced a trap composed of 47 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:32:55] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:32:55] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:32:55] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:32:56] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 0 ms to minimize.
[2024-05-24 03:32:56] [INFO ] Deduced a trap composed of 52 places in 52 ms of which 0 ms to minimize.
[2024-05-24 03:32:56] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:32:56] [INFO ] Deduced a trap composed of 54 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:32:56] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 20/46 constraints. Problems are: Problem set: 2 solved, 37 unsolved
[2024-05-24 03:32:56] [INFO ] Deduced a trap composed of 40 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:32:56] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:32:56] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:32:56] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:32:56] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:32:56] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:32:56] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:32:56] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:32:56] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:32:56] [INFO ] Deduced a trap composed of 60 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:32:57] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:32:57] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:32:57] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 0 ms to minimize.
[2024-05-24 03:32:57] [INFO ] Deduced a trap composed of 37 places in 40 ms of which 0 ms to minimize.
[2024-05-24 03:32:57] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
[2024-05-24 03:32:57] [INFO ] Deduced a trap composed of 32 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:32:57] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:32:57] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 1 ms to minimize.
[2024-05-24 03:32:57] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:32:57] [INFO ] Deduced a trap composed of 25 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 20/66 constraints. Problems are: Problem set: 2 solved, 37 unsolved
[2024-05-24 03:32:57] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/154 variables, 1/67 constraints. Problems are: Problem set: 2 solved, 37 unsolved
[2024-05-24 03:32:57] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:32:58] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:32:58] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:32:58] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 0 ms to minimize.
[2024-05-24 03:32:58] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-05-24 03:32:58] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:32:58] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/154 variables, 7/74 constraints. Problems are: Problem set: 2 solved, 37 unsolved
[2024-05-24 03:32:58] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/154 variables, 1/75 constraints. Problems are: Problem set: 2 solved, 37 unsolved
[2024-05-24 03:32:58] [INFO ] Deduced a trap composed of 34 places in 42 ms of which 0 ms to minimize.
[2024-05-24 03:32:58] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:32:58] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:32:58] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/154 variables, 4/79 constraints. Problems are: Problem set: 2 solved, 37 unsolved
[2024-05-24 03:32:59] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:32:59] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/154 variables, 2/81 constraints. Problems are: Problem set: 2 solved, 37 unsolved
[2024-05-24 03:32:59] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:32:59] [INFO ] Deduced a trap composed of 49 places in 42 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/154 variables, 2/83 constraints. Problems are: Problem set: 2 solved, 37 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/154 variables, 0/83 constraints. Problems are: Problem set: 2 solved, 37 unsolved
At refinement iteration 16 (OVERLAPS) 295/449 variables, 154/237 constraints. Problems are: Problem set: 2 solved, 37 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/449 variables, 15/252 constraints. Problems are: Problem set: 2 solved, 37 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/449 variables, 37/289 constraints. Problems are: Problem set: 2 solved, 37 unsolved
[2024-05-24 03:33:00] [INFO ] Deduced a trap composed of 33 places in 44 ms of which 0 ms to minimize.
[2024-05-24 03:33:00] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:33:00] [INFO ] Deduced a trap composed of 27 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:33:00] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/449 variables, 4/293 constraints. Problems are: Problem set: 2 solved, 37 unsolved
[2024-05-24 03:33:01] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:33:01] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/449 variables, 2/295 constraints. Problems are: Problem set: 2 solved, 37 unsolved
[2024-05-24 03:33:01] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:33:01] [INFO ] Deduced a trap composed of 49 places in 59 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/449 variables, 2/297 constraints. Problems are: Problem set: 2 solved, 37 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/449 variables, 0/297 constraints. Problems are: Problem set: 2 solved, 37 unsolved
At refinement iteration 23 (OVERLAPS) 0/449 variables, 0/297 constraints. Problems are: Problem set: 2 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 297 constraints, problems are : Problem set: 2 solved, 37 unsolved in 9506 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 154/154 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 37/39 constraints, Known Traps: 80/80 constraints]
After SMT, in 10815ms problems are : Problem set: 2 solved, 37 unsolved
Fused 37 Parikh solutions to 36 different solutions.
Parikh walk visited 14 properties in 1899 ms.
Support contains 29 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 302/302 transitions.
Graph (trivial) has 114 edges and 154 vertex of which 4 / 154 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 151 transition count 284
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 138 transition count 282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 137 transition count 282
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 30 place count 137 transition count 276
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 42 place count 131 transition count 276
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 58 place count 115 transition count 243
Iterating global reduction 3 with 16 rules applied. Total rules applied 74 place count 115 transition count 243
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 77 place count 112 transition count 234
Iterating global reduction 3 with 3 rules applied. Total rules applied 80 place count 112 transition count 234
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 84 place count 112 transition count 230
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 86 place count 110 transition count 228
Iterating global reduction 4 with 2 rules applied. Total rules applied 88 place count 110 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 110 transition count 226
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 100 place count 105 transition count 221
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 102 place count 103 transition count 214
Iterating global reduction 5 with 2 rules applied. Total rules applied 104 place count 103 transition count 214
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 118 place count 96 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 120 place count 96 transition count 237
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 121 place count 95 transition count 232
Iterating global reduction 6 with 1 rules applied. Total rules applied 122 place count 95 transition count 232
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 123 place count 94 transition count 230
Iterating global reduction 6 with 1 rules applied. Total rules applied 124 place count 94 transition count 230
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 6 with 17 rules applied. Total rules applied 141 place count 94 transition count 213
Free-agglomeration rule applied 10 times.
Iterating global reduction 6 with 10 rules applied. Total rules applied 151 place count 94 transition count 203
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 161 place count 84 transition count 203
Applied a total of 161 rules in 44 ms. Remains 84 /154 variables (removed 70) and now considering 203/302 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 84/154 places, 203/302 transitions.
RANDOM walk for 40000 steps (5969 resets) in 898 ms. (44 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (87 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (81 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (86 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (80 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (84 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (86 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (92 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (89 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (92 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (88 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (83 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (85 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (85 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (82 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (90 resets) in 15 ms. (250 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (83 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (85 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (76 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (84 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (81 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (83 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (86 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (88 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
Finished probabilistic random walk after 212957 steps, run visited all 23 properties in 949 ms. (steps per millisecond=224 )
Probabilistic random walk after 212957 steps, saw 41911 distinct states, run finished after 952 ms. (steps per millisecond=223 ) properties seen :23
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-17-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:33:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-24 03:33:06] [INFO ] Flatten gal took : 24 ms
FORMULA HealthRecord-PT-17-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-24 03:33:06] [INFO ] Flatten gal took : 24 ms
[2024-05-24 03:33:07] [INFO ] Input system was already deterministic with 635 transitions.
Support contains 85 out of 467 places (down from 94) after GAL structural reductions.
Computed a total of 117 stabilizing places and 129 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 467/467 places, 635/635 transitions.
Graph (trivial) has 542 edges and 467 vertex of which 72 / 467 are part of one of the 21 SCC in 1 ms
Free SCC test removed 51 places
Ensure Unique test removed 58 transitions
Reduce isomorphic transitions removed 58 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 170 place count 415 transition count 407
Reduce places removed 169 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 184 rules applied. Total rules applied 354 place count 246 transition count 392
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 363 place count 239 transition count 390
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 365 place count 237 transition count 390
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 365 place count 237 transition count 383
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 379 place count 230 transition count 383
Discarding 47 places :
Symmetric choice reduction at 4 with 47 rule applications. Total rules 426 place count 183 transition count 293
Iterating global reduction 4 with 47 rules applied. Total rules applied 473 place count 183 transition count 293
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 5 rules applied. Total rules applied 478 place count 183 transition count 288
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 483 place count 178 transition count 288
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 495 place count 166 transition count 266
Iterating global reduction 6 with 12 rules applied. Total rules applied 507 place count 166 transition count 266
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 508 place count 166 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 509 place count 165 transition count 265
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 516 place count 158 transition count 255
Iterating global reduction 8 with 7 rules applied. Total rules applied 523 place count 158 transition count 255
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 525 place count 158 transition count 253
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 530 place count 153 transition count 246
Iterating global reduction 9 with 5 rules applied. Total rules applied 535 place count 153 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 538 place count 153 transition count 243
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 539 place count 152 transition count 241
Iterating global reduction 10 with 1 rules applied. Total rules applied 540 place count 152 transition count 241
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 541 place count 151 transition count 239
Iterating global reduction 10 with 1 rules applied. Total rules applied 542 place count 151 transition count 239
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 545 place count 151 transition count 236
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 11 with 40 rules applied. Total rules applied 585 place count 131 transition count 216
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 11 with 8 rules applied. Total rules applied 593 place count 131 transition count 208
Discarding 12 places :
Symmetric choice reduction at 12 with 12 rule applications. Total rules 605 place count 119 transition count 184
Iterating global reduction 12 with 12 rules applied. Total rules applied 617 place count 119 transition count 184
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 623 place count 113 transition count 177
Iterating global reduction 12 with 6 rules applied. Total rules applied 629 place count 113 transition count 177
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 635 place count 107 transition count 169
Iterating global reduction 12 with 6 rules applied. Total rules applied 641 place count 107 transition count 169
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 644 place count 107 transition count 166
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 646 place count 105 transition count 162
Iterating global reduction 13 with 2 rules applied. Total rules applied 648 place count 105 transition count 162
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 649 place count 104 transition count 160
Iterating global reduction 13 with 1 rules applied. Total rules applied 650 place count 104 transition count 160
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 653 place count 104 transition count 157
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 14 with 4 rules applied. Total rules applied 657 place count 104 transition count 153
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 14 with 1 rules applied. Total rules applied 658 place count 104 transition count 152
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 15 with 2 rules applied. Total rules applied 660 place count 103 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 661 place count 102 transition count 151
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 662 place count 101 transition count 149
Iterating global reduction 17 with 1 rules applied. Total rules applied 663 place count 101 transition count 149
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 664 place count 100 transition count 147
Iterating global reduction 17 with 1 rules applied. Total rules applied 665 place count 100 transition count 147
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 17 with 2 rules applied. Total rules applied 667 place count 99 transition count 146
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 668 place count 98 transition count 145
Iterating global reduction 17 with 1 rules applied. Total rules applied 669 place count 98 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 670 place count 98 transition count 144
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 670 place count 98 transition count 143
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 672 place count 97 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 673 place count 96 transition count 142
Applied a total of 673 rules in 96 ms. Remains 96 /467 variables (removed 371) and now considering 142/635 (removed 493) transitions.
[2024-05-24 03:33:07] [INFO ] Flow matrix only has 132 transitions (discarded 10 similar events)
// Phase 1: matrix 132 rows 96 cols
[2024-05-24 03:33:07] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:33:07] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-24 03:33:07] [INFO ] Flow matrix only has 132 transitions (discarded 10 similar events)
[2024-05-24 03:33:07] [INFO ] Invariant cache hit.
[2024-05-24 03:33:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:33:07] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-24 03:33:07] [INFO ] Redundant transitions in 3 ms returned []
Running 127 sub problems to find dead transitions.
[2024-05-24 03:33:07] [INFO ] Flow matrix only has 132 transitions (discarded 10 similar events)
[2024-05-24 03:33:07] [INFO ] Invariant cache hit.
[2024-05-24 03:33:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 8/96 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-24 03:33:07] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-24 03:33:07] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:33:07] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:33:07] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:33:08] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 131/227 variables, 96/110 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 1/228 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/228 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/228 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 111 constraints, problems are : Problem set: 0 solved, 127 unsolved in 3931 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 8/96 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 127 unsolved
[2024-05-24 03:33:11] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:33:11] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 131/227 variables, 96/112 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/227 variables, 127/239 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/227 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 1/228 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/228 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 11 (OVERLAPS) 0/228 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 240 constraints, problems are : Problem set: 0 solved, 127 unsolved in 4593 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 96/96 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 7/7 constraints]
After SMT, in 8552ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 8555ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/467 places, 142/635 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8801 ms. Remains : 96/467 places, 142/635 transitions.
[2024-05-24 03:33:15] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:33:15] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:33:15] [INFO ] Input system was already deterministic with 142 transitions.
[2024-05-24 03:33:15] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:33:15] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:33:15] [INFO ] Time to serialize gal into /tmp/CTLFireability17800309633322020790.gal : 3 ms
[2024-05-24 03:33:15] [INFO ] Time to serialize properties into /tmp/CTLFireability5361386911651701901.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/CTLFireability17800309633322020790.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5361386911651701901.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.52076e+09,1.28075,44888,2,9046,5,177084,6,0,513,149765,0


Converting to forward existential form...Done !
original formula: EF((E((p445==1) U (p113==1)) + (((p498==0) * EF((p484==1))) * (EG((p375==0)) + EF((p347==0))))))
=> equivalent forward existential formula: ([(FwdU(FwdU(Init,TRUE),(p445==1)) * (p113==1))] != FALSE + ([FwdG((FwdU(Init,TRUE) * ((p498==0) * E(TRUE U (p48...278
Hit Full ! (commute/partial/dont) 139/0/3
(forward)formula 0,1,1.45988,44888,1,0,8,177084,15,1,915,149765,4
FORMULA HealthRecord-PT-17-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 467/467 places, 635/635 transitions.
Graph (trivial) has 518 edges and 467 vertex of which 59 / 467 are part of one of the 19 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 162 rules applied. Total rules applied 163 place count 426 transition count 427
Reduce places removed 162 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 177 rules applied. Total rules applied 340 place count 264 transition count 412
Reduce places removed 7 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 14 rules applied. Total rules applied 354 place count 257 transition count 405
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 361 place count 250 transition count 405
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 361 place count 250 transition count 399
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 373 place count 244 transition count 399
Discarding 49 places :
Symmetric choice reduction at 4 with 49 rule applications. Total rules 422 place count 195 transition count 312
Iterating global reduction 4 with 49 rules applied. Total rules applied 471 place count 195 transition count 312
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 474 place count 195 transition count 309
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 477 place count 192 transition count 309
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 489 place count 180 transition count 286
Iterating global reduction 6 with 12 rules applied. Total rules applied 501 place count 180 transition count 286
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 504 place count 177 transition count 281
Iterating global reduction 6 with 3 rules applied. Total rules applied 507 place count 177 transition count 281
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 510 place count 174 transition count 277
Iterating global reduction 6 with 3 rules applied. Total rules applied 513 place count 174 transition count 277
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 514 place count 174 transition count 276
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 515 place count 173 transition count 274
Iterating global reduction 7 with 1 rules applied. Total rules applied 516 place count 173 transition count 274
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 558 place count 152 transition count 253
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 566 place count 152 transition count 245
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 580 place count 138 transition count 217
Iterating global reduction 8 with 14 rules applied. Total rules applied 594 place count 138 transition count 217
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 600 place count 132 transition count 208
Iterating global reduction 8 with 6 rules applied. Total rules applied 606 place count 132 transition count 208
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 609 place count 132 transition count 205
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 614 place count 127 transition count 199
Iterating global reduction 9 with 5 rules applied. Total rules applied 619 place count 127 transition count 199
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 621 place count 127 transition count 197
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 624 place count 124 transition count 191
Iterating global reduction 10 with 3 rules applied. Total rules applied 627 place count 124 transition count 191
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 628 place count 124 transition count 190
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 629 place count 123 transition count 188
Iterating global reduction 11 with 1 rules applied. Total rules applied 630 place count 123 transition count 188
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 631 place count 122 transition count 186
Iterating global reduction 11 with 1 rules applied. Total rules applied 632 place count 122 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 635 place count 122 transition count 183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 11 with 2 rules applied. Total rules applied 637 place count 122 transition count 181
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 639 place count 120 transition count 181
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 13 with 2 rules applied. Total rules applied 641 place count 119 transition count 180
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 642 place count 118 transition count 179
Iterating global reduction 13 with 1 rules applied. Total rules applied 643 place count 118 transition count 179
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 644 place count 118 transition count 178
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 644 place count 118 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 646 place count 117 transition count 177
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 649 place count 117 transition count 177
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 650 place count 116 transition count 176
Iterating global reduction 13 with 1 rules applied. Total rules applied 651 place count 116 transition count 176
Applied a total of 651 rules in 82 ms. Remains 116 /467 variables (removed 351) and now considering 176/635 (removed 459) transitions.
[2024-05-24 03:33:17] [INFO ] Flow matrix only has 168 transitions (discarded 8 similar events)
// Phase 1: matrix 168 rows 116 cols
[2024-05-24 03:33:17] [INFO ] Computed 9 invariants in 8 ms
[2024-05-24 03:33:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-24 03:33:17] [INFO ] Flow matrix only has 168 transitions (discarded 8 similar events)
[2024-05-24 03:33:17] [INFO ] Invariant cache hit.
[2024-05-24 03:33:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:33:17] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-24 03:33:17] [INFO ] Redundant transitions in 5 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-24 03:33:17] [INFO ] Flow matrix only has 168 transitions (discarded 8 similar events)
[2024-05-24 03:33:17] [INFO ] Invariant cache hit.
[2024-05-24 03:33:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 03:33:18] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 0 ms to minimize.
[2024-05-24 03:33:18] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2024-05-24 03:33:18] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-05-24 03:33:18] [INFO ] Deduced a trap composed of 32 places in 46 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (OVERLAPS) 167/283 variables, 116/129 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 1/284 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/284 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 130 constraints, problems are : Problem set: 0 solved, 174 unsolved in 4974 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/115 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (OVERLAPS) 1/116 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 03:33:23] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-24 03:33:23] [INFO ] Deduced a trap composed of 27 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:33:24] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:33:24] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (OVERLAPS) 167/283 variables, 116/133 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 174/307 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 9 (OVERLAPS) 1/284 variables, 1/308 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 11 (OVERLAPS) 0/284 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 308 constraints, problems are : Problem set: 0 solved, 174 unsolved in 9414 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 116/116 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 8/8 constraints]
After SMT, in 14425ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 14427ms
Starting structural reductions in SI_CTL mode, iteration 1 : 116/467 places, 176/635 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14667 ms. Remains : 116/467 places, 176/635 transitions.
[2024-05-24 03:33:32] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:33:32] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:33:32] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-24 03:33:32] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:33:32] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:33:32] [INFO ] Time to serialize gal into /tmp/CTLFireability8332017573138438500.gal : 3 ms
[2024-05-24 03:33:32] [INFO ] Time to serialize properties into /tmp/CTLFireability3198354816791712302.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/CTLFireability8332017573138438500.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3198354816791712302.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.88677e+09,0.949583,34200,2,3736,5,115936,6,0,631,142975,0


Converting to forward existential form...Done !
original formula: AF(((A(((E(((p327==1)&&(p617==1)) U (p334==1)) * (p170!=1)) * (p180!=1)) U (AF((p551==1)) + (p489==1))) + EG(AF((p35==1)))) + AG((A((p360...250
=> equivalent forward existential formula: [FwdG(Init,!(((!((E(!((!(EG(!((p551==1)))) + (p489==1))) U (!(((E(((p327==1)&&(p617==1)) U (p334==1)) * (p170!=1...493
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t7, t9, t10, t12, t14, t15, t16, t20, t21, t22, t23, t24, t25, t26, t27, t29, t49...331
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2024-05-24 03:34:02] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:34:02] [INFO ] Applying decomposition
[2024-05-24 03:34:02] [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/graph2846693201236557206.txt' '-o' '/tmp/graph2846693201236557206.bin' '-w' '/tmp/graph2846693201236557206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2846693201236557206.bin' '-l' '-1' '-v' '-w' '/tmp/graph2846693201236557206.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:34:02] [INFO ] Decomposing Gal with order
[2024-05-24 03:34:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:34:02] [INFO ] Removed a total of 98 redundant transitions.
[2024-05-24 03:34:02] [INFO ] Flatten gal took : 40 ms
[2024-05-24 03:34:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 6 ms.
[2024-05-24 03:34:02] [INFO ] Time to serialize gal into /tmp/CTLFireability9112160863339896533.gal : 3 ms
[2024-05-24 03:34:02] [INFO ] Time to serialize properties into /tmp/CTLFireability1787783211452683004.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/CTLFireability9112160863339896533.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1787783211452683004.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,9.88677e+09,0.050293,5772,196,74,3337,630,428,7737,129,2195,0


Converting to forward existential form...Done !
original formula: AF(((A(((E(((i4.u10.p327==1)&&(i9.u31.p617==1)) U (i4.u11.p334==1)) * (i1.u3.p170!=1)) * (i1.u4.p180!=1)) U (AF((i9.u24.p551==1)) + (i8.u...352
=> equivalent forward existential formula: [FwdG(Init,!(((!((E(!((!(EG(!((i9.u24.p551==1)))) + (i8.u23.p489==1))) U (!(((E(((i4.u10.p327==1)&&(i9.u31.p617=...651
Reverse transition relation is NOT exact ! Due to transitions t3, t7, t101, t102, t103, t105, i0.u0.t87, i0.u0.t95, i1.t149, i1.u3.t83, i1.u3.t84, i5.t49, ...472
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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local 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 1
Fast SCC detection found a local 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
(forward)formula 0,0,1.35336,56724,1,0,109949,3995,2645,185015,714,19923,136743
FORMULA HealthRecord-PT-17-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 635/635 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 425 transition count 577
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 425 transition count 577
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 104 place count 405 transition count 543
Iterating global reduction 0 with 20 rules applied. Total rules applied 124 place count 405 transition count 543
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 125 place count 405 transition count 542
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 138 place count 392 transition count 519
Iterating global reduction 1 with 13 rules applied. Total rules applied 151 place count 392 transition count 519
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 158 place count 385 transition count 509
Iterating global reduction 1 with 7 rules applied. Total rules applied 165 place count 385 transition count 509
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 170 place count 380 transition count 501
Iterating global reduction 1 with 5 rules applied. Total rules applied 175 place count 380 transition count 501
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 180 place count 375 transition count 496
Iterating global reduction 1 with 5 rules applied. Total rules applied 185 place count 375 transition count 496
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 188 place count 372 transition count 493
Iterating global reduction 1 with 3 rules applied. Total rules applied 191 place count 372 transition count 493
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 193 place count 372 transition count 491
Applied a total of 193 rules in 41 ms. Remains 372 /467 variables (removed 95) and now considering 491/635 (removed 144) transitions.
// Phase 1: matrix 491 rows 372 cols
[2024-05-24 03:34:03] [INFO ] Computed 18 invariants in 7 ms
[2024-05-24 03:34:03] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-24 03:34:03] [INFO ] Invariant cache hit.
[2024-05-24 03:34:04] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 490 sub problems to find dead transitions.
[2024-05-24 03:34:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (OVERLAPS) 1/372 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-05-24 03:34:09] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 3 ms to minimize.
[2024-05-24 03:34:10] [INFO ] Deduced a trap composed of 136 places in 118 ms of which 2 ms to minimize.
[2024-05-24 03:34:10] [INFO ] Deduced a trap composed of 109 places in 120 ms of which 2 ms to minimize.
[2024-05-24 03:34:10] [INFO ] Deduced a trap composed of 94 places in 113 ms of which 3 ms to minimize.
[2024-05-24 03:34:10] [INFO ] Deduced a trap composed of 96 places in 123 ms of which 2 ms to minimize.
[2024-05-24 03:34:10] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 3 ms to minimize.
[2024-05-24 03:34:10] [INFO ] Deduced a trap composed of 197 places in 114 ms of which 2 ms to minimize.
[2024-05-24 03:34:11] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 3 ms to minimize.
[2024-05-24 03:34:11] [INFO ] Deduced a trap composed of 50 places in 109 ms of which 3 ms to minimize.
[2024-05-24 03:34:11] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:34:11] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:34:11] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 3 ms to minimize.
[2024-05-24 03:34:12] [INFO ] Deduced a trap composed of 68 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:34:12] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:34:12] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:34:12] [INFO ] Deduced a trap composed of 71 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:34:13] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:34:13] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 1 ms to minimize.
[2024-05-24 03:34:13] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:34:13] [INFO ] Deduced a trap composed of 74 places in 90 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-05-24 03:34:17] [INFO ] Deduced a trap composed of 71 places in 98 ms of which 3 ms to minimize.
[2024-05-24 03:34:17] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:34:17] [INFO ] Deduced a trap composed of 73 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:34:17] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 1 ms to minimize.
[2024-05-24 03:34:17] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:34:18] [INFO ] Deduced a trap composed of 140 places in 106 ms of which 2 ms to minimize.
[2024-05-24 03:34:18] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:34:18] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 3 ms to minimize.
[2024-05-24 03:34:19] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:34:19] [INFO ] Deduced a trap composed of 182 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:34:19] [INFO ] Deduced a trap composed of 141 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:34:19] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:34:19] [INFO ] Deduced a trap composed of 102 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:34:20] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:34:20] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:34:20] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 3 ms to minimize.
[2024-05-24 03:34:20] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:34:20] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:34:20] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:34:20] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-05-24 03:34:21] [INFO ] Deduced a trap composed of 141 places in 113 ms of which 2 ms to minimize.
[2024-05-24 03:34:21] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:34:21] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:34:21] [INFO ] Deduced a trap composed of 160 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:34:22] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:34:22] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:34:22] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:34:22] [INFO ] Deduced a trap composed of 74 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:34:22] [INFO ] Deduced a trap composed of 49 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:34:22] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:34:23] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:34:23] [INFO ] Deduced a trap composed of 57 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:34:23] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 3 ms to minimize.
[2024-05-24 03:34:23] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:34:23] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:34:23] [INFO ] Deduced a trap composed of 66 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:34:24] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:34:25] [INFO ] Deduced a trap composed of 132 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:34:25] [INFO ] Deduced a trap composed of 118 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:34:25] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-05-24 03:34:26] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 1 ms to minimize.
[2024-05-24 03:34:26] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:34:26] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:34:27] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:34:27] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:34:28] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 1 ms to minimize.
[2024-05-24 03:34:28] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:34:28] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:34:28] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:34:29] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:34:29] [INFO ] Deduced a trap composed of 72 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:34:29] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:34:29] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:34:30] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/372 variables, 14/92 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 372/863 variables, and 92 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/372 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 74/74 constraints]
Escalating to Integer solving :Problem set: 0 solved, 490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/371 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 1 (OVERLAPS) 1/372 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/372 variables, 74/92 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-05-24 03:34:39] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:34:40] [INFO ] Deduced a trap composed of 101 places in 102 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/372 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/372 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 6 (OVERLAPS) 491/863 variables, 372/466 constraints. Problems are: Problem set: 0 solved, 490 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/863 variables, 490/956 constraints. Problems are: Problem set: 0 solved, 490 unsolved
[2024-05-24 03:34:50] [INFO ] Deduced a trap composed of 217 places in 123 ms of which 3 ms to minimize.
[2024-05-24 03:34:55] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/863 variables, 2/958 constraints. Problems are: Problem set: 0 solved, 490 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 863/863 variables, and 958 constraints, problems are : Problem set: 0 solved, 490 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 372/372 constraints, PredecessorRefiner: 490/490 constraints, Known Traps: 78/78 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 490 unsolved
Search for dead transitions found 0 dead transitions in 60130ms
Starting structural reductions in LTL mode, iteration 1 : 372/467 places, 491/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60495 ms. Remains : 372/467 places, 491/635 transitions.
[2024-05-24 03:35:04] [INFO ] Flatten gal took : 17 ms
[2024-05-24 03:35:04] [INFO ] Flatten gal took : 14 ms
[2024-05-24 03:35:04] [INFO ] Input system was already deterministic with 491 transitions.
[2024-05-24 03:35:04] [INFO ] Flatten gal took : 32 ms
[2024-05-24 03:35:04] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:35:04] [INFO ] Time to serialize gal into /tmp/CTLFireability3061560580896444450.gal : 3 ms
[2024-05-24 03:35:04] [INFO ] Time to serialize properties into /tmp/CTLFireability4369646018849029473.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/CTLFireability3061560580896444450.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4369646018849029473.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.55575e+14,12.7936,310152,2,24011,5,856350,6,0,1981,2.07585e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-24 03:35:34] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:35:34] [INFO ] Applying decomposition
[2024-05-24 03:35:34] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14858487319727110895.txt' '-o' '/tmp/graph14858487319727110895.bin' '-w' '/tmp/graph14858487319727110895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14858487319727110895.bin' '-l' '-1' '-v' '-w' '/tmp/graph14858487319727110895.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:35:34] [INFO ] Decomposing Gal with order
[2024-05-24 03:35:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:35:34] [INFO ] Removed a total of 188 redundant transitions.
[2024-05-24 03:35:34] [INFO ] Flatten gal took : 56 ms
[2024-05-24 03:35:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 25 ms.
[2024-05-24 03:35:34] [INFO ] Time to serialize gal into /tmp/CTLFireability12179482609455938578.gal : 6 ms
[2024-05-24 03:35:34] [INFO ] Time to serialize properties into /tmp/CTLFireability16078997246913196932.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/CTLFireability12179482609455938578.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16078997246913196932.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.55575e+14,7.74678,186428,3979,238,249131,4001,931,1.04583e+06,148,17078,0


Converting to forward existential form...Done !
original formula: E((((i23.u141.p563!=1) + EX((i20.i0.u112.p477==1))) + !((E((((i1.i1.u10.p77==1)&&(i23.u129.p617==1))||(i23.u140.p611==1)) U (i1.i0.u6.p59...445
=> equivalent forward existential formula: [((FwdU(Init,(((i23.u141.p563!=1) + EX((i20.i0.u112.p477==1))) + !((E((((i1.i1.u10.p77==1)&&(i23.u129.p617==1))|...578
Reverse transition relation is NOT exact ! Due to transitions t93, t308, t418, t419, t420, t421, t422, t434, t439, i1.i0.u6.t374, i1.i0.u6.t376, i1.i0.u6.t...1933
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
Fast SCC detection found an SCC at level 25
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 635/635 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 423 transition count 571
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 423 transition count 571
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 109 place count 402 transition count 535
Iterating global reduction 0 with 21 rules applied. Total rules applied 130 place count 402 transition count 535
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 131 place count 402 transition count 534
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 146 place count 387 transition count 509
Iterating global reduction 1 with 15 rules applied. Total rules applied 161 place count 387 transition count 509
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 171 place count 377 transition count 494
Iterating global reduction 1 with 10 rules applied. Total rules applied 181 place count 377 transition count 494
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 189 place count 369 transition count 480
Iterating global reduction 1 with 8 rules applied. Total rules applied 197 place count 369 transition count 480
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 205 place count 361 transition count 471
Iterating global reduction 1 with 8 rules applied. Total rules applied 213 place count 361 transition count 471
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 216 place count 361 transition count 468
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 219 place count 358 transition count 465
Iterating global reduction 2 with 3 rules applied. Total rules applied 222 place count 358 transition count 465
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 225 place count 358 transition count 462
Applied a total of 225 rules in 46 ms. Remains 358 /467 variables (removed 109) and now considering 462/635 (removed 173) transitions.
// Phase 1: matrix 462 rows 358 cols
[2024-05-24 03:36:04] [INFO ] Computed 18 invariants in 5 ms
[2024-05-24 03:36:04] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-24 03:36:04] [INFO ] Invariant cache hit.
[2024-05-24 03:36:05] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-05-24 03:36:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-05-24 03:36:10] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:36:10] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 3 ms to minimize.
[2024-05-24 03:36:10] [INFO ] Deduced a trap composed of 29 places in 102 ms of which 3 ms to minimize.
[2024-05-24 03:36:10] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:36:10] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:36:10] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:36:10] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:36:11] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:36:13] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:36:13] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:36:13] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:36:13] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:36:13] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:36:13] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:36:13] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:36:13] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 1 ms to minimize.
[2024-05-24 03:36:14] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:36:14] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:36:14] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:36:14] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-05-24 03:36:17] [INFO ] Deduced a trap composed of 47 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:36:18] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:36:18] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:36:18] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 1 ms to minimize.
[2024-05-24 03:36:18] [INFO ] Deduced a trap composed of 107 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:36:18] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:36:18] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:36:18] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:36:18] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:36:19] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 1 ms to minimize.
[2024-05-24 03:36:19] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:36:19] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:36:20] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:36:20] [INFO ] Deduced a trap composed of 68 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:36:20] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:36:20] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 3 ms to minimize.
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 85 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 73 places in 88 ms of which 1 ms to minimize.
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2024-05-24 03:36:24] [INFO ] Deduced a trap composed of 134 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:36:24] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:36:24] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 1 ms to minimize.
[2024-05-24 03:36:25] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:36:25] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:36:25] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-05-24 03:36:26] [INFO ] Deduced a trap composed of 85 places in 80 ms of which 1 ms to minimize.
[2024-05-24 03:36:28] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:36:29] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:36:29] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-05-24 03:36:33] [INFO ] Deduced a trap composed of 113 places in 116 ms of which 2 ms to minimize.
[2024-05-24 03:36:33] [INFO ] Deduced a trap composed of 192 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:36:34] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:36:34] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:36:34] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 358/820 variables, and 74 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/358 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 56/74 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-05-24 03:36:38] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 3 ms to minimize.
[2024-05-24 03:36:38] [INFO ] Deduced a trap composed of 135 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:36:40] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (OVERLAPS) 462/820 variables, 358/435 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/820 variables, 461/896 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-05-24 03:36:48] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:36:48] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/820 variables, 2/898 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-05-24 03:36:58] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:36:58] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:36:58] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:36:59] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 3 ms to minimize.
[2024-05-24 03:37:00] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:37:00] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:37:04] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/820 variables, and 905 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 68/68 constraints]
After SMT, in 60101ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60106ms
Starting structural reductions in LTL mode, iteration 1 : 358/467 places, 462/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60452 ms. Remains : 358/467 places, 462/635 transitions.
[2024-05-24 03:37:05] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:37:05] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:37:05] [INFO ] Input system was already deterministic with 462 transitions.
[2024-05-24 03:37:05] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:37:05] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:37:05] [INFO ] Time to serialize gal into /tmp/CTLFireability17350371499465159226.gal : 3 ms
[2024-05-24 03:37:05] [INFO ] Time to serialize properties into /tmp/CTLFireability4469579339416182307.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/CTLFireability17350371499465159226.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4469579339416182307.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.0541e+14,5.49942,147880,2,13120,5,444768,6,0,1896,880201,0


Converting to forward existential form...Done !
original formula: AX(AG(E(!(EG((p258==1))) U A((p293==1) U (p424!=1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(!(EG((p258==1))) U !((E(!((p424!=1)) U (!((p293==1)) * !((p424!=1)))) + EG(!((p424!=...173
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...879
Detected timeout of ITS tools.
[2024-05-24 03:37:35] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:37:35] [INFO ] Applying decomposition
[2024-05-24 03:37:35] [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/graph8383244410202246805.txt' '-o' '/tmp/graph8383244410202246805.bin' '-w' '/tmp/graph8383244410202246805.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8383244410202246805.bin' '-l' '-1' '-v' '-w' '/tmp/graph8383244410202246805.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:37:35] [INFO ] Decomposing Gal with order
[2024-05-24 03:37:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:37:35] [INFO ] Removed a total of 174 redundant transitions.
[2024-05-24 03:37:35] [INFO ] Flatten gal took : 26 ms
[2024-05-24 03:37:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 10 ms.
[2024-05-24 03:37:35] [INFO ] Time to serialize gal into /tmp/CTLFireability10705754178232106472.gal : 4 ms
[2024-05-24 03:37:35] [INFO ] Time to serialize properties into /tmp/CTLFireability4344012549615352125.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/CTLFireability10705754178232106472.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4344012549615352125.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.0541e+14,2.59828,70404,2249,157,111054,1339,899,288594,104,8332,0


Converting to forward existential form...Done !
original formula: AX(AG(E(!(EG((i7.i2.u39.p258==1))) U A((i10.i2.u53.p293==1) U (i18.i1.u100.p424!=1)))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(!(EG((i7.i2.u39.p258==1))) U !((E(!((i18.i1.u100.p424!=1)) U (!((i10.i2.u53.p293==1)...230
Reverse transition relation is NOT exact ! Due to transitions t85, t413, t418, i2.i0.t356, i2.i0.t358, i2.i0.t370, i2.i0.t372, i2.i0.t374, i2.i0.t383, i2.i...1809
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,0,8.13767,202668,1,0,390176,2838,7284,726139,570,13171,1028520
FORMULA HealthRecord-PT-17-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 467/467 places, 635/635 transitions.
Graph (trivial) has 550 edges and 467 vertex of which 78 / 467 are part of one of the 21 SCC in 3 ms
Free SCC test removed 57 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 173 place count 409 transition count 396
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 189 rules applied. Total rules applied 362 place count 237 transition count 379
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 370 place count 229 transition count 379
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 370 place count 229 transition count 372
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 222 transition count 372
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 434 place count 172 transition count 277
Iterating global reduction 3 with 50 rules applied. Total rules applied 484 place count 172 transition count 277
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 489 place count 172 transition count 272
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 494 place count 167 transition count 272
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 506 place count 155 transition count 250
Iterating global reduction 5 with 12 rules applied. Total rules applied 518 place count 155 transition count 250
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 519 place count 155 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 520 place count 154 transition count 249
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 526 place count 148 transition count 240
Iterating global reduction 7 with 6 rules applied. Total rules applied 532 place count 148 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 535 place count 148 transition count 237
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 539 place count 144 transition count 232
Iterating global reduction 8 with 4 rules applied. Total rules applied 543 place count 144 transition count 232
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 546 place count 144 transition count 229
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 9 with 40 rules applied. Total rules applied 586 place count 124 transition count 209
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 9 with 9 rules applied. Total rules applied 595 place count 124 transition count 200
Discarding 12 places :
Symmetric choice reduction at 10 with 12 rule applications. Total rules 607 place count 112 transition count 176
Iterating global reduction 10 with 12 rules applied. Total rules applied 619 place count 112 transition count 176
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 625 place count 106 transition count 169
Iterating global reduction 10 with 6 rules applied. Total rules applied 631 place count 106 transition count 169
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 637 place count 100 transition count 161
Iterating global reduction 10 with 6 rules applied. Total rules applied 643 place count 100 transition count 161
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 646 place count 100 transition count 158
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 648 place count 98 transition count 154
Iterating global reduction 11 with 2 rules applied. Total rules applied 650 place count 98 transition count 154
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 652 place count 96 transition count 150
Iterating global reduction 11 with 2 rules applied. Total rules applied 654 place count 96 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 657 place count 96 transition count 147
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 659 place count 96 transition count 145
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 1 rules applied. Total rules applied 660 place count 96 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 661 place count 95 transition count 144
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 662 place count 94 transition count 142
Iterating global reduction 14 with 1 rules applied. Total rules applied 663 place count 94 transition count 142
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 664 place count 93 transition count 140
Iterating global reduction 14 with 1 rules applied. Total rules applied 665 place count 93 transition count 140
Discarding 3 places :
Symmetric choice reduction at 14 with 3 rule applications. Total rules 668 place count 90 transition count 137
Iterating global reduction 14 with 3 rules applied. Total rules applied 671 place count 90 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 673 place count 90 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 674 place count 89 transition count 134
Applied a total of 674 rules in 70 ms. Remains 89 /467 variables (removed 378) and now considering 134/635 (removed 501) transitions.
[2024-05-24 03:37:43] [INFO ] Flow matrix only has 124 transitions (discarded 10 similar events)
// Phase 1: matrix 124 rows 89 cols
[2024-05-24 03:37:43] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:37:43] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-24 03:37:43] [INFO ] Flow matrix only has 124 transitions (discarded 10 similar events)
[2024-05-24 03:37:43] [INFO ] Invariant cache hit.
[2024-05-24 03:37:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:37:43] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-24 03:37:43] [INFO ] Redundant transitions in 3 ms returned []
Running 118 sub problems to find dead transitions.
[2024-05-24 03:37:43] [INFO ] Flow matrix only has 124 transitions (discarded 10 similar events)
[2024-05-24 03:37:43] [INFO ] Invariant cache hit.
[2024-05-24 03:37:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 8/89 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-24 03:37:44] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:37:44] [INFO ] Deduced a trap composed of 10 places in 18 ms of which 0 ms to minimize.
[2024-05-24 03:37:44] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 0 ms to minimize.
[2024-05-24 03:37:44] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 5 (OVERLAPS) 123/212 variables, 89/102 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 1/213 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-24 03:37:46] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 0/213 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 104 constraints, problems are : Problem set: 0 solved, 118 unsolved in 3608 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 89/89 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 118 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 2 (OVERLAPS) 8/89 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-24 03:37:48] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 118 unsolved
[2024-05-24 03:37:48] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 7 (OVERLAPS) 123/212 variables, 89/105 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 118/223 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 10 (OVERLAPS) 1/213 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/213 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 118 unsolved
At refinement iteration 12 (OVERLAPS) 0/213 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 118 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 224 constraints, problems are : Problem set: 0 solved, 118 unsolved in 4115 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 89/89 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 118/118 constraints, Known Traps: 7/7 constraints]
After SMT, in 7748ms problems are : Problem set: 0 solved, 118 unsolved
Search for dead transitions found 0 dead transitions in 7749ms
Starting structural reductions in SI_CTL mode, iteration 1 : 89/467 places, 134/635 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7963 ms. Remains : 89/467 places, 134/635 transitions.
[2024-05-24 03:37:51] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:37:51] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:37:51] [INFO ] Input system was already deterministic with 134 transitions.
[2024-05-24 03:37:51] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:37:51] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:37:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9560769630741324780.gal : 1 ms
[2024-05-24 03:37:51] [INFO ] Time to serialize properties into /tmp/CTLFireability3334958678537535672.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/CTLFireability9560769630741324780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3334958678537535672.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.01958e+09,0.040496,5316,2,416,5,8076,6,0,479,6685,0


Converting to forward existential form...Done !
original formula: EF(AG((EF(((p59==0)||(p163==0))) * EF(EG((p509==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((E(TRUE U ((p59==0)||(p163==0))) * E(TRUE U EG((p509==0))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t7, t8, t10, t12, t13, t17, t22, t73, t76, t78, t126, t128, t130, Intersecti...244
(forward)formula 0,1,1.24342,53908,1,0,386,266748,285,196,3100,303056,527
FORMULA HealthRecord-PT-17-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 635/635 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 432 transition count 584
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 432 transition count 584
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 89 place count 413 transition count 551
Iterating global reduction 0 with 19 rules applied. Total rules applied 108 place count 413 transition count 551
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 109 place count 413 transition count 550
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 122 place count 400 transition count 530
Iterating global reduction 1 with 13 rules applied. Total rules applied 135 place count 400 transition count 530
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 145 place count 390 transition count 515
Iterating global reduction 1 with 10 rules applied. Total rules applied 155 place count 390 transition count 515
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 163 place count 382 transition count 501
Iterating global reduction 1 with 8 rules applied. Total rules applied 171 place count 382 transition count 501
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 177 place count 376 transition count 495
Iterating global reduction 1 with 6 rules applied. Total rules applied 183 place count 376 transition count 495
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 186 place count 373 transition count 492
Iterating global reduction 1 with 3 rules applied. Total rules applied 189 place count 373 transition count 492
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 192 place count 373 transition count 489
Applied a total of 192 rules in 41 ms. Remains 373 /467 variables (removed 94) and now considering 489/635 (removed 146) transitions.
// Phase 1: matrix 489 rows 373 cols
[2024-05-24 03:37:52] [INFO ] Computed 18 invariants in 7 ms
[2024-05-24 03:37:53] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-24 03:37:53] [INFO ] Invariant cache hit.
[2024-05-24 03:37:53] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 488 sub problems to find dead transitions.
[2024-05-24 03:37:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:37:58] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 2 ms to minimize.
[2024-05-24 03:37:59] [INFO ] Deduced a trap composed of 140 places in 113 ms of which 2 ms to minimize.
[2024-05-24 03:37:59] [INFO ] Deduced a trap composed of 180 places in 117 ms of which 2 ms to minimize.
[2024-05-24 03:37:59] [INFO ] Deduced a trap composed of 117 places in 97 ms of which 3 ms to minimize.
[2024-05-24 03:37:59] [INFO ] Deduced a trap composed of 122 places in 104 ms of which 3 ms to minimize.
[2024-05-24 03:37:59] [INFO ] Deduced a trap composed of 89 places in 114 ms of which 2 ms to minimize.
[2024-05-24 03:37:59] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:37:59] [INFO ] Deduced a trap composed of 75 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:38:00] [INFO ] Deduced a trap composed of 69 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:38:00] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:38:00] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:38:00] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:38:00] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:38:00] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2024-05-24 03:38:01] [INFO ] Deduced a trap composed of 113 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:38:01] [INFO ] Deduced a trap composed of 74 places in 114 ms of which 3 ms to minimize.
[2024-05-24 03:38:01] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:38:01] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:38:01] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:38:01] [INFO ] Deduced a trap composed of 52 places in 97 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 173 places in 114 ms of which 2 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 3 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 195 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 2 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:38:06] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:38:06] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:38:07] [INFO ] Deduced a trap composed of 72 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:38:07] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:38:07] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:38:07] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:38:08] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:38:08] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:38:09] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:38:12] [INFO ] Deduced a trap composed of 77 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:38:12] [INFO ] Deduced a trap composed of 121 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:38:12] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:38:13] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:38:13] [INFO ] Deduced a trap composed of 68 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:38:13] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:38:13] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:38:13] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:38:13] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:38:14] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:38:14] [INFO ] Deduced a trap composed of 82 places in 87 ms of which 1 ms to minimize.
[2024-05-24 03:38:14] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:38:14] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:38:14] [INFO ] Deduced a trap composed of 67 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:38:15] [INFO ] Deduced a trap composed of 46 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 15/67 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:38:17] [INFO ] Deduced a trap composed of 178 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:38:18] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:38:18] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:38:19] [INFO ] Deduced a trap composed of 72 places in 98 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 488 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/862 variables, and 71 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/373 constraints, PredecessorRefiner: 488/488 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 488 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 53/71 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:38:26] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 2 ms to minimize.
[2024-05-24 03:38:26] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:38:26] [INFO ] Deduced a trap composed of 115 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:38:29] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 1 ms to minimize.
[2024-05-24 03:38:29] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 1 ms to minimize.
[2024-05-24 03:38:29] [INFO ] Deduced a trap composed of 73 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:38:31] [INFO ] Deduced a trap composed of 175 places in 114 ms of which 2 ms to minimize.
[2024-05-24 03:38:32] [INFO ] Deduced a trap composed of 84 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:38:32] [INFO ] Deduced a trap composed of 71 places in 81 ms of which 1 ms to minimize.
[2024-05-24 03:38:32] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:38:32] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:38:32] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:38:32] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:38:33] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:38:34] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:38:34] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 10/87 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:38:37] [INFO ] Deduced a trap composed of 89 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:38:38] [INFO ] Deduced a trap composed of 69 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:38:38] [INFO ] Deduced a trap composed of 174 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:38:39] [INFO ] Deduced a trap composed of 170 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:38:39] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:38:39] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:38:39] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:38:39] [INFO ] Deduced a trap composed of 73 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 8/95 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:38:44] [INFO ] Deduced a trap composed of 199 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:38:44] [INFO ] Deduced a trap composed of 176 places in 103 ms of which 3 ms to minimize.
[2024-05-24 03:38:44] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:38:44] [INFO ] Deduced a trap composed of 95 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:38:44] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:38:49] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:38:51] [INFO ] Deduced a trap composed of 193 places in 100 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 373/862 variables, and 102 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/373 constraints, PredecessorRefiner: 0/488 constraints, Known Traps: 84/84 constraints]
After SMT, in 60103ms problems are : Problem set: 0 solved, 488 unsolved
Search for dead transitions found 0 dead transitions in 60109ms
Starting structural reductions in LTL mode, iteration 1 : 373/467 places, 489/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60467 ms. Remains : 373/467 places, 489/635 transitions.
[2024-05-24 03:38:53] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:38:53] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:38:53] [INFO ] Input system was already deterministic with 489 transitions.
[2024-05-24 03:38:53] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:38:53] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:38:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12437548812420222974.gal : 2 ms
[2024-05-24 03:38:53] [INFO ] Time to serialize properties into /tmp/CTLFireability8960300002849856877.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/CTLFireability12437548812420222974.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8960300002849856877.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.54642e+14,21.6524,472028,2,33908,5,1.40738e+06,6,0,1983,3.09022e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-24 03:39:23] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:39:23] [INFO ] Applying decomposition
[2024-05-24 03:39:23] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8914315007701363933.txt' '-o' '/tmp/graph8914315007701363933.bin' '-w' '/tmp/graph8914315007701363933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8914315007701363933.bin' '-l' '-1' '-v' '-w' '/tmp/graph8914315007701363933.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:39:23] [INFO ] Decomposing Gal with order
[2024-05-24 03:39:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:39:23] [INFO ] Removed a total of 151 redundant transitions.
[2024-05-24 03:39:23] [INFO ] Flatten gal took : 19 ms
[2024-05-24 03:39:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 6 ms.
[2024-05-24 03:39:23] [INFO ] Time to serialize gal into /tmp/CTLFireability13873949754231818878.gal : 4 ms
[2024-05-24 03:39:23] [INFO ] Time to serialize properties into /tmp/CTLFireability13910107279278447538.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/CTLFireability13873949754231818878.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13910107279278447538.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.54642e+14,5.78602,140712,2746,548,204730,4238,906,604136,208,40228,0


Converting to forward existential form...Done !
original formula: (((AX(!(E(AF((i22.u129.p555==1)) U ((u48.p278==1)||(i0.i0.u3.p7==1))))) + EG((i21.u127.p590==1))) + (E((E((i4.i0.u33.p239==1) U (i3.i0.u2...383
=> equivalent forward existential formula: ([(FwdU(EY(((Init * !((E((E((i4.i0.u33.p239==1) U (i3.i0.u28.p156==1)) * (i4.i0.u33.p252==1)) U (E((i6.i0.u46.p3...486
Reverse transition relation is NOT exact ! Due to transitions t93, t418, t419, t420, t421, t422, t434, t439, u48.t265, i0.i1.t414, i2.i1.t373, i2.i1.t375, ...2095
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 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
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,1,24.4801,602976,1,0,989958,66461,6840,2.37186e+06,1080,385645,1793592
FORMULA HealthRecord-PT-17-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 635/635 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 422 transition count 570
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 422 transition count 570
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 111 place count 401 transition count 534
Iterating global reduction 0 with 21 rules applied. Total rules applied 132 place count 401 transition count 534
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 133 place count 401 transition count 533
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 148 place count 386 transition count 508
Iterating global reduction 1 with 15 rules applied. Total rules applied 163 place count 386 transition count 508
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 173 place count 376 transition count 493
Iterating global reduction 1 with 10 rules applied. Total rules applied 183 place count 376 transition count 493
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 191 place count 368 transition count 479
Iterating global reduction 1 with 8 rules applied. Total rules applied 199 place count 368 transition count 479
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 207 place count 360 transition count 470
Iterating global reduction 1 with 8 rules applied. Total rules applied 215 place count 360 transition count 470
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 218 place count 360 transition count 467
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 221 place count 357 transition count 464
Iterating global reduction 2 with 3 rules applied. Total rules applied 224 place count 357 transition count 464
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 227 place count 357 transition count 461
Applied a total of 227 rules in 41 ms. Remains 357 /467 variables (removed 110) and now considering 461/635 (removed 174) transitions.
// Phase 1: matrix 461 rows 357 cols
[2024-05-24 03:39:48] [INFO ] Computed 18 invariants in 5 ms
[2024-05-24 03:39:48] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-24 03:39:48] [INFO ] Invariant cache hit.
[2024-05-24 03:39:48] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-24 03:39:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:39:53] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-05-24 03:39:53] [INFO ] Deduced a trap composed of 176 places in 111 ms of which 3 ms to minimize.
[2024-05-24 03:39:54] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2024-05-24 03:39:54] [INFO ] Deduced a trap composed of 200 places in 105 ms of which 3 ms to minimize.
[2024-05-24 03:39:54] [INFO ] Deduced a trap composed of 192 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:39:54] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:39:54] [INFO ] Deduced a trap composed of 70 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:39:55] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:39:55] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:39:55] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:39:55] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:39:56] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:39:56] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:39:56] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:39:57] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:39:57] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:39:57] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:39:57] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:39:57] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:39:57] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:40:00] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 3 ms to minimize.
[2024-05-24 03:40:00] [INFO ] Deduced a trap composed of 126 places in 91 ms of which 1 ms to minimize.
[2024-05-24 03:40:00] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:40:01] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:40:01] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:40:01] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:40:02] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:40:02] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:40:02] [INFO ] Deduced a trap composed of 85 places in 106 ms of which 2 ms to minimize.
[2024-05-24 03:40:02] [INFO ] Deduced a trap composed of 212 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:40:03] [INFO ] Deduced a trap composed of 84 places in 86 ms of which 1 ms to minimize.
[2024-05-24 03:40:03] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:40:03] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:40:04] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:40:04] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:40:04] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 16/54 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:40:05] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:40:05] [INFO ] Deduced a trap composed of 40 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:40:05] [INFO ] Deduced a trap composed of 85 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:40:07] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:40:07] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:40:08] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 6/60 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:40:09] [INFO ] Deduced a trap composed of 113 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:40:16] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:40:16] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 1 ms to minimize.
[2024-05-24 03:40:16] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:40:17] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:40:17] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:40:18] [INFO ] Deduced a trap composed of 70 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 Real declared 357/818 variables, and 67 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/357 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/357 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:40:21] [INFO ] Deduced a trap composed of 134 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:40:21] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:40:22] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:40:24] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:40:25] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:40:26] [INFO ] Deduced a trap composed of 61 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:40:30] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:40:33] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 8 (OVERLAPS) 461/818 variables, 357/432 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/818 variables, 460/892 constraints. Problems are: Problem set: 0 solved, 460 unsolved
[2024-05-24 03:40:40] [INFO ] Deduced a trap composed of 73 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:40:40] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 1 ms to minimize.
[2024-05-24 03:40:44] [INFO ] Deduced a trap composed of 71 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:40:44] [INFO ] Deduced a trap composed of 66 places in 80 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/818 variables, 4/896 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/818 variables, and 896 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 61/61 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 357/467 places, 461/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60468 ms. Remains : 357/467 places, 461/635 transitions.
[2024-05-24 03:40:48] [INFO ] Flatten gal took : 14 ms
[2024-05-24 03:40:48] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:40:48] [INFO ] Input system was already deterministic with 461 transitions.
[2024-05-24 03:40:48] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:40:48] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:40:48] [INFO ] Time to serialize gal into /tmp/CTLFireability10109630550825646843.gal : 2 ms
[2024-05-24 03:40:48] [INFO ] Time to serialize properties into /tmp/CTLFireability10863126788987794210.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/CTLFireability10109630550825646843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10863126788987794210.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.02798e+14,5.15723,144516,2,13045,5,443079,6,0,1891,876332,0


Converting to forward existential form...Done !
original formula: EF(EG(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...885
Detected timeout of ITS tools.
[2024-05-24 03:41:18] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:41:18] [INFO ] Applying decomposition
[2024-05-24 03:41:18] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph7593401641094744674.txt' '-o' '/tmp/graph7593401641094744674.bin' '-w' '/tmp/graph7593401641094744674.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7593401641094744674.bin' '-l' '-1' '-v' '-w' '/tmp/graph7593401641094744674.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:41:18] [INFO ] Decomposing Gal with order
[2024-05-24 03:41:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:41:18] [INFO ] Removed a total of 178 redundant transitions.
[2024-05-24 03:41:18] [INFO ] Flatten gal took : 19 ms
[2024-05-24 03:41:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2024-05-24 03:41:18] [INFO ] Time to serialize gal into /tmp/CTLFireability9248161305040127056.gal : 17 ms
[2024-05-24 03:41:18] [INFO ] Time to serialize properties into /tmp/CTLFireability14981459107479130962.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/CTLFireability9248161305040127056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14981459107479130962.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.02798e+14,5.20013,126056,2881,48,176360,645,871,509337,78,2095,0


Converting to forward existential form...Done !
original formula: EF(EG(AX(FALSE)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(EX(!(FALSE))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t131, t412, t417, i0.i0.u4.t392, i2.i0.t355, i2.i0.t364, i2.i0.t369, i2.i0.t371, i2.i0.t373, ...1741
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 a local 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
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
(forward)formula 0,1,7.09545,126056,1,0,184665,645,5297,509337,337,2095,759312
FORMULA HealthRecord-PT-17-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 635/635 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 425 transition count 573
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 425 transition count 573
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 101 place count 408 transition count 544
Iterating global reduction 0 with 17 rules applied. Total rules applied 118 place count 408 transition count 544
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 119 place count 408 transition count 543
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 126 place count 401 transition count 532
Iterating global reduction 1 with 7 rules applied. Total rules applied 133 place count 401 transition count 532
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 137 place count 397 transition count 526
Iterating global reduction 1 with 4 rules applied. Total rules applied 141 place count 397 transition count 526
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 143 place count 395 transition count 521
Iterating global reduction 1 with 2 rules applied. Total rules applied 145 place count 395 transition count 521
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 146 place count 394 transition count 519
Iterating global reduction 1 with 1 rules applied. Total rules applied 147 place count 394 transition count 519
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 150 place count 394 transition count 516
Applied a total of 150 rules in 40 ms. Remains 394 /467 variables (removed 73) and now considering 516/635 (removed 119) transitions.
// Phase 1: matrix 516 rows 394 cols
[2024-05-24 03:41:26] [INFO ] Computed 18 invariants in 8 ms
[2024-05-24 03:41:26] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-24 03:41:26] [INFO ] Invariant cache hit.
[2024-05-24 03:41:26] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2024-05-24 03:41:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (OVERLAPS) 1/394 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-05-24 03:41:32] [INFO ] Deduced a trap composed of 52 places in 153 ms of which 2 ms to minimize.
[2024-05-24 03:41:33] [INFO ] Deduced a trap composed of 170 places in 117 ms of which 2 ms to minimize.
[2024-05-24 03:41:33] [INFO ] Deduced a trap composed of 114 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:41:34] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:41:35] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:41:35] [INFO ] Deduced a trap composed of 82 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:41:35] [INFO ] Deduced a trap composed of 86 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:41:35] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:41:35] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:41:36] [INFO ] Deduced a trap composed of 83 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:41:36] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:41:37] [INFO ] Deduced a trap composed of 29 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:41:37] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:41:37] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 1 ms to minimize.
[2024-05-24 03:41:37] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:41:37] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 16/34 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-05-24 03:41:41] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:41:41] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:41:41] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:41:41] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 3 ms to minimize.
[2024-05-24 03:41:42] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:41:42] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:41:42] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:41:42] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:41:42] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2024-05-24 03:41:43] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:41:43] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 3 ms to minimize.
[2024-05-24 03:41:43] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:41:43] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 2 ms to minimize.
[2024-05-24 03:41:44] [INFO ] Deduced a trap composed of 83 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:41:44] [INFO ] Deduced a trap composed of 85 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:41:44] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 1 ms to minimize.
[2024-05-24 03:41:44] [INFO ] Deduced a trap composed of 90 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:41:45] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-05-24 03:41:47] [INFO ] Deduced a trap composed of 215 places in 121 ms of which 3 ms to minimize.
[2024-05-24 03:41:47] [INFO ] Deduced a trap composed of 170 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:41:47] [INFO ] Deduced a trap composed of 106 places in 119 ms of which 2 ms to minimize.
[2024-05-24 03:41:48] [INFO ] Deduced a trap composed of 81 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:41:48] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:41:48] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:41:49] [INFO ] Deduced a trap composed of 80 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:41:50] [INFO ] Deduced a trap composed of 78 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:41:50] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:41:50] [INFO ] Deduced a trap composed of 143 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:41:50] [INFO ] Deduced a trap composed of 77 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:41:50] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:41:51] [INFO ] Deduced a trap composed of 77 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-05-24 03:41:53] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:41:54] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 394/910 variables, and 67 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 49/49 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (OVERLAPS) 1/394 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-05-24 03:42:00] [INFO ] Deduced a trap composed of 81 places in 113 ms of which 2 ms to minimize.
[2024-05-24 03:42:00] [INFO ] Deduced a trap composed of 78 places in 107 ms of which 3 ms to minimize.
[2024-05-24 03:42:03] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-05-24 03:42:04] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 2 ms to minimize.
[2024-05-24 03:42:05] [INFO ] Deduced a trap composed of 81 places in 106 ms of which 2 ms to minimize.
[2024-05-24 03:42:05] [INFO ] Deduced a trap composed of 80 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:42:05] [INFO ] Deduced a trap composed of 179 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:42:05] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:42:05] [INFO ] Deduced a trap composed of 81 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:42:05] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 3 ms to minimize.
[2024-05-24 03:42:06] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:42:07] [INFO ] Deduced a trap composed of 79 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:42:07] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:42:07] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:42:07] [INFO ] Deduced a trap composed of 77 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:42:07] [INFO ] Deduced a trap composed of 77 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:42:07] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:42:08] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 3 ms to minimize.
[2024-05-24 03:42:08] [INFO ] Deduced a trap composed of 78 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:42:08] [INFO ] Deduced a trap composed of 78 places in 86 ms of which 1 ms to minimize.
[2024-05-24 03:42:08] [INFO ] Deduced a trap composed of 106 places in 113 ms of which 2 ms to minimize.
[2024-05-24 03:42:08] [INFO ] Deduced a trap composed of 78 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:42:09] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/394 variables, 20/90 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-05-24 03:42:09] [INFO ] Deduced a trap composed of 117 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:42:10] [INFO ] Deduced a trap composed of 135 places in 114 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/394 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-05-24 03:42:15] [INFO ] Deduced a trap composed of 205 places in 115 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/394 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 515 unsolved
[2024-05-24 03:42:19] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:42:19] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:42:21] [INFO ] Deduced a trap composed of 237 places in 107 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 394/910 variables, and 96 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/394 constraints, PredecessorRefiner: 0/515 constraints, Known Traps: 78/78 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 394/467 places, 516/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60655 ms. Remains : 394/467 places, 516/635 transitions.
[2024-05-24 03:42:26] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:42:26] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:42:26] [INFO ] Input system was already deterministic with 516 transitions.
[2024-05-24 03:42:26] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:42:26] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:42:26] [INFO ] Time to serialize gal into /tmp/CTLFireability7737173317536356417.gal : 2 ms
[2024-05-24 03:42:26] [INFO ] Time to serialize properties into /tmp/CTLFireability14896181750066707914.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/CTLFireability7737173317536356417.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14896181750066707914.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,3.06722e+14,8.04279,231288,2,23320,5,712474,6,0,2094,1.40961e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-24 03:42:56] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:42:56] [INFO ] Applying decomposition
[2024-05-24 03:42:56] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2801856226782677400.txt' '-o' '/tmp/graph2801856226782677400.bin' '-w' '/tmp/graph2801856226782677400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2801856226782677400.bin' '-l' '-1' '-v' '-w' '/tmp/graph2801856226782677400.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:42:56] [INFO ] Decomposing Gal with order
[2024-05-24 03:42:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:42:56] [INFO ] Removed a total of 183 redundant transitions.
[2024-05-24 03:42:56] [INFO ] Flatten gal took : 19 ms
[2024-05-24 03:42:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 12 ms.
[2024-05-24 03:42:56] [INFO ] Time to serialize gal into /tmp/CTLFireability8783120174636799509.gal : 4 ms
[2024-05-24 03:42:56] [INFO ] Time to serialize properties into /tmp/CTLFireability9483214530822909358.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/CTLFireability8783120174636799509.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9483214530822909358.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 467/467 places, 635/635 transitions.
Graph (trivial) has 555 edges and 467 vertex of which 78 / 467 are part of one of the 21 SCC in 1 ms
Free SCC test removed 57 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 0 with 174 rules applied. Total rules applied 175 place count 409 transition count 394
Reduce places removed 174 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 191 rules applied. Total rules applied 366 place count 235 transition count 377
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 374 place count 227 transition count 377
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 374 place count 227 transition count 370
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 388 place count 220 transition count 370
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 438 place count 170 transition count 274
Iterating global reduction 3 with 50 rules applied. Total rules applied 488 place count 170 transition count 274
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 492 place count 170 transition count 270
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 496 place count 166 transition count 270
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 506 place count 156 transition count 252
Iterating global reduction 5 with 10 rules applied. Total rules applied 516 place count 156 transition count 252
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 517 place count 155 transition count 251
Iterating global reduction 5 with 1 rules applied. Total rules applied 518 place count 155 transition count 251
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 519 place count 154 transition count 249
Iterating global reduction 5 with 1 rules applied. Total rules applied 520 place count 154 transition count 249
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 521 place count 153 transition count 247
Iterating global reduction 5 with 1 rules applied. Total rules applied 522 place count 153 transition count 247
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 566 place count 131 transition count 225
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 574 place count 131 transition count 217
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 588 place count 117 transition count 189
Iterating global reduction 6 with 14 rules applied. Total rules applied 602 place count 117 transition count 189
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 611 place count 108 transition count 175
Iterating global reduction 6 with 9 rules applied. Total rules applied 620 place count 108 transition count 175
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 623 place count 108 transition count 172
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 632 place count 99 transition count 162
Iterating global reduction 7 with 9 rules applied. Total rules applied 641 place count 99 transition count 162
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 647 place count 99 transition count 156
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 649 place count 97 transition count 152
Iterating global reduction 8 with 2 rules applied. Total rules applied 651 place count 97 transition count 152
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 653 place count 95 transition count 148
Iterating global reduction 8 with 2 rules applied. Total rules applied 655 place count 95 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 658 place count 95 transition count 145
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 659 place count 94 transition count 143
Iterating global reduction 9 with 1 rules applied. Total rules applied 660 place count 94 transition count 143
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 662 place count 94 transition count 141
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 663 place count 94 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 664 place count 93 transition count 140
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 665 place count 92 transition count 138
Iterating global reduction 11 with 1 rules applied. Total rules applied 666 place count 92 transition count 138
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 667 place count 91 transition count 136
Iterating global reduction 11 with 1 rules applied. Total rules applied 668 place count 91 transition count 136
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 671 place count 88 transition count 133
Iterating global reduction 11 with 3 rules applied. Total rules applied 674 place count 88 transition count 133
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 11 with 2 rules applied. Total rules applied 676 place count 87 transition count 132
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 677 place count 86 transition count 131
Iterating global reduction 11 with 1 rules applied. Total rules applied 678 place count 86 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 682 place count 86 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 682 place count 86 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 684 place count 85 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 685 place count 84 transition count 125
Applied a total of 685 rules in 55 ms. Remains 84 /467 variables (removed 383) and now considering 125/635 (removed 510) transitions.
[2024-05-24 03:43:27] [INFO ] Flow matrix only has 115 transitions (discarded 10 similar events)
// Phase 1: matrix 115 rows 84 cols
[2024-05-24 03:43:27] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:43:27] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-24 03:43:27] [INFO ] Flow matrix only has 115 transitions (discarded 10 similar events)
[2024-05-24 03:43:27] [INFO ] Invariant cache hit.
[2024-05-24 03:43:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:43:27] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-24 03:43:27] [INFO ] Redundant transitions in 0 ms returned []
Running 109 sub problems to find dead transitions.
[2024-05-24 03:43:27] [INFO ] Flow matrix only has 115 transitions (discarded 10 similar events)
[2024-05-24 03:43:27] [INFO ] Invariant cache hit.
[2024-05-24 03:43:27] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 8/84 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:43:27] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:43:27] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-24 03:43:27] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 0 ms to minimize.
[2024-05-24 03:43:27] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (OVERLAPS) 114/198 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (OVERLAPS) 1/199 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 0/199 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 98 constraints, problems are : Problem set: 0 solved, 109 unsolved in 2906 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 109 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 2 (OVERLAPS) 8/84 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 109 unsolved
[2024-05-24 03:43:30] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:43:30] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 6 (OVERLAPS) 114/198 variables, 84/99 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 109/208 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 9 (OVERLAPS) 1/199 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/199 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 109 unsolved
At refinement iteration 11 (OVERLAPS) 0/199 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 109 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 209 constraints, problems are : Problem set: 0 solved, 109 unsolved in 3321 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 84/84 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 109/109 constraints, Known Traps: 6/6 constraints]
After SMT, in 6265ms problems are : Problem set: 0 solved, 109 unsolved
Search for dead transitions found 0 dead transitions in 6266ms
Starting structural reductions in SI_CTL mode, iteration 1 : 84/467 places, 125/635 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6449 ms. Remains : 84/467 places, 125/635 transitions.
[2024-05-24 03:43:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:43:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:43:33] [INFO ] Input system was already deterministic with 125 transitions.
[2024-05-24 03:43:33] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:43:33] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:43:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9481298228283144073.gal : 1 ms
[2024-05-24 03:43:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16833604029423057507.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9481298228283144073.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16833604029423057507.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality16833604029423057507.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 6
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6 after 30
SDD proceeding with computation,1 properties remain. new max is 64
RANDOM walk for 39418 steps (2305 resets) in 478 ms. (82 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-17-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
SDD size :30 after 1899
ITS runner timed out or was interrupted.
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1899 after 2056
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2056 after 4081
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 635/635 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 422 transition count 570
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 422 transition count 570
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 111 place count 401 transition count 534
Iterating global reduction 0 with 21 rules applied. Total rules applied 132 place count 401 transition count 534
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 133 place count 401 transition count 533
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 147 place count 387 transition count 510
Iterating global reduction 1 with 14 rules applied. Total rules applied 161 place count 387 transition count 510
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 171 place count 377 transition count 495
Iterating global reduction 1 with 10 rules applied. Total rules applied 181 place count 377 transition count 495
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 189 place count 369 transition count 481
Iterating global reduction 1 with 8 rules applied. Total rules applied 197 place count 369 transition count 481
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 205 place count 361 transition count 472
Iterating global reduction 1 with 8 rules applied. Total rules applied 213 place count 361 transition count 472
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 216 place count 361 transition count 469
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 219 place count 358 transition count 466
Iterating global reduction 2 with 3 rules applied. Total rules applied 222 place count 358 transition count 466
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 225 place count 358 transition count 463
Applied a total of 225 rules in 30 ms. Remains 358 /467 variables (removed 109) and now considering 463/635 (removed 172) transitions.
// Phase 1: matrix 463 rows 358 cols
[2024-05-24 03:43:33] [INFO ] Computed 18 invariants in 6 ms
[2024-05-24 03:43:33] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-24 03:43:33] [INFO ] Invariant cache hit.
[2024-05-24 03:43:33] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2024-05-24 03:43:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-24 03:43:39] [INFO ] Deduced a trap composed of 31 places in 128 ms of which 2 ms to minimize.
[2024-05-24 03:43:39] [INFO ] Deduced a trap composed of 156 places in 131 ms of which 2 ms to minimize.
[2024-05-24 03:43:39] [INFO ] Deduced a trap composed of 107 places in 132 ms of which 2 ms to minimize.
[2024-05-24 03:43:39] [INFO ] Deduced a trap composed of 86 places in 143 ms of which 2 ms to minimize.
[2024-05-24 03:43:39] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 2 ms to minimize.
[2024-05-24 03:43:40] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:43:40] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 3 ms to minimize.
[2024-05-24 03:43:40] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:43:40] [INFO ] Deduced a trap composed of 191 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:43:40] [INFO ] Deduced a trap composed of 130 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:43:41] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:43:41] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 2 ms to minimize.
[2024-05-24 03:43:41] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 4 ms to minimize.
[2024-05-24 03:43:42] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:43:42] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:43:42] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:43:42] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 1 ms to minimize.
[2024-05-24 03:43:42] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:43:43] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:43:43] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-24 03:43:46] [INFO ] Deduced a trap composed of 67 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:43:46] [INFO ] Deduced a trap composed of 88 places in 115 ms of which 2 ms to minimize.
[2024-05-24 03:43:48] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 1 ms to minimize.
[2024-05-24 03:43:48] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:43:49] [INFO ] Deduced a trap composed of 67 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:43:49] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:43:49] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:43:49] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:43:50] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:43:50] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:43:50] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 11/49 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-24 03:43:51] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:43:53] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:43:53] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 7 (OVERLAPS) 463/821 variables, 358/410 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-24 03:44:01] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 1 ms to minimize.
[2024-05-24 03:44:01] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:44:01] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:44:02] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:44:03] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:44:03] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 821/821 variables, and 416 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/358 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 40/58 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-24 03:44:06] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:44:07] [INFO ] Deduced a trap composed of 92 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:44:07] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-24 03:44:10] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:44:11] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-05-24 03:44:11] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/358 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-24 03:44:15] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:44:15] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:44:16] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
[2024-05-24 03:44:16] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:44:16] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:44:16] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/358 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-24 03:44:19] [INFO ] Deduced a trap composed of 135 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:44:19] [INFO ] Deduced a trap composed of 135 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:44:19] [INFO ] Deduced a trap composed of 65 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:44:19] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 1 ms to minimize.
[2024-05-24 03:44:21] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/358 variables, 5/75 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/358 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 9 (OVERLAPS) 463/821 variables, 358/433 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/821 variables, 462/895 constraints. Problems are: Problem set: 0 solved, 462 unsolved
[2024-05-24 03:44:29] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:44:33] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:44:33] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 821/821 variables, and 898 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 358/358 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 60/60 constraints]
After SMT, in 60097ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 358/467 places, 463/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60411 ms. Remains : 358/467 places, 463/635 transitions.
[2024-05-24 03:44:34] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:44:34] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:44:34] [INFO ] Input system was already deterministic with 463 transitions.
[2024-05-24 03:44:34] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:44:34] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:44:34] [INFO ] Time to serialize gal into /tmp/CTLFireability8891856571140875690.gal : 3 ms
[2024-05-24 03:44:34] [INFO ] Time to serialize properties into /tmp/CTLFireability6139930154206294638.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/CTLFireability8891856571140875690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6139930154206294638.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.04152e+14,5.46626,154384,2,15300,5,467840,6,0,1897,936866,0


Converting to forward existential form...Done !
original formula: AX(EF((p576==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (p576==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t42...902
Detected timeout of ITS tools.
[2024-05-24 03:45:04] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:45:04] [INFO ] Applying decomposition
[2024-05-24 03:45:04] [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/graph9391856420619265130.txt' '-o' '/tmp/graph9391856420619265130.bin' '-w' '/tmp/graph9391856420619265130.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9391856420619265130.bin' '-l' '-1' '-v' '-w' '/tmp/graph9391856420619265130.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:45:04] [INFO ] Decomposing Gal with order
[2024-05-24 03:45:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:45:04] [INFO ] Removed a total of 174 redundant transitions.
[2024-05-24 03:45:04] [INFO ] Flatten gal took : 35 ms
[2024-05-24 03:45:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 19 ms.
[2024-05-24 03:45:04] [INFO ] Time to serialize gal into /tmp/CTLFireability6263705697295855207.gal : 16 ms
[2024-05-24 03:45:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12776453237481423503.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/CTLFireability6263705697295855207.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12776453237481423503.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.04152e+14,5.90532,144280,3655,116,200363,3084,908,618141,111,17997,0


Converting to forward existential form...Done !
original formula: AX(EF((i22.i2.u133.p576==1)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U (i22.i2.u133.p576==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t86, t413, t418, i1.i0.t393, i3.i0.t356, i3.i0.t358, i3.i0.t370, i3.i0.t372, i3.i0.t374, i3.i...1899
(forward)formula 0,1,19.6833,408544,1,0,662948,3084,6358,1.25216e+06,535,17997,1950638
FORMULA HealthRecord-PT-17-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 635/635 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 426 transition count 574
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 426 transition count 574
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 101 place count 407 transition count 542
Iterating global reduction 0 with 19 rules applied. Total rules applied 120 place count 407 transition count 542
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 121 place count 407 transition count 541
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 135 place count 393 transition count 518
Iterating global reduction 1 with 14 rules applied. Total rules applied 149 place count 393 transition count 518
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 156 place count 386 transition count 506
Iterating global reduction 1 with 7 rules applied. Total rules applied 163 place count 386 transition count 506
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 168 place count 381 transition count 498
Iterating global reduction 1 with 5 rules applied. Total rules applied 173 place count 381 transition count 498
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 178 place count 376 transition count 492
Iterating global reduction 1 with 5 rules applied. Total rules applied 183 place count 376 transition count 492
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 186 place count 376 transition count 489
Applied a total of 186 rules in 28 ms. Remains 376 /467 variables (removed 91) and now considering 489/635 (removed 146) transitions.
// Phase 1: matrix 489 rows 376 cols
[2024-05-24 03:45:24] [INFO ] Computed 18 invariants in 2 ms
[2024-05-24 03:45:24] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-24 03:45:24] [INFO ] Invariant cache hit.
[2024-05-24 03:45:24] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
Running 488 sub problems to find dead transitions.
[2024-05-24 03:45:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:45:29] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 3 ms to minimize.
[2024-05-24 03:45:30] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 3 ms to minimize.
[2024-05-24 03:45:30] [INFO ] Deduced a trap composed of 138 places in 128 ms of which 2 ms to minimize.
[2024-05-24 03:45:30] [INFO ] Deduced a trap composed of 110 places in 125 ms of which 3 ms to minimize.
[2024-05-24 03:45:30] [INFO ] Deduced a trap composed of 133 places in 129 ms of which 2 ms to minimize.
[2024-05-24 03:45:30] [INFO ] Deduced a trap composed of 115 places in 116 ms of which 2 ms to minimize.
[2024-05-24 03:45:30] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 3 ms to minimize.
[2024-05-24 03:45:31] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 2 ms to minimize.
[2024-05-24 03:45:31] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 2 ms to minimize.
[2024-05-24 03:45:31] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 2 ms to minimize.
[2024-05-24 03:45:32] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
[2024-05-24 03:45:32] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 1 ms to minimize.
[2024-05-24 03:45:32] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 1 ms to minimize.
[2024-05-24 03:45:32] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 2 ms to minimize.
[2024-05-24 03:45:32] [INFO ] Deduced a trap composed of 72 places in 93 ms of which 1 ms to minimize.
[2024-05-24 03:45:32] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 1 ms to minimize.
[2024-05-24 03:45:33] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:45:33] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:45:33] [INFO ] Deduced a trap composed of 73 places in 100 ms of which 1 ms to minimize.
[2024-05-24 03:45:33] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:45:37] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 2 ms to minimize.
[2024-05-24 03:45:37] [INFO ] Deduced a trap composed of 97 places in 126 ms of which 3 ms to minimize.
[2024-05-24 03:45:37] [INFO ] Deduced a trap composed of 68 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:45:37] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:45:38] [INFO ] Deduced a trap composed of 68 places in 91 ms of which 1 ms to minimize.
[2024-05-24 03:45:38] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:45:38] [INFO ] Deduced a trap composed of 86 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:45:38] [INFO ] Deduced a trap composed of 50 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:45:38] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:45:38] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:45:38] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 1 ms to minimize.
[2024-05-24 03:45:39] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:45:39] [INFO ] Deduced a trap composed of 67 places in 96 ms of which 1 ms to minimize.
[2024-05-24 03:45:39] [INFO ] Deduced a trap composed of 75 places in 62 ms of which 2 ms to minimize.
[2024-05-24 03:45:39] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:45:39] [INFO ] Deduced a trap composed of 77 places in 96 ms of which 1 ms to minimize.
[2024-05-24 03:45:40] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:45:40] [INFO ] Deduced a trap composed of 68 places in 92 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:45:44] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:45:44] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 1 ms to minimize.
[2024-05-24 03:45:45] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:45:45] [INFO ] Deduced a trap composed of 79 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:45:45] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:45:45] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:45:45] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:45:45] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:45:46] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:45:46] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 10/66 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:45:49] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2024-05-24 03:45:50] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:45:50] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 2 ms to minimize.
[2024-05-24 03:45:51] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:45:51] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 5/71 constraints. Problems are: Problem set: 0 solved, 488 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/865 variables, and 71 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/376 constraints, PredecessorRefiner: 488/488 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 488 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/375 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 1 (OVERLAPS) 1/376 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/376 variables, 53/71 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:45:59] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 1 ms to minimize.
[2024-05-24 03:45:59] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:45:59] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:45:59] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:46:01] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 2 ms to minimize.
[2024-05-24 03:46:01] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:46:02] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/376 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:46:02] [INFO ] Deduced a trap composed of 205 places in 119 ms of which 2 ms to minimize.
[2024-05-24 03:46:03] [INFO ] Deduced a trap composed of 206 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:46:05] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/376 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 7 (OVERLAPS) 489/865 variables, 376/457 constraints. Problems are: Problem set: 0 solved, 488 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/865 variables, 488/945 constraints. Problems are: Problem set: 0 solved, 488 unsolved
[2024-05-24 03:46:18] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:46:18] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:46:18] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/865 variables, 3/948 constraints. Problems are: Problem set: 0 solved, 488 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 865/865 variables, and 948 constraints, problems are : Problem set: 0 solved, 488 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 376/376 constraints, PredecessorRefiner: 488/488 constraints, Known Traps: 66/66 constraints]
After SMT, in 60105ms problems are : Problem set: 0 solved, 488 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 376/467 places, 489/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60516 ms. Remains : 376/467 places, 489/635 transitions.
[2024-05-24 03:46:24] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:46:24] [INFO ] Flatten gal took : 16 ms
[2024-05-24 03:46:24] [INFO ] Input system was already deterministic with 489 transitions.
[2024-05-24 03:46:24] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:46:24] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:46:24] [INFO ] Time to serialize gal into /tmp/CTLFireability15301831474485076863.gal : 2 ms
[2024-05-24 03:46:24] [INFO ] Time to serialize properties into /tmp/CTLFireability4150314322431698131.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/CTLFireability15301831474485076863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4150314322431698131.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.90868e+14,7.98567,220228,2,17211,5,689828,6,0,1995,1.35286e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-24 03:46:54] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:46:54] [INFO ] Applying decomposition
[2024-05-24 03:46:54] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph132932559294635507.txt' '-o' '/tmp/graph132932559294635507.bin' '-w' '/tmp/graph132932559294635507.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph132932559294635507.bin' '-l' '-1' '-v' '-w' '/tmp/graph132932559294635507.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:46:54] [INFO ] Decomposing Gal with order
[2024-05-24 03:46:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:46:54] [INFO ] Removed a total of 167 redundant transitions.
[2024-05-24 03:46:54] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:46:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 4 ms.
[2024-05-24 03:46:54] [INFO ] Time to serialize gal into /tmp/CTLFireability7929383414810077342.gal : 3 ms
[2024-05-24 03:46:54] [INFO ] Time to serialize properties into /tmp/CTLFireability11671964798462842748.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/CTLFireability7929383414810077342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11671964798462842748.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.90868e+14,6.60326,163328,3450,206,212831,2678,955,841292,106,14061,0


Converting to forward existential form...Done !
original formula: A(!(AX(!(((A((i21.i0.u141.p547==1) U (i10.i3.u68.p329==1)) + (i12.i1.u80.p358==1)) + (i22.i2.u113.p461==1))))) U AF(EX((E((u51.p278==1) U...209
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(!(EX((E((u51.p278==1) U (i12.i1.u78.p362==1)) * !(E(TRUE U !((i18.i1.u124.p529==1)))))))))...569
Reverse transition relation is NOT exact ! Due to transitions t310, t357, t407, t420, t421, t422, t423, t424, t436, t440, t441, t442, u51.t263, i1.i0.t374,...1844
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
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
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
(forward)formula 0,0,23.6288,584936,1,0,906514,4992,6415,2.85611e+06,487,20780,1739872
FORMULA HealthRecord-PT-17-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 635/635 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 427 transition count 577
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 427 transition count 577
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 98 place count 409 transition count 547
Iterating global reduction 0 with 18 rules applied. Total rules applied 116 place count 409 transition count 547
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 117 place count 409 transition count 546
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 128 place count 398 transition count 526
Iterating global reduction 1 with 11 rules applied. Total rules applied 139 place count 398 transition count 526
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 145 place count 392 transition count 517
Iterating global reduction 1 with 6 rules applied. Total rules applied 151 place count 392 transition count 517
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 155 place count 388 transition count 511
Iterating global reduction 1 with 4 rules applied. Total rules applied 159 place count 388 transition count 511
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 162 place count 385 transition count 508
Iterating global reduction 1 with 3 rules applied. Total rules applied 165 place count 385 transition count 508
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 167 place count 383 transition count 506
Iterating global reduction 1 with 2 rules applied. Total rules applied 169 place count 383 transition count 506
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 171 place count 383 transition count 504
Applied a total of 171 rules in 39 ms. Remains 383 /467 variables (removed 84) and now considering 504/635 (removed 131) transitions.
// Phase 1: matrix 504 rows 383 cols
[2024-05-24 03:47:18] [INFO ] Computed 18 invariants in 7 ms
[2024-05-24 03:47:18] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-24 03:47:18] [INFO ] Invariant cache hit.
[2024-05-24 03:47:18] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Running 503 sub problems to find dead transitions.
[2024-05-24 03:47:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/382 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (OVERLAPS) 1/383 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-24 03:47:24] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-05-24 03:47:24] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 2 ms to minimize.
[2024-05-24 03:47:25] [INFO ] Deduced a trap composed of 186 places in 122 ms of which 2 ms to minimize.
[2024-05-24 03:47:25] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 2 ms to minimize.
[2024-05-24 03:47:25] [INFO ] Deduced a trap composed of 30 places in 131 ms of which 2 ms to minimize.
[2024-05-24 03:47:25] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:47:25] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 2 ms to minimize.
[2024-05-24 03:47:25] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 2 ms to minimize.
[2024-05-24 03:47:26] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 3 ms to minimize.
[2024-05-24 03:47:26] [INFO ] Deduced a trap composed of 204 places in 114 ms of which 2 ms to minimize.
[2024-05-24 03:47:26] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 1 ms to minimize.
[2024-05-24 03:47:27] [INFO ] Deduced a trap composed of 143 places in 115 ms of which 2 ms to minimize.
[2024-05-24 03:47:28] [INFO ] Deduced a trap composed of 54 places in 126 ms of which 2 ms to minimize.
[2024-05-24 03:47:28] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:47:28] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 1 ms to minimize.
[2024-05-24 03:47:28] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:47:28] [INFO ] Deduced a trap composed of 73 places in 125 ms of which 3 ms to minimize.
[2024-05-24 03:47:29] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 2 ms to minimize.
[2024-05-24 03:47:29] [INFO ] Deduced a trap composed of 135 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:47:29] [INFO ] Deduced a trap composed of 70 places in 106 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-24 03:47:33] [INFO ] Deduced a trap composed of 132 places in 120 ms of which 2 ms to minimize.
[2024-05-24 03:47:33] [INFO ] Deduced a trap composed of 95 places in 119 ms of which 2 ms to minimize.
[2024-05-24 03:47:33] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 1 ms to minimize.
[2024-05-24 03:47:34] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:47:34] [INFO ] Deduced a trap composed of 70 places in 88 ms of which 1 ms to minimize.
[2024-05-24 03:47:34] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:47:34] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:47:34] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:47:35] [INFO ] Deduced a trap composed of 80 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:47:35] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:47:35] [INFO ] Deduced a trap composed of 69 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:47:35] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 1 ms to minimize.
[2024-05-24 03:47:36] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 1 ms to minimize.
[2024-05-24 03:47:36] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:47:36] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:47:36] [INFO ] Deduced a trap composed of 75 places in 91 ms of which 1 ms to minimize.
[2024-05-24 03:47:36] [INFO ] Deduced a trap composed of 94 places in 112 ms of which 2 ms to minimize.
[2024-05-24 03:47:37] [INFO ] Deduced a trap composed of 97 places in 117 ms of which 2 ms to minimize.
[2024-05-24 03:47:37] [INFO ] Deduced a trap composed of 98 places in 114 ms of which 2 ms to minimize.
[2024-05-24 03:47:37] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-05-24 03:47:37] [INFO ] Deduced a trap composed of 97 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:47:38] [INFO ] Deduced a trap composed of 42 places in 131 ms of which 2 ms to minimize.
[2024-05-24 03:47:38] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2024-05-24 03:47:38] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 3 ms to minimize.
[2024-05-24 03:47:39] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:47:39] [INFO ] Deduced a trap composed of 73 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:47:39] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:47:40] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 1 ms to minimize.
[2024-05-24 03:47:40] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 1 ms to minimize.
[2024-05-24 03:47:40] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:47:41] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 1 ms to minimize.
[2024-05-24 03:47:41] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 503 unsolved
SMT process timed out in 30078ms, After SMT, problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 30084ms
Starting structural reductions in LTL mode, iteration 1 : 383/467 places, 504/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30461 ms. Remains : 383/467 places, 504/635 transitions.
[2024-05-24 03:47:48] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:47:48] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:47:48] [INFO ] Input system was already deterministic with 504 transitions.
[2024-05-24 03:47:49] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:47:49] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:47:49] [INFO ] Time to serialize gal into /tmp/CTLFireability9880210898192153972.gal : 2 ms
[2024-05-24 03:47:49] [INFO ] Time to serialize properties into /tmp/CTLFireability17576371410434620679.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/CTLFireability9880210898192153972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17576371410434620679.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.00049e+14,10.3631,250544,2,19089,5,719975,6,0,2038,1.6382e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-24 03:48:19] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:48:19] [INFO ] Applying decomposition
[2024-05-24 03:48:19] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9123270983489836075.txt' '-o' '/tmp/graph9123270983489836075.bin' '-w' '/tmp/graph9123270983489836075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9123270983489836075.bin' '-l' '-1' '-v' '-w' '/tmp/graph9123270983489836075.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:48:19] [INFO ] Decomposing Gal with order
[2024-05-24 03:48:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:48:19] [INFO ] Removed a total of 174 redundant transitions.
[2024-05-24 03:48:19] [INFO ] Flatten gal took : 28 ms
[2024-05-24 03:48:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 4 ms.
[2024-05-24 03:48:19] [INFO ] Time to serialize gal into /tmp/CTLFireability6378590252492395068.gal : 3 ms
[2024-05-24 03:48:19] [INFO ] Time to serialize properties into /tmp/CTLFireability10129677781405707071.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/CTLFireability6378590252492395068.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10129677781405707071.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.00049e+14,13.1377,262080,3113,380,382542,14150,980,1.13696e+06,171,69626,0


Converting to forward existential form...Done !
original formula: E(((EG(AF((((i0.i0.u11.p39==1)&&(i26.i1.u136.p617==1))||(i0.i1.u10.p36==1)))) + AF((i22.i2.u116.p520==1))) + ((AG((i3.i2.u26.p108==1)) * ...302
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,((EG(!(EG(!((((i0.i0.u11.p39==1)&&(i26.i1.u136.p617==1))||(i0.i1.u10.p36==1)))))) + !(EG(!((i...370
Reverse transition relation is NOT exact ! Due to transitions t96, t208, t356, t430, t431, t432, t433, t434, t446, t451, i0.i1.u6.t383, i0.i1.u6.t385, i0.i...2110
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 467/467 places, 635/635 transitions.
Graph (trivial) has 555 edges and 467 vertex of which 76 / 467 are part of one of the 20 SCC in 1 ms
Free SCC test removed 56 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 0 with 174 rules applied. Total rules applied 175 place count 410 transition count 395
Reduce places removed 174 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 191 rules applied. Total rules applied 366 place count 236 transition count 378
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 374 place count 228 transition count 378
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 374 place count 228 transition count 371
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 388 place count 221 transition count 371
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 438 place count 171 transition count 274
Iterating global reduction 3 with 50 rules applied. Total rules applied 488 place count 171 transition count 274
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 493 place count 171 transition count 269
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 498 place count 166 transition count 269
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 510 place count 154 transition count 247
Iterating global reduction 5 with 12 rules applied. Total rules applied 522 place count 154 transition count 247
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 523 place count 154 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 524 place count 153 transition count 246
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 531 place count 146 transition count 236
Iterating global reduction 7 with 7 rules applied. Total rules applied 538 place count 146 transition count 236
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 541 place count 146 transition count 233
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 546 place count 141 transition count 226
Iterating global reduction 8 with 5 rules applied. Total rules applied 551 place count 141 transition count 226
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 554 place count 141 transition count 223
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 555 place count 140 transition count 221
Iterating global reduction 9 with 1 rules applied. Total rules applied 556 place count 140 transition count 221
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 557 place count 139 transition count 219
Iterating global reduction 9 with 1 rules applied. Total rules applied 558 place count 139 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 561 place count 139 transition count 216
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 10 with 40 rules applied. Total rules applied 601 place count 119 transition count 196
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 10 with 8 rules applied. Total rules applied 609 place count 119 transition count 188
Discarding 12 places :
Symmetric choice reduction at 11 with 12 rule applications. Total rules 621 place count 107 transition count 164
Iterating global reduction 11 with 12 rules applied. Total rules applied 633 place count 107 transition count 164
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 639 place count 101 transition count 157
Iterating global reduction 11 with 6 rules applied. Total rules applied 645 place count 101 transition count 157
Discarding 6 places :
Symmetric choice reduction at 11 with 6 rule applications. Total rules 651 place count 95 transition count 149
Iterating global reduction 11 with 6 rules applied. Total rules applied 657 place count 95 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 660 place count 95 transition count 146
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 662 place count 93 transition count 142
Iterating global reduction 12 with 2 rules applied. Total rules applied 664 place count 93 transition count 142
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 666 place count 91 transition count 138
Iterating global reduction 12 with 2 rules applied. Total rules applied 668 place count 91 transition count 138
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 12 with 3 rules applied. Total rules applied 671 place count 91 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 673 place count 91 transition count 133
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 1 rules applied. Total rules applied 674 place count 91 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 675 place count 90 transition count 132
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 676 place count 89 transition count 130
Iterating global reduction 15 with 1 rules applied. Total rules applied 677 place count 89 transition count 130
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 678 place count 88 transition count 128
Iterating global reduction 15 with 1 rules applied. Total rules applied 679 place count 88 transition count 128
Discarding 3 places :
Symmetric choice reduction at 15 with 3 rule applications. Total rules 682 place count 85 transition count 125
Iterating global reduction 15 with 3 rules applied. Total rules applied 685 place count 85 transition count 125
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 15 with 2 rules applied. Total rules applied 687 place count 84 transition count 124
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 688 place count 83 transition count 123
Iterating global reduction 15 with 1 rules applied. Total rules applied 689 place count 83 transition count 123
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 15 with 4 rules applied. Total rules applied 693 place count 83 transition count 119
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 15 with 1 rules applied. Total rules applied 694 place count 83 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 695 place count 82 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 696 place count 81 transition count 117
Applied a total of 696 rules in 47 ms. Remains 81 /467 variables (removed 386) and now considering 117/635 (removed 518) transitions.
[2024-05-24 03:48:49] [INFO ] Flow matrix only has 107 transitions (discarded 10 similar events)
// Phase 1: matrix 107 rows 81 cols
[2024-05-24 03:48:49] [INFO ] Computed 10 invariants in 1 ms
[2024-05-24 03:48:49] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-24 03:48:49] [INFO ] Flow matrix only has 107 transitions (discarded 10 similar events)
[2024-05-24 03:48:49] [INFO ] Invariant cache hit.
[2024-05-24 03:48:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:48:49] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-24 03:48:49] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2024-05-24 03:48:49] [INFO ] Flow matrix only has 107 transitions (discarded 10 similar events)
[2024-05-24 03:48:49] [INFO ] Invariant cache hit.
[2024-05-24 03:48:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 2/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-24 03:48:49] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 6/81 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-24 03:48:50] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 106/187 variables, 81/93 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 1/188 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/188 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 0/188 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 94 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 2/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-24 03:48:52] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (OVERLAPS) 6/81 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 106/187 variables, 81/94 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/187 variables, 101/195 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 1/188 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/188 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-05-24 03:48:54] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/188 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/188 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 15 (OVERLAPS) 0/188 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 197 constraints, problems are : Problem set: 0 solved, 101 unsolved in 3926 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 4/4 constraints]
After SMT, in 6987ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 6988ms
Starting structural reductions in SI_CTL mode, iteration 1 : 81/467 places, 117/635 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7148 ms. Remains : 81/467 places, 117/635 transitions.
[2024-05-24 03:48:56] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:48:56] [INFO ] Flatten gal took : 2 ms
[2024-05-24 03:48:56] [INFO ] Input system was already deterministic with 117 transitions.
[2024-05-24 03:48:56] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:48:56] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:48:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12307038120776265676.gal : 1 ms
[2024-05-24 03:48:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8364251795263015700.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12307038120776265676.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8364251795263015700.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8364251795263015700.prop.
RANDOM walk for 40000 steps (2332 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 96
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :96 after 12288
BEST_FIRST walk for 40004 steps (238 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12288 after 7.44415e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :7.44415e+06 after 1.22499e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.22499e+07 after 6.56606e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,3.56352e+08,1.50312,4860,2,433,12,5440,7,0,432,3439,0
Total reachable state count : 356352006

Verifying 1 reachability properties.
Reachability property HealthRecord-PT-17-CTLFireability-2023-14 is true.
FORMULA HealthRecord-PT-17-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-17-CTLFireability-2023-14,2,1.50361,4860,2,85,12,5440,7,0,434,3439,0
Interrupted probabilistic random walk after 3497514 steps, run timeout after 3001 ms. (steps per millisecond=1165 ) properties seen :0 out of 1
Probabilistic random walk after 3497514 steps, saw 531434 distinct states, run finished after 3007 ms. (steps per millisecond=1163 ) properties seen :0
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 635/635 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 423 transition count 571
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 423 transition count 571
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 109 place count 402 transition count 535
Iterating global reduction 0 with 21 rules applied. Total rules applied 130 place count 402 transition count 535
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 131 place count 402 transition count 534
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 146 place count 387 transition count 509
Iterating global reduction 1 with 15 rules applied. Total rules applied 161 place count 387 transition count 509
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 171 place count 377 transition count 494
Iterating global reduction 1 with 10 rules applied. Total rules applied 181 place count 377 transition count 494
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 188 place count 370 transition count 483
Iterating global reduction 1 with 7 rules applied. Total rules applied 195 place count 370 transition count 483
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 202 place count 363 transition count 475
Iterating global reduction 1 with 7 rules applied. Total rules applied 209 place count 363 transition count 475
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 212 place count 363 transition count 472
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 215 place count 360 transition count 469
Iterating global reduction 2 with 3 rules applied. Total rules applied 218 place count 360 transition count 469
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 221 place count 360 transition count 466
Applied a total of 221 rules in 34 ms. Remains 360 /467 variables (removed 107) and now considering 466/635 (removed 169) transitions.
// Phase 1: matrix 466 rows 360 cols
[2024-05-24 03:48:59] [INFO ] Computed 18 invariants in 9 ms
[2024-05-24 03:48:59] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-24 03:48:59] [INFO ] Invariant cache hit.
[2024-05-24 03:48:59] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2024-05-24 03:48:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:49:04] [INFO ] Deduced a trap composed of 63 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:49:05] [INFO ] Deduced a trap composed of 29 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:49:05] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 3 ms to minimize.
[2024-05-24 03:49:05] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:49:05] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:49:05] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2024-05-24 03:49:05] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:49:05] [INFO ] Deduced a trap composed of 40 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:49:06] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:49:06] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:49:06] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:49:06] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:49:06] [INFO ] Deduced a trap composed of 137 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:49:07] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:49:08] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:49:09] [INFO ] Deduced a trap composed of 49 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:49:09] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 17/35 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:49:12] [INFO ] Deduced a trap composed of 107 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:49:12] [INFO ] Deduced a trap composed of 193 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:49:13] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:49:13] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:49:14] [INFO ] Deduced a trap composed of 67 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:49:14] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:49:15] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:49:15] [INFO ] Deduced a trap composed of 65 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:49:15] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:49:15] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:49:15] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:49:16] [INFO ] Deduced a trap composed of 138 places in 113 ms of which 2 ms to minimize.
[2024-05-24 03:49:17] [INFO ] Deduced a trap composed of 150 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:49:18] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:49:18] [INFO ] Deduced a trap composed of 113 places in 90 ms of which 1 ms to minimize.
[2024-05-24 03:49:18] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:49:20] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:49:21] [INFO ] Deduced a trap composed of 65 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:49:23] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:49:27] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 1 ms to minimize.
[2024-05-24 03:49:27] [INFO ] Deduced a trap composed of 88 places in 77 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 1.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 1.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/826 variables, and 56 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/360 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/360 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/360 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 38/56 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:49:36] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:49:36] [INFO ] Deduced a trap composed of 49 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:49:37] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:49:37] [INFO ] Deduced a trap composed of 114 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:49:37] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:49:38] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:49:38] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:49:41] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:49:42] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:49:42] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:49:42] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:49:42] [INFO ] Deduced a trap composed of 191 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:49:43] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:49:45] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 1 ms to minimize.
[2024-05-24 03:49:45] [INFO ] Deduced a trap composed of 72 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:49:47] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 9 (OVERLAPS) 466/826 variables, 360/432 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/826 variables, 465/897 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:49:54] [INFO ] Deduced a trap composed of 55 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:49:54] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:49:59] [INFO ] Deduced a trap composed of 71 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/826 variables, and 900 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 360/360 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 57/57 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 60102ms
Starting structural reductions in LTL mode, iteration 1 : 360/467 places, 466/635 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60451 ms. Remains : 360/467 places, 466/635 transitions.
[2024-05-24 03:49:59] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:49:59] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:49:59] [INFO ] Input system was already deterministic with 466 transitions.
[2024-05-24 03:49:59] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:49:59] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:49:59] [INFO ] Time to serialize gal into /tmp/CTLFireability16401618397665317481.gal : 3 ms
[2024-05-24 03:49:59] [INFO ] Time to serialize properties into /tmp/CTLFireability5286344976174450385.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/CTLFireability16401618397665317481.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5286344976174450385.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.08332e+14,5.36556,140560,2,13210,5,436853,6,0,1908,847506,0


Converting to forward existential form...Done !
original formula: (EX(AX((p134==1))) + (AF(AG((p386==1))) * !(A(AG(AX((p404==1))) U (p387==1)))))
=> equivalent forward existential formula: ([FwdG((Init * !(EX(!(EX(!((p134==1))))))),!(!(E(TRUE U !((p386==1))))))] = FALSE * [(((Init * !(EX(!(EX(!((p134...278
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t34, t35, t36, t39, t40, t41, t44, t49...904
Detected timeout of ITS tools.
[2024-05-24 03:50:29] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:50:29] [INFO ] Applying decomposition
[2024-05-24 03:50: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/graph15898075204314456323.txt' '-o' '/tmp/graph15898075204314456323.bin' '-w' '/tmp/graph15898075204314456323.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15898075204314456323.bin' '-l' '-1' '-v' '-w' '/tmp/graph15898075204314456323.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:50:30] [INFO ] Decomposing Gal with order
[2024-05-24 03:50:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:50:30] [INFO ] Removed a total of 174 redundant transitions.
[2024-05-24 03:50:30] [INFO ] Flatten gal took : 16 ms
[2024-05-24 03:50:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 4 ms.
[2024-05-24 03:50:30] [INFO ] Time to serialize gal into /tmp/CTLFireability11051976390212883158.gal : 3 ms
[2024-05-24 03:50:30] [INFO ] Time to serialize properties into /tmp/CTLFireability10393616180336342371.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/CTLFireability11051976390212883158.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10393616180336342371.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.08332e+14,3.50333,94428,2903,206,148086,3622,920,377475,123,18648,0


Converting to forward existential form...Done !
original formula: (EX(AX((i5.i0.u17.p134==1))) + (AF(AG((u82.p386==1))) * !(A(AG(AX((i17.i1.u88.p404==1))) U (u82.p387==1)))))
=> equivalent forward existential formula: ([FwdG((Init * !(EX(!(EX(!((i5.i0.u17.p134==1))))))),!(!(E(TRUE U !((u82.p386==1))))))] = FALSE * [(((Init * !(E...325
Reverse transition relation is NOT exact ! Due to transitions t85, t131, t416, t421, u82.t157, i2.i1.t386, i2.i1.u8.t359, i2.i1.u8.t361, i2.i1.u8.t362, i2....1908
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 1
Fast SCC detection found a local 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
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,0,24.644,625596,1,0,1.25041e+06,8639,7479,1.76046e+06,713,41658,2385449
FORMULA HealthRecord-PT-17-CTLFireability-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2024-05-24 03:50:54] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:50:54] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:50:54] [INFO ] Applying decomposition
[2024-05-24 03:50:54] [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/graph9795666873450673074.txt' '-o' '/tmp/graph9795666873450673074.bin' '-w' '/tmp/graph9795666873450673074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9795666873450673074.bin' '-l' '-1' '-v' '-w' '/tmp/graph9795666873450673074.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:50:54] [INFO ] Decomposing Gal with order
[2024-05-24 03:50:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:50:54] [INFO ] Removed a total of 240 redundant transitions.
[2024-05-24 03:50:54] [INFO ] Flatten gal took : 20 ms
[2024-05-24 03:50:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 5 ms.
[2024-05-24 03:50:54] [INFO ] Time to serialize gal into /tmp/CTLFireability2776982842200811016.gal : 3 ms
[2024-05-24 03:50:54] [INFO ] Time to serialize properties into /tmp/CTLFireability7321081010927303358.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/CTLFireability2776982842200811016.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7321081010927303358.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 3 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-24 04:02:03] [INFO ] Applying decomposition
[2024-05-24 04:02:03] [INFO ] Flatten gal took : 13 ms
[2024-05-24 04:02:03] [INFO ] Decomposing Gal with order
[2024-05-24 04:02:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:02:03] [INFO ] Removed a total of 53 redundant transitions.
[2024-05-24 04:02:03] [INFO ] Flatten gal took : 17 ms
[2024-05-24 04:02:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 10 ms.
[2024-05-24 04:02:03] [INFO ] Time to serialize gal into /tmp/CTLFireability7733462527726133810.gal : 9 ms
[2024-05-24 04:02:03] [INFO ] Time to serialize properties into /tmp/CTLFireability13060754200609628375.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/CTLFireability7733462527726133810.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13060754200609628375.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 3 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.17094e+15,36.8008,811828,2760,11880,832871,419155,631,3.80286e+06,815,5.21832e+06,0


Converting to forward existential form...Done !
original formula: E((((i1.u18.p563!=1) + EX((i1.u17.p477==1))) + !((E((((i0.i0.i0.u4.p77==1)&&(i1.u18.p617==1))||(i1.u18.p611==1)) U (i0.i0.i0.u4.p59!=1)) ...454
=> equivalent forward existential formula: [((FwdU(Init,(((i1.u18.p563!=1) + EX((i1.u17.p477==1))) + !((E((((i0.i0.i0.u4.p77==1)&&(i1.u18.p617==1))||(i1.u1...603
Reverse transition relation is NOT exact ! Due to transitions t558, t559, t566, t569, i0.i0.u6.t346, i0.i0.u6.t348, i0.i0.u6.t349, i0.i0.u6.t350, i0.i0.u6....3502
ITS-tools command line returned an error code 137
[2024-05-24 04:14:01] [INFO ] Flatten gal took : 12 ms
[2024-05-24 04:14:01] [INFO ] Input system was already deterministic with 635 transitions.
[2024-05-24 04:14:01] [INFO ] Transformed 467 places.
[2024-05-24 04:14:01] [INFO ] Transformed 635 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-24 04:14:01] [INFO ] Time to serialize gal into /tmp/CTLFireability5866267940488205754.gal : 2 ms
[2024-05-24 04:14:01] [INFO ] Time to serialize properties into /tmp/CTLFireability7160337746214505841.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/CTLFireability5866267940488205754.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7160337746214505841.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...328
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 3 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.17094e+15,689.152,14115996,2,726969,5,5.05694e+07,6,0,2505,6.71026e+07,0


Converting to forward existential form...Done !

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-17"
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 HealthRecord-PT-17, 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 r180-tall-171640604300826"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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