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-171640604300825.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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640604300825
=====================================================================

--------------------
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-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-17-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-17-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-17-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-17-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-17-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-17-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-17-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-17-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-17-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-17-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-17-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-17-CTLCardinality-2023-12
FORMULA_NAME HealthRecord-PT-17-CTLCardinality-2023-13
FORMULA_NAME HealthRecord-PT-17-CTLCardinality-2023-14
FORMULA_NAME HealthRecord-PT-17-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716521363067

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
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
CTLCardinality PT
Running Version 202405141337
[2024-05-24 03:29:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 03:29:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 03:29:24] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-05-24 03:29:24] [INFO ] Transformed 624 places.
[2024-05-24 03:29:24] [INFO ] Transformed 828 transitions.
[2024-05-24 03:29:24] [INFO ] Found NUPN structural information;
[2024-05-24 03:29:24] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 110 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 828/828 transitions.
Discarding 106 places :
Symmetric choice reduction at 0 with 106 rule applications. Total rules 106 place count 518 transition count 700
Iterating global reduction 0 with 106 rules applied. Total rules applied 212 place count 518 transition count 700
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 250 place count 480 transition count 653
Iterating global reduction 0 with 38 rules applied. Total rules applied 288 place count 480 transition count 653
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 293 place count 480 transition count 648
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 306 place count 467 transition count 625
Iterating global reduction 1 with 13 rules applied. Total rules applied 319 place count 467 transition count 625
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 324 place count 462 transition count 616
Iterating global reduction 1 with 5 rules applied. Total rules applied 329 place count 462 transition count 616
Applied a total of 329 rules in 138 ms. Remains 462 /624 variables (removed 162) and now considering 616/828 (removed 212) transitions.
// Phase 1: matrix 616 rows 462 cols
[2024-05-24 03:29:24] [INFO ] Computed 18 invariants in 24 ms
[2024-05-24 03:29:25] [INFO ] Implicit Places using invariants in 325 ms returned []
[2024-05-24 03:29:25] [INFO ] Invariant cache hit.
[2024-05-24 03:29:25] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Running 615 sub problems to find dead transitions.
[2024-05-24 03:29:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/461 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 1 (OVERLAPS) 1/462 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/462 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 615 unsolved
[2024-05-24 03:29:34] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 33 ms to minimize.
[2024-05-24 03:29:34] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 4 ms to minimize.
[2024-05-24 03:29:34] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 4 ms to minimize.
[2024-05-24 03:29:34] [INFO ] Deduced a trap composed of 128 places in 138 ms of which 4 ms to minimize.
[2024-05-24 03:29:35] [INFO ] Deduced a trap composed of 151 places in 142 ms of which 3 ms to minimize.
[2024-05-24 03:29:35] [INFO ] Deduced a trap composed of 121 places in 135 ms of which 3 ms to minimize.
[2024-05-24 03:29:35] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 3 ms to minimize.
[2024-05-24 03:29:35] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 4 ms to minimize.
[2024-05-24 03:29:35] [INFO ] Deduced a trap composed of 93 places in 123 ms of which 3 ms to minimize.
[2024-05-24 03:29:36] [INFO ] Deduced a trap composed of 100 places in 110 ms of which 3 ms to minimize.
[2024-05-24 03:29:36] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
[2024-05-24 03:29:36] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 3 ms to minimize.
[2024-05-24 03:29:36] [INFO ] Deduced a trap composed of 98 places in 101 ms of which 3 ms to minimize.
[2024-05-24 03:29:36] [INFO ] Deduced a trap composed of 120 places in 129 ms of which 3 ms to minimize.
[2024-05-24 03:29:37] [INFO ] Deduced a trap composed of 141 places in 135 ms of which 3 ms to minimize.
[2024-05-24 03:29:37] [INFO ] Deduced a trap composed of 133 places in 146 ms of which 3 ms to minimize.
[2024-05-24 03:29:37] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 3 ms to minimize.
[2024-05-24 03:29:37] [INFO ] Deduced a trap composed of 94 places in 102 ms of which 3 ms to minimize.
[2024-05-24 03:29:37] [INFO ] Deduced a trap composed of 99 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:29:37] [INFO ] Deduced a trap composed of 103 places in 110 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/462 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 615 unsolved
[2024-05-24 03:29:42] [INFO ] Deduced a trap composed of 122 places in 103 ms of which 3 ms to minimize.
[2024-05-24 03:29:42] [INFO ] Deduced a trap composed of 86 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:29:43] [INFO ] Deduced a trap composed of 129 places in 114 ms of which 2 ms to minimize.
[2024-05-24 03:29:43] [INFO ] Deduced a trap composed of 138 places in 111 ms of which 3 ms to minimize.
[2024-05-24 03:29:43] [INFO ] Deduced a trap composed of 142 places in 101 ms of which 3 ms to minimize.
[2024-05-24 03:29:43] [INFO ] Deduced a trap composed of 103 places in 102 ms of which 3 ms to minimize.
[2024-05-24 03:29:43] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-05-24 03:29:44] [INFO ] Deduced a trap composed of 69 places in 135 ms of which 2 ms to minimize.
[2024-05-24 03:29:44] [INFO ] Deduced a trap composed of 100 places in 111 ms of which 2 ms to minimize.
[2024-05-24 03:29:44] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:29:44] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:29:44] [INFO ] Deduced a trap composed of 99 places in 114 ms of which 2 ms to minimize.
[2024-05-24 03:29:44] [INFO ] Deduced a trap composed of 119 places in 112 ms of which 2 ms to minimize.
[2024-05-24 03:29:44] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:29:44] [INFO ] Deduced a trap composed of 99 places in 89 ms of which 3 ms to minimize.
[2024-05-24 03:29:45] [INFO ] Deduced a trap composed of 197 places in 142 ms of which 3 ms to minimize.
[2024-05-24 03:29:45] [INFO ] Deduced a trap composed of 265 places in 130 ms of which 3 ms to minimize.
[2024-05-24 03:29:45] [INFO ] Deduced a trap composed of 90 places in 124 ms of which 3 ms to minimize.
[2024-05-24 03:29:45] [INFO ] Deduced a trap composed of 89 places in 126 ms of which 3 ms to minimize.
[2024-05-24 03:29:45] [INFO ] Deduced a trap composed of 91 places in 119 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 615 unsolved
[2024-05-24 03:29:46] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:29:46] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:29:46] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:29:46] [INFO ] Deduced a trap composed of 93 places in 108 ms of which 3 ms to minimize.
[2024-05-24 03:29:47] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:29:47] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 1 ms to minimize.
[2024-05-24 03:29:47] [INFO ] Deduced a trap composed of 71 places in 167 ms of which 2 ms to minimize.
[2024-05-24 03:29:47] [INFO ] Deduced a trap composed of 76 places in 91 ms of which 3 ms to minimize.
[2024-05-24 03:29:48] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 3 ms to minimize.
[2024-05-24 03:29:48] [INFO ] Deduced a trap composed of 84 places in 114 ms of which 3 ms to minimize.
[2024-05-24 03:29:48] [INFO ] Deduced a trap composed of 83 places in 92 ms of which 3 ms to minimize.
[2024-05-24 03:29:49] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 2 ms to minimize.
[2024-05-24 03:29:49] [INFO ] Deduced a trap composed of 134 places in 121 ms of which 3 ms to minimize.
[2024-05-24 03:29:49] [INFO ] Deduced a trap composed of 87 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:29:49] [INFO ] Deduced a trap composed of 87 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:29:50] [INFO ] Deduced a trap composed of 88 places in 84 ms of which 5 ms to minimize.
[2024-05-24 03:29:50] [INFO ] Deduced a trap composed of 99 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:29:51] [INFO ] Deduced a trap composed of 74 places in 141 ms of which 3 ms to minimize.
[2024-05-24 03:29:51] [INFO ] Deduced a trap composed of 86 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:29:51] [INFO ] Deduced a trap composed of 91 places in 105 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 615 unsolved
[2024-05-24 03:29:53] [INFO ] Deduced a trap composed of 136 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:29:53] [INFO ] Deduced a trap composed of 133 places in 115 ms of which 2 ms to minimize.
[2024-05-24 03:29:53] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:29:53] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 3 ms to minimize.
[2024-05-24 03:29:53] [INFO ] Deduced a trap composed of 133 places in 120 ms of which 2 ms to minimize.
[2024-05-24 03:29:53] [INFO ] Deduced a trap composed of 93 places in 118 ms of which 7 ms to minimize.
[2024-05-24 03:29:54] [INFO ] Deduced a trap composed of 161 places in 128 ms of which 3 ms to minimize.
[2024-05-24 03:29:54] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 3 ms to minimize.
[2024-05-24 03:29:55] [INFO ] Deduced a trap composed of 88 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:29:55] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:29:55] [INFO ] Deduced a trap composed of 110 places in 126 ms of which 3 ms to minimize.
[2024-05-24 03:29:55] [INFO ] Deduced a trap composed of 100 places in 140 ms of which 3 ms to minimize.
SMT process timed out in 30279ms, After SMT, problems are : Problem set: 0 solved, 615 unsolved
Search for dead transitions found 0 dead transitions in 30299ms
Starting structural reductions in LTL mode, iteration 1 : 462/624 places, 616/828 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31156 ms. Remains : 462/624 places, 616/828 transitions.
Support contains 110 out of 462 places after structural reductions.
[2024-05-24 03:29:56] [INFO ] Flatten gal took : 62 ms
[2024-05-24 03:29:56] [INFO ] Flatten gal took : 35 ms
[2024-05-24 03:29:56] [INFO ] Input system was already deterministic with 616 transitions.
Support contains 103 out of 462 places (down from 110) after GAL structural reductions.
RANDOM walk for 40000 steps (345 resets) in 1866 ms. (21 steps per ms) remains 35/69 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 35/35 properties
[2024-05-24 03:29:57] [INFO ] Invariant cache hit.
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, 35 unsolved
At refinement iteration 1 (OVERLAPS) 120/170 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 292/462 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:29:57] [INFO ] Deduced a trap composed of 50 places in 160 ms of which 3 ms to minimize.
[2024-05-24 03:29:57] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 3 ms to minimize.
[2024-05-24 03:29:58] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 3 ms to minimize.
[2024-05-24 03:29:58] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 3 ms to minimize.
[2024-05-24 03:29:58] [INFO ] Deduced a trap composed of 117 places in 135 ms of which 2 ms to minimize.
[2024-05-24 03:29:58] [INFO ] Deduced a trap composed of 96 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:29:58] [INFO ] Deduced a trap composed of 90 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:29:58] [INFO ] Deduced a trap composed of 83 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:29:58] [INFO ] Deduced a trap composed of 89 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:29:58] [INFO ] Deduced a trap composed of 100 places in 112 ms of which 2 ms to minimize.
[2024-05-24 03:29:58] [INFO ] Deduced a trap composed of 102 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:29:59] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/462 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 6 (OVERLAPS) 616/1078 variables, 462/492 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:30:00] [INFO ] Deduced a trap composed of 84 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1078 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1078 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 0/1078 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1078/1078 variables, and 493 constraints, problems are : Problem set: 0 solved, 35 unsolved in 4274 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 462/462 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 120/170 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:30:01] [INFO ] Deduced a trap composed of 53 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:30:01] [INFO ] Deduced a trap composed of 66 places in 41 ms of which 0 ms to minimize.
[2024-05-24 03:30:01] [INFO ] Deduced a trap composed of 66 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:30:01] [INFO ] Deduced a trap composed of 66 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:30:01] [INFO ] Deduced a trap composed of 55 places in 35 ms of which 1 ms to minimize.
[2024-05-24 03:30:01] [INFO ] Deduced a trap composed of 55 places in 36 ms of which 1 ms to minimize.
[2024-05-24 03:30:02] [INFO ] Deduced a trap composed of 57 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 292/462 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/462 variables, 13/38 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:30:02] [INFO ] Deduced a trap composed of 111 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:30:02] [INFO ] Deduced a trap composed of 116 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:30:02] [INFO ] Deduced a trap composed of 117 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:30:02] [INFO ] Deduced a trap composed of 98 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:30:02] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 3 ms to minimize.
[2024-05-24 03:30:02] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:30:03] [INFO ] Deduced a trap composed of 87 places in 143 ms of which 3 ms to minimize.
[2024-05-24 03:30:03] [INFO ] Deduced a trap composed of 85 places in 120 ms of which 2 ms to minimize.
[2024-05-24 03:30:03] [INFO ] Deduced a trap composed of 126 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:30:03] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:30:03] [INFO ] Deduced a trap composed of 91 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:30:03] [INFO ] Deduced a trap composed of 103 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:30:03] [INFO ] Deduced a trap composed of 106 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:30:03] [INFO ] Deduced a trap composed of 96 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:30:03] [INFO ] Deduced a trap composed of 101 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:30:03] [INFO ] Deduced a trap composed of 118 places in 117 ms of which 2 ms to minimize.
[2024-05-24 03:30:04] [INFO ] Deduced a trap composed of 108 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:30:04] [INFO ] Deduced a trap composed of 106 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:30:04] [INFO ] Deduced a trap composed of 106 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:30:04] [INFO ] Deduced a trap composed of 102 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/462 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 35 unsolved
[2024-05-24 03:30:04] [INFO ] Deduced a trap composed of 116 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:30:04] [INFO ] Deduced a trap composed of 104 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:30:04] [INFO ] Deduced a trap composed of 85 places in 138 ms of which 3 ms to minimize.
[2024-05-24 03:30:04] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:30:05] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:30:05] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:30:05] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:30:05] [INFO ] Deduced a trap composed of 124 places in 123 ms of which 3 ms to minimize.
[2024-05-24 03:30:05] [INFO ] Deduced a trap composed of 106 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:30:05] [INFO ] Deduced a trap composed of 94 places in 103 ms of which 3 ms to minimize.
[2024-05-24 03:30:05] [INFO ] Deduced a trap composed of 94 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:30:05] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:30:05] [INFO ] Deduced a trap composed of 93 places in 84 ms of which 1 ms to minimize.
[2024-05-24 03:30:06] [INFO ] Deduced a trap composed of 90 places in 115 ms of which 3 ms to minimize.
[2024-05-24 03:30:06] [INFO ] Deduced a trap composed of 102 places in 125 ms of which 3 ms to minimize.
[2024-05-24 03:30:06] [INFO ] Deduced a trap composed of 101 places in 133 ms of which 2 ms to minimize.
[2024-05-24 03:30:06] [INFO ] Deduced a trap composed of 99 places in 127 ms of which 2 ms to minimize.
SMT process timed out in 9314ms, After SMT, problems are : Problem set: 0 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 462/462 places, 616/616 transitions.
Graph (trivial) has 446 edges and 462 vertex of which 60 / 462 are part of one of the 17 SCC in 8 ms
Free SCC test removed 43 places
Drop transitions (Empty/Sink Transition effects.) removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Graph (complete) has 945 edges and 419 vertex of which 411 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.7 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 141 transitions
Trivial Post-agglo rules discarded 141 transitions
Performed 141 trivial Post agglomeration. Transition count delta: 141
Iterating post reduction 0 with 141 rules applied. Total rules applied 143 place count 411 transition count 410
Reduce places removed 141 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 154 rules applied. Total rules applied 297 place count 270 transition count 397
Reduce places removed 6 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 17 rules applied. Total rules applied 314 place count 264 transition count 386
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 326 place count 253 transition count 385
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 326 place count 253 transition count 379
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 338 place count 247 transition count 379
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 352 place count 233 transition count 350
Iterating global reduction 4 with 14 rules applied. Total rules applied 366 place count 233 transition count 350
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 368 place count 233 transition count 348
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 370 place count 231 transition count 348
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 372 place count 229 transition count 344
Iterating global reduction 6 with 2 rules applied. Total rules applied 374 place count 229 transition count 344
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 376 place count 227 transition count 342
Iterating global reduction 6 with 2 rules applied. Total rules applied 378 place count 227 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 379 place count 227 transition count 341
Performed 52 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 7 with 104 rules applied. Total rules applied 483 place count 175 transition count 287
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 487 place count 175 transition count 283
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 492 place count 170 transition count 273
Iterating global reduction 8 with 5 rules applied. Total rules applied 497 place count 170 transition count 273
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 498 place count 169 transition count 272
Iterating global reduction 8 with 1 rules applied. Total rules applied 499 place count 169 transition count 272
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 533 place count 152 transition count 391
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 547 place count 152 transition count 377
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 548 place count 151 transition count 375
Iterating global reduction 9 with 1 rules applied. Total rules applied 549 place count 151 transition count 375
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 558 place count 151 transition count 366
Free-agglomeration rule applied 17 times.
Iterating global reduction 9 with 17 rules applied. Total rules applied 575 place count 151 transition count 349
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 9 with 17 rules applied. Total rules applied 592 place count 134 transition count 349
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 597 place count 134 transition count 344
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 603 place count 134 transition count 344
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 608 place count 134 transition count 344
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 609 place count 133 transition count 343
Iterating global reduction 10 with 1 rules applied. Total rules applied 610 place count 133 transition count 343
Applied a total of 610 rules in 217 ms. Remains 133 /462 variables (removed 329) and now considering 343/616 (removed 273) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 133/462 places, 343/616 transitions.
RANDOM walk for 40000 steps (13 resets) in 727 ms. (54 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4001 steps (14 resets) in 47 ms. (83 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (10 resets) in 49 ms. (80 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 30/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4000 steps (9 resets) in 48 ms. (81 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4000 steps (10 resets) in 35 ms. (111 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4000 steps (11 resets) in 34 ms. (114 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4001 steps (15 resets) in 18 ms. (210 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4001 steps (11 resets) in 33 ms. (117 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (14 resets) in 39 ms. (100 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (12 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (10 resets) in 22 ms. (173 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (13 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (9 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (10 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (17 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (13 resets) in 28 ms. (137 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4000 steps (9 resets) in 20 ms. (190 steps per ms) remains 24/25 properties
BEST_FIRST walk for 4001 steps (14 resets) in 20 ms. (190 steps per ms) remains 23/24 properties
BEST_FIRST walk for 4000 steps (10 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (19 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (9 resets) in 31 ms. (125 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (17 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (18 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (12 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (10 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
[2024-05-24 03:30:07] [INFO ] Flow matrix only has 330 transitions (discarded 13 similar events)
// Phase 1: matrix 330 rows 133 cols
[2024-05-24 03:30:07] [INFO ] Computed 10 invariants in 4 ms
[2024-05-24 03:30:07] [INFO ] State equation strengthened by 48 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 41/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 62/132 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 329/461 variables, 132/142 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 48/190 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 2/463 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 0/463 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 191 constraints, problems are : Problem set: 0 solved, 23 unsolved in 749 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 133/133 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 41/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 0 ms to minimize.
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 62/132 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 0 ms to minimize.
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 28 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:30:08] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 45 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 38 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:30:09] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:30:10] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-24 03:30:10] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:30:10] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-24 03:30:10] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 329/461 variables, 132/175 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/461 variables, 48/223 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/461 variables, 21/244 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 2/463 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (OVERLAPS) 0/463 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 247 constraints, problems are : Problem set: 0 solved, 23 unsolved in 3687 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 133/133 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 33/33 constraints]
After SMT, in 4470ms problems are : Problem set: 0 solved, 23 unsolved
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 6 properties in 684 ms.
Support contains 21 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 343/343 transitions.
Graph (trivial) has 98 edges and 133 vertex of which 6 / 133 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 532 edges and 130 vertex of which 128 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output 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 0 with 5 rules applied. Total rules applied 7 place count 128 transition count 331
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 123 transition count 330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 122 transition count 330
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 14 place count 122 transition count 321
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 32 place count 113 transition count 321
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 40 place count 105 transition count 295
Iterating global reduction 3 with 8 rules applied. Total rules applied 48 place count 105 transition count 295
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 104 transition count 293
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 104 transition count 293
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 58 place count 100 transition count 289
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 66 place count 96 transition count 301
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 67 place count 96 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 96 transition count 299
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 69 place count 96 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 70 place count 95 transition count 298
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 74 place count 95 transition count 298
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 75 place count 94 transition count 294
Iterating global reduction 5 with 1 rules applied. Total rules applied 76 place count 94 transition count 294
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 77 place count 93 transition count 292
Iterating global reduction 5 with 1 rules applied. Total rules applied 78 place count 93 transition count 292
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 80 place count 93 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 81 place count 93 transition count 289
Applied a total of 81 rules in 61 ms. Remains 93 /133 variables (removed 40) and now considering 289/343 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 93/133 places, 289/343 transitions.
RANDOM walk for 40000 steps (4166 resets) in 1249 ms. (32 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (47 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (46 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (47 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (49 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (48 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (49 resets) in 7 ms. (500 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (44 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (45 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (43 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (47 resets) in 9 ms. (400 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (45 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (42 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (44 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (47 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (49 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (50 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 547177 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :9 out of 17
Probabilistic random walk after 547177 steps, saw 119662 distinct states, run finished after 3015 ms. (steps per millisecond=181 ) properties seen :9
[2024-05-24 03:30:15] [INFO ] Flow matrix only has 266 transitions (discarded 23 similar events)
// Phase 1: matrix 266 rows 93 cols
[2024-05-24 03:30:15] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 03:30:15] [INFO ] State equation strengthened by 55 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 84/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 266/359 variables, 93/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 55/157 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/359 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 359/359 variables, and 157 constraints, problems are : Problem set: 0 solved, 8 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 93/93 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 84/93 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-24 03:30:16] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2024-05-24 03:30:16] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-24 03:30:16] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:30:16] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-05-24 03:30:16] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-05-24 03:30:16] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-24 03:30:16] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:30:16] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2024-05-24 03:30:16] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 2 ms to minimize.
[2024-05-24 03:30:16] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-05-24 03:30:16] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 266/359 variables, 93/113 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 55/168 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/359 variables, 8/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/359 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/359 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 359/359 variables, and 176 constraints, problems are : Problem set: 0 solved, 8 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 93/93 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 11/11 constraints]
After SMT, in 1121ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 4 properties in 585 ms.
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 289/289 transitions.
Graph (trivial) has 64 edges and 93 vertex of which 5 / 93 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 90 transition count 273
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 80 transition count 272
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 22 place count 80 transition count 269
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 77 transition count 269
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 34 place count 71 transition count 259
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 71 transition count 259
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 70 transition count 253
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 70 transition count 253
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 69 transition count 249
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 69 transition count 249
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 50 place count 69 transition count 243
Performed 6 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
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 62 place count 63 transition count 230
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 82 place count 63 transition count 210
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 84 place count 61 transition count 201
Iterating global reduction 4 with 2 rules applied. Total rules applied 86 place count 61 transition count 201
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 60 transition count 197
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 60 transition count 197
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 94 place count 60 transition count 191
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 95 place count 60 transition count 190
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 98 place count 59 transition count 188
Applied a total of 98 rules in 24 ms. Remains 59 /93 variables (removed 34) and now considering 188/289 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 59/93 places, 188/289 transitions.
RANDOM walk for 40000 steps (4706 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (533 resets) in 26 ms. (1481 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (533 resets) in 32 ms. (1212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (529 resets) in 25 ms. (1538 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (532 resets) in 24 ms. (1600 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 189828 steps, run visited all 4 properties in 844 ms. (steps per millisecond=224 )
Probabilistic random walk after 189828 steps, saw 51161 distinct states, run finished after 850 ms. (steps per millisecond=223 ) properties seen :4
[2024-05-24 03:30:18] [INFO ] Flatten gal took : 23 ms
[2024-05-24 03:30:18] [INFO ] Flatten gal took : 24 ms
[2024-05-24 03:30:18] [INFO ] Input system was already deterministic with 616 transitions.
Computed a total of 120 stabilizing places and 131 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 423 transition count 567
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 423 transition count 567
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 97 place count 404 transition count 537
Iterating global reduction 0 with 19 rules applied. Total rules applied 116 place count 404 transition count 537
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 404 transition count 535
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 128 place count 394 transition count 519
Iterating global reduction 1 with 10 rules applied. Total rules applied 138 place count 394 transition count 519
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 149 place count 383 transition count 502
Iterating global reduction 1 with 11 rules applied. Total rules applied 160 place count 383 transition count 502
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 168 place count 375 transition count 487
Iterating global reduction 1 with 8 rules applied. Total rules applied 176 place count 375 transition count 487
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 183 place count 368 transition count 479
Iterating global reduction 1 with 7 rules applied. Total rules applied 190 place count 368 transition count 479
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 197 place count 361 transition count 471
Iterating global reduction 1 with 7 rules applied. Total rules applied 204 place count 361 transition count 471
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 210 place count 361 transition count 465
Applied a total of 210 rules in 37 ms. Remains 361 /462 variables (removed 101) and now considering 465/616 (removed 151) transitions.
// Phase 1: matrix 465 rows 361 cols
[2024-05-24 03:30:18] [INFO ] Computed 18 invariants in 5 ms
[2024-05-24 03:30:18] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-24 03:30:18] [INFO ] Invariant cache hit.
[2024-05-24 03:30:19] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2024-05-24 03:30:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-24 03:30:24] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:30:24] [INFO ] Deduced a trap composed of 212 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:30:24] [INFO ] Deduced a trap composed of 113 places in 109 ms of which 3 ms to minimize.
[2024-05-24 03:30:24] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:30:25] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:30:25] [INFO ] Deduced a trap composed of 52 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:30:25] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 2 ms to minimize.
[2024-05-24 03:30:25] [INFO ] Deduced a trap composed of 135 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:30:26] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:30:26] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:30:27] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:30:27] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:30:27] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:30:28] [INFO ] Deduced a trap composed of 69 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:30:28] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:30:28] [INFO ] Deduced a trap composed of 68 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:30:28] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:30:29] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:30:29] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:30:29] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-24 03:30:33] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:30:33] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 3 ms to minimize.
[2024-05-24 03:30:33] [INFO ] Deduced a trap composed of 84 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:30:33] [INFO ] Deduced a trap composed of 85 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:30:33] [INFO ] Deduced a trap composed of 91 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:30:34] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:30:34] [INFO ] Deduced a trap composed of 176 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:30:36] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:30:36] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:30:36] [INFO ] Deduced a trap composed of 66 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:30:36] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:30:36] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-24 03:30:40] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:30:41] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:30:41] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-24 03:30:43] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:30:43] [INFO ] Deduced a trap composed of 72 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:30:45] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 1 ms to minimize.
[2024-05-24 03:30:46] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/826 variables, and 57 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 39/39 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 39/57 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-24 03:30:52] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:30:52] [INFO ] Deduced a trap composed of 40 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:30:53] [INFO ] Deduced a trap composed of 72 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:30:53] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:30:53] [INFO ] Deduced a trap composed of 66 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:30:53] [INFO ] Deduced a trap composed of 68 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 464 unsolved
[2024-05-24 03:30:57] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:30:57] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:30:57] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:30:57] [INFO ] Deduced a trap composed of 53 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:30:57] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:30:57] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:30:57] [INFO ] Deduced a trap composed of 47 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:30:57] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:30:58] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:30:58] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:30:58] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:30:58] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:30:58] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:30:59] [INFO ] Deduced a trap composed of 54 places in 84 ms of which 3 ms to minimize.
[2024-05-24 03:30:59] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:30:59] [INFO ] Deduced a trap composed of 54 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:30:59] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:31:01] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 18/81 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 7 (OVERLAPS) 465/826 variables, 361/442 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/826 variables, 464/906 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/826 variables, 0/906 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/826 variables, and 906 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 63/63 constraints]
After SMT, in 60113ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Starting structural reductions in LTL mode, iteration 1 : 361/462 places, 465/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60474 ms. Remains : 361/462 places, 465/616 transitions.
[2024-05-24 03:31:19] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:31:19] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:31:19] [INFO ] Input system was already deterministic with 465 transitions.
[2024-05-24 03:31:19] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:31:19] [INFO ] Flatten gal took : 14 ms
[2024-05-24 03:31:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality15214381195604446796.gal : 7 ms
[2024-05-24 03:31:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality15308282721553782044.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/CTLCardinality15214381195604446796.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15308282721553782044.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.11486e+14,5.25659,144408,2,13108,5,443314,6,0,1911,877324,0


Converting to forward existential form...Done !
original formula: EG(AX(EG(AF(((p51==0)&&(p178==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(!(EG(!(((p51==0)&&(p178==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, t44...879
Detected timeout of ITS tools.
[2024-05-24 03:31:49] [INFO ] Flatten gal took : 21 ms
[2024-05-24 03:31:49] [INFO ] Applying decomposition
[2024-05-24 03:31:49] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph18246112556604909140.txt' '-o' '/tmp/graph18246112556604909140.bin' '-w' '/tmp/graph18246112556604909140.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph18246112556604909140.bin' '-l' '-1' '-v' '-w' '/tmp/graph18246112556604909140.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:31:49] [INFO ] Decomposing Gal with order
[2024-05-24 03:31:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:31:49] [INFO ] Removed a total of 164 redundant transitions.
[2024-05-24 03:31:49] [INFO ] Flatten gal took : 62 ms
[2024-05-24 03:31:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 14 ms.
[2024-05-24 03:31:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality9930231901019248493.gal : 77 ms
[2024-05-24 03:31:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality12067470183050018056.ctl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality9930231901019248493.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12067470183050018056.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.11486e+14,5.51264,121080,3134,200,172628,5296,918,503771,120,24395,0


Converting to forward existential form...Done !
original formula: EG(AX(EG(AF(((i2.i0.u9.p51==0)&&(i5.i2.u28.p178==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(EG(!(EG(!(((i2.i0.u9.p51==0)&&(i5.i2.u28.p178==1))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t85, t229, t416, t421, i2.t372, i2.i2.t355, i2.i2.t391, i2.i2.t392, i2.i2.u13.t357, i2.i2.u13...1832
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local 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,14.9181,318552,1,0,585338,6063,6443,1.10702e+06,637,24395,1373445
FORMULA HealthRecord-PT-17-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 435 transition count 583
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 435 transition count 583
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 65 place count 424 transition count 563
Iterating global reduction 0 with 11 rules applied. Total rules applied 76 place count 424 transition count 563
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 77 place count 424 transition count 562
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 421 transition count 558
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 421 transition count 558
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 418 transition count 553
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 418 transition count 553
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 91 place count 416 transition count 549
Iterating global reduction 1 with 2 rules applied. Total rules applied 93 place count 416 transition count 549
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 95 place count 414 transition count 547
Iterating global reduction 1 with 2 rules applied. Total rules applied 97 place count 414 transition count 547
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 99 place count 412 transition count 545
Iterating global reduction 1 with 2 rules applied. Total rules applied 101 place count 412 transition count 545
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 103 place count 412 transition count 543
Applied a total of 103 rules in 47 ms. Remains 412 /462 variables (removed 50) and now considering 543/616 (removed 73) transitions.
// Phase 1: matrix 543 rows 412 cols
[2024-05-24 03:32:04] [INFO ] Computed 18 invariants in 8 ms
[2024-05-24 03:32:05] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-24 03:32:05] [INFO ] Invariant cache hit.
[2024-05-24 03:32:05] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 542 sub problems to find dead transitions.
[2024-05-24 03:32:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-24 03:32:12] [INFO ] Deduced a trap composed of 80 places in 130 ms of which 3 ms to minimize.
[2024-05-24 03:32:12] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 3 ms to minimize.
[2024-05-24 03:32:13] [INFO ] Deduced a trap composed of 110 places in 127 ms of which 4 ms to minimize.
[2024-05-24 03:32:13] [INFO ] Deduced a trap composed of 107 places in 119 ms of which 2 ms to minimize.
[2024-05-24 03:32:13] [INFO ] Deduced a trap composed of 238 places in 126 ms of which 3 ms to minimize.
[2024-05-24 03:32:13] [INFO ] Deduced a trap composed of 140 places in 117 ms of which 2 ms to minimize.
[2024-05-24 03:32:13] [INFO ] Deduced a trap composed of 46 places in 119 ms of which 3 ms to minimize.
[2024-05-24 03:32:13] [INFO ] Deduced a trap composed of 149 places in 118 ms of which 2 ms to minimize.
[2024-05-24 03:32:14] [INFO ] Deduced a trap composed of 145 places in 119 ms of which 2 ms to minimize.
[2024-05-24 03:32:14] [INFO ] Deduced a trap composed of 78 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:32:14] [INFO ] Deduced a trap composed of 82 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:32:15] [INFO ] Deduced a trap composed of 83 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:32:15] [INFO ] Deduced a trap composed of 84 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:32:15] [INFO ] Deduced a trap composed of 84 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:32:16] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:32:16] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:32:16] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:32:17] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:32:17] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 3 ms to minimize.
[2024-05-24 03:32:17] [INFO ] Deduced a trap composed of 83 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-24 03:32:21] [INFO ] Deduced a trap composed of 144 places in 108 ms of which 3 ms to minimize.
[2024-05-24 03:32:23] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:32:23] [INFO ] Deduced a trap composed of 84 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:32:23] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:32:24] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:32:24] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:32:24] [INFO ] Deduced a trap composed of 87 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:32:24] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:32:25] [INFO ] Deduced a trap composed of 75 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:32:26] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-24 03:32:27] [INFO ] Deduced a trap composed of 102 places in 121 ms of which 2 ms to minimize.
[2024-05-24 03:32:27] [INFO ] Deduced a trap composed of 84 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:32:28] [INFO ] Deduced a trap composed of 147 places in 113 ms of which 2 ms to minimize.
[2024-05-24 03:32:29] [INFO ] Deduced a trap composed of 82 places in 103 ms of which 3 ms to minimize.
[2024-05-24 03:32:29] [INFO ] Deduced a trap composed of 106 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:32:29] [INFO ] Deduced a trap composed of 106 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:32:29] [INFO ] Deduced a trap composed of 109 places in 112 ms of which 2 ms to minimize.
[2024-05-24 03:32:30] [INFO ] Deduced a trap composed of 73 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:32:30] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:32:31] [INFO ] Deduced a trap composed of 86 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:32:31] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:32:32] [INFO ] Deduced a trap composed of 105 places in 115 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 12/60 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-24 03:32:33] [INFO ] Deduced a trap composed of 78 places in 92 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 412/955 variables, and 61 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/412 constraints, PredecessorRefiner: 542/542 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 542 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/411 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 1 (OVERLAPS) 1/412 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/412 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 542 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/412 variables, 43/61 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-24 03:32:39] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 3 ms to minimize.
[2024-05-24 03:32:39] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:32:39] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:32:39] [INFO ] Deduced a trap composed of 82 places in 141 ms of which 3 ms to minimize.
[2024-05-24 03:32:40] [INFO ] Deduced a trap composed of 81 places in 115 ms of which 3 ms to minimize.
[2024-05-24 03:32:40] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 2 ms to minimize.
[2024-05-24 03:32:40] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:32:40] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:32:40] [INFO ] Deduced a trap composed of 208 places in 124 ms of which 2 ms to minimize.
[2024-05-24 03:32:40] [INFO ] Deduced a trap composed of 102 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:32:43] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:32:43] [INFO ] Deduced a trap composed of 121 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:32:43] [INFO ] Deduced a trap composed of 78 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:32:43] [INFO ] Deduced a trap composed of 120 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:32:43] [INFO ] Deduced a trap composed of 118 places in 98 ms of which 3 ms to minimize.
[2024-05-24 03:32:44] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:32:45] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 3 ms to minimize.
[2024-05-24 03:32:45] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/412 variables, 18/79 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-24 03:32:49] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:32:50] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/412 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-24 03:32:54] [INFO ] Deduced a trap composed of 90 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:32:54] [INFO ] Deduced a trap composed of 95 places in 73 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 542 unsolved
[2024-05-24 03:32:57] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 542 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/955 variables, and 84 constraints, problems are : Problem set: 0 solved, 542 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/412 constraints, PredecessorRefiner: 0/542 constraints, Known Traps: 66/66 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 542 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 412/462 places, 543/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60553 ms. Remains : 412/462 places, 543/616 transitions.
[2024-05-24 03:33:05] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:33:05] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:33:05] [INFO ] Input system was already deterministic with 543 transitions.
[2024-05-24 03:33:05] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:33:05] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:33:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality15117696503330449904.gal : 3 ms
[2024-05-24 03:33:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality17635877557203289557.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/CTLCardinality15117696503330449904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17635877557203289557.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.70533e+14,17.9429,480416,2,36495,5,1.48739e+06,6,0,2193,3.12596e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-24 03:33:35] [INFO ] Flatten gal took : 17 ms
[2024-05-24 03:33:35] [INFO ] Applying decomposition
[2024-05-24 03:33:35] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph301196496436137019.txt' '-o' '/tmp/graph301196496436137019.bin' '-w' '/tmp/graph301196496436137019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph301196496436137019.bin' '-l' '-1' '-v' '-w' '/tmp/graph301196496436137019.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:33:35] [INFO ] Decomposing Gal with order
[2024-05-24 03:33:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:33:35] [INFO ] Removed a total of 209 redundant transitions.
[2024-05-24 03:33:35] [INFO ] Flatten gal took : 23 ms
[2024-05-24 03:33:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 5 ms.
[2024-05-24 03:33:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality15156046834522665075.gal : 4 ms
[2024-05-24 03:33:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality5837836481168069558.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/CTLCardinality15156046834522665075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5837836481168069558.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,3.70533e+14,10.0326,228784,4034,357,292490,8274,898,1.19423e+06,149,46422,0


Converting to forward existential form...Done !
original formula: (E((!((EG((i11.u87.p353!=1)) + (i22.u153.p541==0))) * A((AX((i1.u20.p81==1)) + (AX(((i11.u92.p371==0)||(i1.u20.p71==1))) * ((i1.u19.p32==...622
=> equivalent forward existential formula: ([(Init * !(E((!((EG((i11.u87.p353!=1)) + (i22.u153.p541==0))) * !((E(!(!(E(TRUE U !(E(((i1.u19.p84==0)||(i15.u1...981
Reverse transition relation is NOT exact ! Due to transitions t109, t451, t486, u38.t346, i0.t461, i1.t458, i1.t457, i1.t441, i1.t427, i1.t426, i1.t425, i1...1808
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 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
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
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 423 transition count 567
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 423 transition count 567
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 97 place count 404 transition count 538
Iterating global reduction 0 with 19 rules applied. Total rules applied 116 place count 404 transition count 538
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 118 place count 404 transition count 536
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 129 place count 393 transition count 519
Iterating global reduction 1 with 11 rules applied. Total rules applied 140 place count 393 transition count 519
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 152 place count 381 transition count 501
Iterating global reduction 1 with 12 rules applied. Total rules applied 164 place count 381 transition count 501
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 172 place count 373 transition count 486
Iterating global reduction 1 with 8 rules applied. Total rules applied 180 place count 373 transition count 486
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 186 place count 367 transition count 480
Iterating global reduction 1 with 6 rules applied. Total rules applied 192 place count 367 transition count 480
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 198 place count 361 transition count 474
Iterating global reduction 1 with 6 rules applied. Total rules applied 204 place count 361 transition count 474
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 207 place count 361 transition count 471
Applied a total of 207 rules in 47 ms. Remains 361 /462 variables (removed 101) and now considering 471/616 (removed 145) transitions.
// Phase 1: matrix 471 rows 361 cols
[2024-05-24 03:34:05] [INFO ] Computed 18 invariants in 2 ms
[2024-05-24 03:34:05] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-24 03:34:05] [INFO ] Invariant cache hit.
[2024-05-24 03:34:06] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-05-24 03:34:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-24 03:34:11] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 3 ms to minimize.
[2024-05-24 03:34:11] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:34:12] [INFO ] Deduced a trap composed of 138 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:34:12] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:34:12] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:34:12] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:34:12] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:34:13] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:34:13] [INFO ] Deduced a trap composed of 86 places in 86 ms of which 1 ms to minimize.
[2024-05-24 03:34:13] [INFO ] Deduced a trap composed of 53 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:34:13] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:34:14] [INFO ] Deduced a trap composed of 71 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:34:14] [INFO ] Deduced a trap composed of 71 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:34:14] [INFO ] Deduced a trap composed of 115 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:34:14] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2024-05-24 03:34:14] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:34:14] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:34:14] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:34:14] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:34:15] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-24 03:34:17] [INFO ] Deduced a trap composed of 113 places in 101 ms of which 3 ms to minimize.
[2024-05-24 03:34:18] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:34:18] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:34:18] [INFO ] Deduced a trap composed of 57 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:34:19] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:34:19] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 1 ms to minimize.
[2024-05-24 03:34:20] [INFO ] Deduced a trap composed of 57 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:34:20] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:34:20] [INFO ] Deduced a trap composed of 72 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:34:20] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:34:20] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:34:20] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:34:20] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:34:21] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2024-05-24 03:34:21] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:34:21] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:34:21] [INFO ] Deduced a trap composed of 80 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:34:21] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:34:21] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:34:21] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-24 03:34:22] [INFO ] Deduced a trap composed of 129 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:34:22] [INFO ] Deduced a trap composed of 168 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:34:22] [INFO ] Deduced a trap composed of 192 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:34:23] [INFO ] Deduced a trap composed of 64 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:34:23] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:34:23] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:34:23] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:34:23] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:34:24] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:34:24] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:34:24] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:34:24] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:34:25] [INFO ] Deduced a trap composed of 193 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:34:25] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 1 ms to minimize.
[2024-05-24 03:34:25] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:34:27] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-24 03:34:27] [INFO ] Deduced a trap composed of 63 places in 143 ms of which 2 ms to minimize.
[2024-05-24 03:34:28] [INFO ] Deduced a trap composed of 89 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:34:28] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 2 ms to minimize.
[2024-05-24 03:34:29] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 2 ms to minimize.
[2024-05-24 03:34:29] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:34:29] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 3 ms to minimize.
[2024-05-24 03:34:29] [INFO ] Deduced a trap composed of 69 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:34:30] [INFO ] Deduced a trap composed of 53 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:34:30] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:34:30] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:34:30] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:34:31] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:34:31] [INFO ] Deduced a trap composed of 71 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 13/87 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 361/832 variables, and 87 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 69/69 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 69/87 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 5 (OVERLAPS) 471/832 variables, 361/448 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/832 variables, 470/918 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-24 03:34:49] [INFO ] Deduced a trap composed of 67 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:34:50] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/832 variables, 2/920 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-24 03:35:01] [INFO ] Deduced a trap composed of 168 places in 113 ms of which 2 ms to minimize.
[2024-05-24 03:35:03] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 2/922 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/832 variables, and 922 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 73/73 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 361/462 places, 471/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60442 ms. Remains : 361/462 places, 471/616 transitions.
[2024-05-24 03:35:06] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:35:06] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:35:06] [INFO ] Input system was already deterministic with 471 transitions.
[2024-05-24 03:35:06] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:35:06] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:35:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality8279856699030138751.gal : 3 ms
[2024-05-24 03:35:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality11528599423882622713.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/CTLCardinality8279856699030138751.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11528599423882622713.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.12344e+14,5.34508,158964,2,15710,5,487548,6,0,1917,965135,0


Converting to forward existential form...Done !
original formula: EG(AX(((AX(AF(((p286==0)&&(p524==1)))) + (p591==0)) + (EX((p97==1)) + ((p563==1)&&(p99==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((!(EX(!(!(EG(!(((p286==0)&&(p524==1)))))))) + (p591==0)) + (EX((p97==1)) + ((p563==1)&&(p99==...174
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t32, t34, t35, t36, t37, t40, t41, t42...912
Detected timeout of ITS tools.
[2024-05-24 03:35:36] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:35:36] [INFO ] Applying decomposition
[2024-05-24 03:35:36] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14705805880306858537.txt' '-o' '/tmp/graph14705805880306858537.bin' '-w' '/tmp/graph14705805880306858537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14705805880306858537.bin' '-l' '-1' '-v' '-w' '/tmp/graph14705805880306858537.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:35:36] [INFO ] Decomposing Gal with order
[2024-05-24 03:35:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:35:36] [INFO ] Removed a total of 164 redundant transitions.
[2024-05-24 03:35:36] [INFO ] Flatten gal took : 19 ms
[2024-05-24 03:35:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 4 ms.
[2024-05-24 03:35:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality5744181846474753249.gal : 3 ms
[2024-05-24 03:35:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality5602715105926101406.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/CTLCardinality5744181846474753249.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5602715105926101406.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12344e+14,19.9873,360052,3923,233,457315,7751,806,2.0622e+06,149,35395,0


Converting to forward existential form...Done !
original formula: EG(AX(((AX(AF(((i9.u49.p286==0)&&(i21.i1.i0.u116.p524==1)))) + (i23.u129.p591==0)) + (EX((i2.u15.p97==1)) + ((i23.u129.p563==1)&&(i2.u16....167
=> equivalent forward existential formula: [FwdG(Init,!(EX(!(((!(EX(!(!(EG(!(((i9.u49.p286==0)&&(i21.i1.i0.u116.p524==1)))))))) + (i23.u129.p591==0)) + (EX...228
Reverse transition relation is NOT exact ! Due to transitions t90, t201, t233, t300, t388, t417, i1.t393, i1.t378, i1.t376, i1.t374, i1.t369, i1.t360, i1.u...1577
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Graph (trivial) has 541 edges and 462 vertex of which 81 / 462 are part of one of the 21 SCC in 1 ms
Free SCC test removed 60 places
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 69 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 182 transitions
Trivial Post-agglo rules discarded 182 transitions
Performed 182 trivial Post agglomeration. Transition count delta: 182
Iterating post reduction 0 with 182 rules applied. Total rules applied 183 place count 401 transition count 364
Reduce places removed 182 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 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 204 rules applied. Total rules applied 387 place count 219 transition count 342
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 395 place count 211 transition count 342
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 395 place count 211 transition count 337
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 405 place count 206 transition count 337
Discarding 44 places :
Symmetric choice reduction at 3 with 44 rule applications. Total rules 449 place count 162 transition count 255
Iterating global reduction 3 with 44 rules applied. Total rules applied 493 place count 162 transition count 255
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 497 place count 162 transition count 251
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 501 place count 158 transition count 251
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 510 place count 149 transition count 236
Iterating global reduction 5 with 9 rules applied. Total rules applied 519 place count 149 transition count 236
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 520 place count 149 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 521 place count 148 transition count 235
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 527 place count 142 transition count 227
Iterating global reduction 7 with 6 rules applied. Total rules applied 533 place count 142 transition count 227
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 536 place count 142 transition count 224
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 540 place count 138 transition count 219
Iterating global reduction 8 with 4 rules applied. Total rules applied 544 place count 138 transition count 219
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 547 place count 138 transition count 216
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 9 with 42 rules applied. Total rules applied 589 place count 117 transition count 195
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 9 with 6 rules applied. Total rules applied 595 place count 117 transition count 189
Discarding 9 places :
Symmetric choice reduction at 10 with 9 rule applications. Total rules 604 place count 108 transition count 171
Iterating global reduction 10 with 9 rules applied. Total rules applied 613 place count 108 transition count 171
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 619 place count 102 transition count 164
Iterating global reduction 10 with 6 rules applied. Total rules applied 625 place count 102 transition count 164
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 630 place count 97 transition count 157
Iterating global reduction 10 with 5 rules applied. Total rules applied 635 place count 97 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 638 place count 97 transition count 154
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 640 place count 95 transition count 150
Iterating global reduction 11 with 2 rules applied. Total rules applied 642 place count 95 transition count 150
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 644 place count 93 transition count 146
Iterating global reduction 11 with 2 rules applied. Total rules applied 646 place count 93 transition count 146
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 652 place count 93 transition count 140
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 654 place count 93 transition count 138
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 655 place count 93 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 656 place count 92 transition count 137
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 657 place count 91 transition count 135
Iterating global reduction 14 with 1 rules applied. Total rules applied 658 place count 91 transition count 135
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 659 place count 90 transition count 133
Iterating global reduction 14 with 1 rules applied. Total rules applied 660 place count 90 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 14 with 2 rules applied. Total rules applied 662 place count 89 transition count 132
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 663 place count 88 transition count 131
Iterating global reduction 14 with 1 rules applied. Total rules applied 664 place count 88 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 665 place count 88 transition count 130
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 666 place count 88 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 667 place count 87 transition count 129
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 668 place count 87 transition count 129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 669 place count 86 transition count 128
Applied a total of 669 rules in 61 ms. Remains 86 /462 variables (removed 376) and now considering 128/616 (removed 488) transitions.
[2024-05-24 03:36:06] [INFO ] Flow matrix only has 118 transitions (discarded 10 similar events)
// Phase 1: matrix 118 rows 86 cols
[2024-05-24 03:36:06] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 03:36:06] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 03:36:06] [INFO ] Flow matrix only has 118 transitions (discarded 10 similar events)
[2024-05-24 03:36:06] [INFO ] Invariant cache hit.
[2024-05-24 03:36:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 03:36:06] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-24 03:36:06] [INFO ] Redundant transitions in 5 ms returned []
Running 112 sub problems to find dead transitions.
[2024-05-24 03:36:06] [INFO ] Flow matrix only has 118 transitions (discarded 10 similar events)
[2024-05-24 03:36:06] [INFO ] Invariant cache hit.
[2024-05-24 03:36:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 8/86 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-24 03:36:07] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:36:07] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 117/203 variables, 86/97 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (OVERLAPS) 1/204 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/204 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/204 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 204/204 variables, and 98 constraints, problems are : Problem set: 0 solved, 112 unsolved in 2819 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 8/86 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 112 unsolved
[2024-05-24 03:36:09] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (OVERLAPS) 117/203 variables, 86/98 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/203 variables, 112/210 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 1/204 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/204 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/204 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 204/204 variables, and 211 constraints, problems are : Problem set: 0 solved, 112 unsolved in 3241 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 86/86 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 3/3 constraints]
After SMT, in 6101ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 6102ms
Starting structural reductions in SI_CTL mode, iteration 1 : 86/462 places, 128/616 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6278 ms. Remains : 86/462 places, 128/616 transitions.
[2024-05-24 03:36:12] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:36:12] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:36:12] [INFO ] Input system was already deterministic with 128 transitions.
[2024-05-24 03:36:12] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:36:12] [INFO ] Flatten gal took : 5 ms
[2024-05-24 03:36:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8508134916222181835.gal : 2 ms
[2024-05-24 03:36:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7691226234406115589.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/ReachabilityCardinality8508134916222181835.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7691226234406115589.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 ...328
Loading property file /tmp/ReachabilityCardinality7691226234406115589.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 112
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :112 after 14336
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :14336 after 1.14688e+06
RANDOM walk for 40000 steps (2371 resets) in 397 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (232 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 582 steps, run visited all 1 properties in 5 ms. (steps per millisecond=116 )
Probabilistic random walk after 582 steps, saw 475 distinct states, run finished after 6 ms. (steps per millisecond=97 ) properties seen :1
FORMULA HealthRecord-PT-17-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 422 transition count 566
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 422 transition count 566
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 100 place count 402 transition count 535
Iterating global reduction 0 with 20 rules applied. Total rules applied 120 place count 402 transition count 535
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 122 place count 402 transition count 533
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 133 place count 391 transition count 516
Iterating global reduction 1 with 11 rules applied. Total rules applied 144 place count 391 transition count 516
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 156 place count 379 transition count 498
Iterating global reduction 1 with 12 rules applied. Total rules applied 168 place count 379 transition count 498
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 176 place count 371 transition count 483
Iterating global reduction 1 with 8 rules applied. Total rules applied 184 place count 371 transition count 483
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 191 place count 364 transition count 475
Iterating global reduction 1 with 7 rules applied. Total rules applied 198 place count 364 transition count 475
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 205 place count 357 transition count 467
Iterating global reduction 1 with 7 rules applied. Total rules applied 212 place count 357 transition count 467
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 218 place count 357 transition count 461
Applied a total of 218 rules in 33 ms. Remains 357 /462 variables (removed 105) and now considering 461/616 (removed 155) transitions.
// Phase 1: matrix 461 rows 357 cols
[2024-05-24 03:36:12] [INFO ] Computed 18 invariants in 4 ms
[2024-05-24 03:36:13] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-24 03:36:13] [INFO ] Invariant cache hit.
[2024-05-24 03:36:13] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-24 03:36:13] [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:36:18] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:36:18] [INFO ] Deduced a trap composed of 176 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:36:18] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:36:18] [INFO ] Deduced a trap composed of 200 places in 97 ms of which 3 ms to minimize.
[2024-05-24 03:36:18] [INFO ] Deduced a trap composed of 192 places in 96 ms of which 3 ms to minimize.
[2024-05-24 03:36:19] [INFO ] Deduced a trap composed of 52 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:36:19] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:36:19] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:36:19] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 2 ms to minimize.
[2024-05-24 03:36:19] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:36:19] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:36:20] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:36:21] [INFO ] Deduced a trap composed of 66 places in 63 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:36:24] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:36:24] [INFO ] Deduced a trap composed of 126 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:36:25] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:36:25] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:36:25] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:36:26] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:36:26] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:36:26] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:36:26] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:36:27] [INFO ] Deduced a trap composed of 212 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:36:27] [INFO ] Deduced a trap composed of 84 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:36:27] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:36:27] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
[2024-05-24 03:36:28] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:36:28] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:36:28] [INFO ] Deduced a trap composed of 61 places in 69 ms of which 2 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:36:29] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2024-05-24 03:36:29] [INFO ] Deduced a trap composed of 40 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:36:30] [INFO ] Deduced a trap composed of 85 places in 86 ms of which 1 ms to minimize.
[2024-05-24 03:36:32] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:36:32] [INFO ] Deduced a trap composed of 88 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:36:32] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 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:36:33] [INFO ] Deduced a trap composed of 113 places in 92 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:36:40] [INFO ] Deduced a trap composed of 64 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:36:41] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-05-24 03:36:41] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:36:41] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 1 ms to minimize.
[2024-05-24 03:36:41] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:36:42] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 2 ms to minimize.
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 30015 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:36:46] [INFO ] Deduced a trap composed of 134 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:36:46] [INFO ] Deduced a trap composed of 60 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:36:47] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:36:48] [INFO ] Deduced a trap composed of 68 places in 77 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:36:50] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:36:50] [INFO ] Deduced a trap composed of 61 places in 84 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:36:55] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:36:57] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 3 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:37:04] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:37:05] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 1 ms to minimize.
[2024-05-24 03:37:09] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:37:09] [INFO ] Deduced a trap composed of 66 places in 76 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 30015 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 60091ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 357/462 places, 461/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60472 ms. Remains : 357/462 places, 461/616 transitions.
[2024-05-24 03:37:13] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:37:13] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:37:13] [INFO ] Input system was already deterministic with 461 transitions.
[2024-05-24 03:37:13] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:37:13] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:37:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality2074185159558312951.gal : 2 ms
[2024-05-24 03:37:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality591259257020123456.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/CTLCardinality2074185159558312951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality591259257020123456.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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,4.82533,144528,2,13045,5,443079,6,0,1891,876332,0


Converting to forward existential form...Done !
original formula: !(A(!(EX(AF((p6==1)))) U EF(AX((p263==1)))))
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !(EX(!((p263==1))))))) * !(!(EX(!(EG(!((p6==1)))))))) * !(E(TRUE U !(EX(!((p263==1)))))...225
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:37:43] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:37:43] [INFO ] Applying decomposition
[2024-05-24 03:37:43] [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/graph3916496241906384760.txt' '-o' '/tmp/graph3916496241906384760.bin' '-w' '/tmp/graph3916496241906384760.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3916496241906384760.bin' '-l' '-1' '-v' '-w' '/tmp/graph3916496241906384760.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:37:43] [INFO ] Decomposing Gal with order
[2024-05-24 03:37:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:37:43] [INFO ] Removed a total of 178 redundant transitions.
[2024-05-24 03:37:43] [INFO ] Flatten gal took : 19 ms
[2024-05-24 03:37:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 7 ms.
[2024-05-24 03:37:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality10269784279237930574.gal : 4 ms
[2024-05-24 03:37:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality8457492576056481391.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/CTLCardinality10269784279237930574.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8457492576056481391.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,3.8939,101676,2801,48,152765,722,864,420154,81,2557,0


Converting to forward existential form...Done !
original formula: !(A(!(EX(AF((i2.i0.u2.p6==1)))) U EF(AX((i6.i2.u42.p263==1)))))
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !(EX(!((i6.i2.u42.p263==1))))))) * !(!(EX(!(EG(!((i2.i0.u2.p6==1)))))))) * !(E(TRUE U !...264
Reverse transition relation is NOT exact ! Due to transitions t86, t412, t417, i1.i0.t355, i1.i0.t357, i1.i0.t369, i1.i0.t371, i1.i0.t373, i1.i0.t382, i1.i...1776
Fast SCC detection found an SCC at level 1
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,12.246,309444,1,0,571932,1027,6150,1.05469e+06,365,2557,1334127
FORMULA HealthRecord-PT-17-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 427 transition count 573
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 427 transition count 573
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 88 place count 409 transition count 547
Iterating global reduction 0 with 18 rules applied. Total rules applied 106 place count 409 transition count 547
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 108 place count 409 transition count 545
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 118 place count 399 transition count 530
Iterating global reduction 1 with 10 rules applied. Total rules applied 128 place count 399 transition count 530
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 136 place count 391 transition count 516
Iterating global reduction 1 with 8 rules applied. Total rules applied 144 place count 391 transition count 516
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 148 place count 387 transition count 509
Iterating global reduction 1 with 4 rules applied. Total rules applied 152 place count 387 transition count 509
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 155 place count 384 transition count 506
Iterating global reduction 1 with 3 rules applied. Total rules applied 158 place count 384 transition count 506
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 161 place count 381 transition count 503
Iterating global reduction 1 with 3 rules applied. Total rules applied 164 place count 381 transition count 503
Applied a total of 164 rules in 49 ms. Remains 381 /462 variables (removed 81) and now considering 503/616 (removed 113) transitions.
// Phase 1: matrix 503 rows 381 cols
[2024-05-24 03:37:55] [INFO ] Computed 18 invariants in 10 ms
[2024-05-24 03:37:56] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-24 03:37:56] [INFO ] Invariant cache hit.
[2024-05-24 03:37:56] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2024-05-24 03:37:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-24 03:38:01] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:38:02] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 2 ms to minimize.
[2024-05-24 03:38:02] [INFO ] Deduced a trap composed of 206 places in 125 ms of which 2 ms to minimize.
[2024-05-24 03:38:02] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:38:02] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 2 ms to minimize.
[2024-05-24 03:38:03] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:38:03] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:38:03] [INFO ] Deduced a trap composed of 120 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:38:03] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:38:03] [INFO ] Deduced a trap composed of 72 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:38:04] [INFO ] Deduced a trap composed of 73 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:38:04] [INFO ] Deduced a trap composed of 189 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 2 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 75 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 76 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 75 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:38:05] [INFO ] Deduced a trap composed of 77 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:38:06] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:38:06] [INFO ] Deduced a trap composed of 80 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-24 03:38:09] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:38:09] [INFO ] Deduced a trap composed of 139 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:38:09] [INFO ] Deduced a trap composed of 117 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:38:10] [INFO ] Deduced a trap composed of 112 places in 112 ms of which 2 ms to minimize.
[2024-05-24 03:38:10] [INFO ] Deduced a trap composed of 163 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:38:10] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 1 ms to minimize.
[2024-05-24 03:38:11] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 1 ms to minimize.
[2024-05-24 03:38:11] [INFO ] Deduced a trap composed of 75 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:38:12] [INFO ] Deduced a trap composed of 76 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:38:12] [INFO ] Deduced a trap composed of 81 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:38:12] [INFO ] Deduced a trap composed of 30 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:38:12] [INFO ] Deduced a trap composed of 79 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:38:12] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:38:13] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:38:13] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:38:13] [INFO ] Deduced a trap composed of 100 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:38:13] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:38:14] [INFO ] Deduced a trap composed of 44 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:38:14] [INFO ] Deduced a trap composed of 100 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:38:14] [INFO ] Deduced a trap composed of 100 places in 96 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-24 03:38:14] [INFO ] Deduced a trap composed of 45 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:38:14] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:38:14] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:38:15] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:38:15] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:38:15] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 2 ms to minimize.
[2024-05-24 03:38:15] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 2 ms to minimize.
[2024-05-24 03:38:15] [INFO ] Deduced a trap composed of 51 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:38:17] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:38:17] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:38:18] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-24 03:38:20] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:38:20] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
[2024-05-24 03:38:20] [INFO ] Deduced a trap composed of 76 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:38:21] [INFO ] Deduced a trap composed of 104 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:38:21] [INFO ] Deduced a trap composed of 99 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:38:23] [INFO ] Deduced a trap composed of 69 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:38:24] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:38:24] [INFO ] Deduced a trap composed of 54 places in 92 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")
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 8/77 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 381/884 variables, and 77 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/381 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/380 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/381 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 59/77 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-24 03:38:30] [INFO ] Deduced a trap composed of 56 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-24 03:38:36] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:38:36] [INFO ] Deduced a trap composed of 74 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:38:36] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 3/81 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-24 03:38:39] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:38:41] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-24 03:38:44] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-24 03:38:50] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:38:50] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (OVERLAPS) 503/884 variables, 381/467 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/884 variables, 502/969 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 884/884 variables, and 969 constraints, problems are : Problem set: 0 solved, 502 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 381/381 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 68/68 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 381/462 places, 503/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60550 ms. Remains : 381/462 places, 503/616 transitions.
[2024-05-24 03:38:56] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:38:56] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:38:56] [INFO ] Input system was already deterministic with 503 transitions.
[2024-05-24 03:38:56] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:38:56] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:38:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality12336995978411819659.gal : 2 ms
[2024-05-24 03:38:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality8047548958791536220.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/CTLCardinality12336995978411819659.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8047548958791536220.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.14977e+14,13.105,365400,2,24932,5,1.06213e+06,6,0,2029,2.409e+06,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 425 transition count 570
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 425 transition count 570
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 90 place count 409 transition count 546
Iterating global reduction 0 with 16 rules applied. Total rules applied 106 place count 409 transition count 546
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 108 place count 409 transition count 544
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 117 place count 400 transition count 529
Iterating global reduction 1 with 9 rules applied. Total rules applied 126 place count 400 transition count 529
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 136 place count 390 transition count 515
Iterating global reduction 1 with 10 rules applied. Total rules applied 146 place count 390 transition count 515
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 152 place count 384 transition count 503
Iterating global reduction 1 with 6 rules applied. Total rules applied 158 place count 384 transition count 503
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 164 place count 378 transition count 497
Iterating global reduction 1 with 6 rules applied. Total rules applied 170 place count 378 transition count 497
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 175 place count 373 transition count 492
Iterating global reduction 1 with 5 rules applied. Total rules applied 180 place count 373 transition count 492
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 182 place count 373 transition count 490
Applied a total of 182 rules in 30 ms. Remains 373 /462 variables (removed 89) and now considering 490/616 (removed 126) transitions.
// Phase 1: matrix 490 rows 373 cols
[2024-05-24 03:39:56] [INFO ] Computed 18 invariants in 8 ms
[2024-05-24 03:39:56] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-24 03:39:56] [INFO ] Invariant cache hit.
[2024-05-24 03:39:57] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Running 489 sub problems to find dead transitions.
[2024-05-24 03:39:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-24 03:40:02] [INFO ] Deduced a trap composed of 31 places in 104 ms of which 3 ms to minimize.
[2024-05-24 03:40:02] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 3 ms to minimize.
[2024-05-24 03:40:03] [INFO ] Deduced a trap composed of 88 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:40:03] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:40:03] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 5 ms to minimize.
[2024-05-24 03:40:03] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:40:05] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:40:05] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:40:05] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:40:05] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 2 ms to minimize.
[2024-05-24 03:40:05] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:40:07] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:40:07] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:40:07] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 14/32 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-24 03:40:10] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:40:11] [INFO ] Deduced a trap composed of 69 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:40:11] [INFO ] Deduced a trap composed of 76 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:40:11] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:40:11] [INFO ] Deduced a trap composed of 141 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:40:12] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:40:12] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:40:13] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:40:13] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:40:13] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:40:13] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:40:14] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 12/44 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-24 03:40:15] [INFO ] Deduced a trap composed of 138 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:40:15] [INFO ] Deduced a trap composed of 76 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:40:16] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:40:16] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:40:16] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-05-24 03:40:17] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:40:17] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:40:17] [INFO ] Deduced a trap composed of 75 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:40:17] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:40:17] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:40:18] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:40:18] [INFO ] Deduced a trap composed of 178 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:40:18] [INFO ] Deduced a trap composed of 87 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:40:19] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:40:19] [INFO ] Deduced a trap composed of 90 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-24 03:40:20] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:40:21] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:40:21] [INFO ] Deduced a trap composed of 197 places in 109 ms of which 2 ms to minimize.
[2024-05-24 03:40:21] [INFO ] Deduced a trap composed of 67 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:40:22] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 1 ms to minimize.
[2024-05-24 03:40:22] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:40:22] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:40:23] [INFO ] Deduced a trap composed of 73 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:40:23] [INFO ] Deduced a trap composed of 67 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:40:24] [INFO ] Deduced a trap composed of 82 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:40:24] [INFO ] Deduced a trap composed of 81 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:40:24] [INFO ] Deduced a trap composed of 81 places in 69 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 12/71 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/863 variables, and 71 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/373 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 489 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 53/71 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-24 03:40:30] [INFO ] Deduced a trap composed of 67 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:40:30] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:40:30] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:40:30] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:40:31] [INFO ] Deduced a trap composed of 79 places in 79 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-24 03:40:34] [INFO ] Deduced a trap composed of 142 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:40:34] [INFO ] Deduced a trap composed of 134 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-24 03:40:40] [INFO ] Deduced a trap composed of 192 places in 110 ms of which 3 ms to minimize.
[2024-05-24 03:40:40] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2024-05-24 03:40:40] [INFO ] Deduced a trap composed of 52 places in 56 ms of which 2 ms to minimize.
[2024-05-24 03:40:40] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:40:41] [INFO ] Deduced a trap composed of 54 places in 60 ms of which 2 ms to minimize.
[2024-05-24 03:40:41] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:40:42] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-24 03:40:44] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:40:44] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:40:44] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:40:44] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:40:44] [INFO ] Deduced a trap composed of 57 places in 74 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 5/90 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 9 (OVERLAPS) 490/863 variables, 373/463 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/863 variables, 489/952 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 863/863 variables, and 952 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 72/72 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 489 unsolved
Search for dead transitions found 0 dead transitions in 60104ms
Starting structural reductions in LTL mode, iteration 1 : 373/462 places, 490/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60477 ms. Remains : 373/462 places, 490/616 transitions.
[2024-05-24 03:40:57] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:40:57] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:40:57] [INFO ] Input system was already deterministic with 490 transitions.
[2024-05-24 03:40:57] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:40:57] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:40:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality14285010891453972066.gal : 2 ms
[2024-05-24 03:40:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality14034669295783980366.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/CTLCardinality14285010891453972066.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14034669295783980366.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.53438e+14,7.19831,225160,2,19183,5,644450,6,0,1984,1.476e+06,0


Converting to forward existential form...Done !
original formula: AG(((AF((p150==1)) * (EX(E(((p300==0)||(p13==1)) U (p359==1))) + (p366==1))) * (((AX(AG(((p450==0)||(p297==1)))) + EG(EF(((p327!=0)&&(p59...227
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),!((p150==1)))] = FALSE * [((FwdU(Init,TRUE) * !((p366==1))) * !(EX(E(((p300==0)||(p13==1...545
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t32, t33, t34, t37, t38, t39, t42, t43...945
Detected timeout of ITS tools.
[2024-05-24 03:41:27] [INFO ] Flatten gal took : 11 ms
[2024-05-24 03:41:27] [INFO ] Applying decomposition
[2024-05-24 03:41:27] [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/graph3686925419752170957.txt' '-o' '/tmp/graph3686925419752170957.bin' '-w' '/tmp/graph3686925419752170957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3686925419752170957.bin' '-l' '-1' '-v' '-w' '/tmp/graph3686925419752170957.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:41:27] [INFO ] Decomposing Gal with order
[2024-05-24 03:41:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:41:27] [INFO ] Removed a total of 146 redundant transitions.
[2024-05-24 03:41:27] [INFO ] Flatten gal took : 21 ms
[2024-05-24 03:41:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 5 ms.
[2024-05-24 03:41:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality16293242948071527808.gal : 4 ms
[2024-05-24 03:41:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality13420137781634366679.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/CTLCardinality16293242948071527808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13420137781634366679.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.53438e+14,2.91273,78636,2077,734,104832,16566,897,298486,221,108228,0


Converting to forward existential form...Done !
original formula: AG(((AF((i4.i0.u21.p150==1)) * (EX(E(((i9.i0.u47.p300==0)||(i2.u4.p13==1)) U (i14.i3.u74.p359==1))) + (i14.i2.u73.p366==1))) * (((AX(AG((...357
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),!((i4.i0.u21.p150==1)))] = FALSE * [((FwdU(Init,TRUE) * !((i14.i2.u73.p366==1))) * !(EX(...737
Reverse transition relation is NOT exact ! Due to transitions t93, t434, t439, i1.t410, i1.t405, i1.t404, i1.t395, i1.t393, i1.t391, i1.t379, i1.t377, i1.u...1953
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 423 transition count 567
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 423 transition count 567
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 98 place count 403 transition count 536
Iterating global reduction 0 with 20 rules applied. Total rules applied 118 place count 403 transition count 536
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 120 place count 403 transition count 534
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 131 place count 392 transition count 517
Iterating global reduction 1 with 11 rules applied. Total rules applied 142 place count 392 transition count 517
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 154 place count 380 transition count 499
Iterating global reduction 1 with 12 rules applied. Total rules applied 166 place count 380 transition count 499
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 173 place count 373 transition count 486
Iterating global reduction 1 with 7 rules applied. Total rules applied 180 place count 373 transition count 486
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 186 place count 367 transition count 480
Iterating global reduction 1 with 6 rules applied. Total rules applied 192 place count 367 transition count 480
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 198 place count 361 transition count 474
Iterating global reduction 1 with 6 rules applied. Total rules applied 204 place count 361 transition count 474
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 207 place count 361 transition count 471
Applied a total of 207 rules in 32 ms. Remains 361 /462 variables (removed 101) and now considering 471/616 (removed 145) transitions.
// Phase 1: matrix 471 rows 361 cols
[2024-05-24 03:41:57] [INFO ] Computed 18 invariants in 5 ms
[2024-05-24 03:41:57] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-24 03:41:57] [INFO ] Invariant cache hit.
[2024-05-24 03:41:57] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 470 sub problems to find dead transitions.
[2024-05-24 03:41:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-24 03:42:02] [INFO ] Deduced a trap composed of 55 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:42:03] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:42:03] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:42:03] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:42:03] [INFO ] Deduced a trap composed of 117 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:42:04] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 3 ms to minimize.
[2024-05-24 03:42:04] [INFO ] Deduced a trap composed of 116 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:42:04] [INFO ] Deduced a trap composed of 138 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:42:04] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:42:04] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:42:04] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:42:05] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:42:05] [INFO ] Deduced a trap composed of 140 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:42:05] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:42:05] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:42:06] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:42:06] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:42:06] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:42:06] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:42:06] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-24 03:42:09] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:42:09] [INFO ] Deduced a trap composed of 63 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:42:10] [INFO ] Deduced a trap composed of 41 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:42:11] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:42:11] [INFO ] Deduced a trap composed of 52 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:42:11] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:42:11] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:42:11] [INFO ] Deduced a trap composed of 53 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:42:11] [INFO ] Deduced a trap composed of 67 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:42:12] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:42:12] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:42:12] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:42:12] [INFO ] Deduced a trap composed of 71 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:42:12] [INFO ] Deduced a trap composed of 69 places in 66 ms of which 2 ms to minimize.
[2024-05-24 03:42:12] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:42:13] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:42:13] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:42:13] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:42:13] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:42:13] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-24 03:42:14] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:42:14] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:42:14] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:42:15] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:42:15] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 2 ms to minimize.
[2024-05-24 03:42:15] [INFO ] Deduced a trap composed of 69 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:42:15] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:42:16] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:42:16] [INFO ] Deduced a trap composed of 71 places in 80 ms of which 1 ms to minimize.
[2024-05-24 03:42:16] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 2 ms to minimize.
[2024-05-24 03:42:18] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:42:18] [INFO ] Deduced a trap composed of 51 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:42:18] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:42:18] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-24 03:42:19] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:42:21] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:42:21] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 3/75 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-24 03:42:26] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:42:26] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:42:27] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:42:27] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 1 ms to minimize.
[2024-05-24 03:42:27] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:42:27] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 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 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 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 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 361/832 variables, and 81 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/361 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 0 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/360 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 1 (OVERLAPS) 1/361 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/361 variables, 63/81 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-24 03:42:30] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:42:31] [INFO ] Deduced a trap composed of 213 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:42:31] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:42:32] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:42:32] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:42:33] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:42:33] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 7/88 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-24 03:42:36] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:42:38] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:42:38] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:42:38] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 7 (OVERLAPS) 471/832 variables, 361/453 constraints. Problems are: Problem set: 0 solved, 470 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 470/923 constraints. Problems are: Problem set: 0 solved, 470 unsolved
[2024-05-24 03:42:51] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/832 variables, 1/924 constraints. Problems are: Problem set: 0 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 832/832 variables, and 924 constraints, problems are : Problem set: 0 solved, 470 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 361/361 constraints, PredecessorRefiner: 470/470 constraints, Known Traps: 75/75 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 470 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 361/462 places, 471/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60417 ms. Remains : 361/462 places, 471/616 transitions.
[2024-05-24 03:42:57] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:42:57] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:42:57] [INFO ] Input system was already deterministic with 471 transitions.
[2024-05-24 03:42:57] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:42:57] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:42:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality17109598848431415096.gal : 2 ms
[2024-05-24 03:42:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality2673579544970895811.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/CTLCardinality17109598848431415096.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2673579544970895811.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.15414e+14,4.20861,138376,2,13116,5,428824,6,0,1917,835308,0


Converting to forward existential form...Done !
original formula: EG(E(EG(((EX(((p114==0)||(p279==1))) * (p322==0)) * A((p84==1) U ((p580==0)||(p562==1))))) U AG(((EF(((p427==0)||(p305==1))) * (p195!=1))...171
=> equivalent forward existential formula: [FwdG(Init,E(EG(((EX(((p114==0)||(p279==1))) * (p322==0)) * !((E(!(((p580==0)||(p562==1))) U (!((p84==1)) * !(((...305
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...894
Detected timeout of ITS tools.
[2024-05-24 03:43:28] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:43:28] [INFO ] Applying decomposition
[2024-05-24 03:43:28] [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/graph12586814899734295176.txt' '-o' '/tmp/graph12586814899734295176.bin' '-w' '/tmp/graph12586814899734295176.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12586814899734295176.bin' '-l' '-1' '-v' '-w' '/tmp/graph12586814899734295176.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:43:28] [INFO ] Decomposing Gal with order
[2024-05-24 03:43:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:43:28] [INFO ] Removed a total of 170 redundant transitions.
[2024-05-24 03:43:28] [INFO ] Flatten gal took : 16 ms
[2024-05-24 03:43:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 3 ms.
[2024-05-24 03:43:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality11733242596146294893.gal : 3 ms
[2024-05-24 03:43:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality15411199315392361986.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/CTLCardinality11733242596146294893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15411199315392361986.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.15414e+14,7.16923,157252,2550,122,194131,3105,795,906532,104,12598,0


Converting to forward existential form...Done !
original formula: EG(E(EG(((EX(((i5.u20.p114==0)||(u46.p279==1))) * (i11.u60.p322==0)) * A((i2.u6.p84==1) U ((i23.u133.p580==0)||(i23.u125.p562==1))))) U A...243
=> equivalent forward existential formula: [FwdG(Init,E(EG(((EX(((i5.u20.p114==0)||(u46.p279==1))) * (i11.u60.p322==0)) * !((E(!(((i23.u133.p580==0)||(i23....413
Reverse transition relation is NOT exact ! Due to transitions t137, t170, t301, t302, t345, t418, t423, i2.t395, i2.t394, i2.t388, i2.t379, i2.t378, i2.t37...1480
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 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 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
Fast SCC detection found an SCC at level 23
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 2
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 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
Fast SCC detection found an SCC at level 23
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 422 transition count 566
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 422 transition count 566
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 100 place count 402 transition count 535
Iterating global reduction 0 with 20 rules applied. Total rules applied 120 place count 402 transition count 535
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 122 place count 402 transition count 533
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 133 place count 391 transition count 516
Iterating global reduction 1 with 11 rules applied. Total rules applied 144 place count 391 transition count 516
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 156 place count 379 transition count 498
Iterating global reduction 1 with 12 rules applied. Total rules applied 168 place count 379 transition count 498
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 176 place count 371 transition count 483
Iterating global reduction 1 with 8 rules applied. Total rules applied 184 place count 371 transition count 483
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 191 place count 364 transition count 475
Iterating global reduction 1 with 7 rules applied. Total rules applied 198 place count 364 transition count 475
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 205 place count 357 transition count 467
Iterating global reduction 1 with 7 rules applied. Total rules applied 212 place count 357 transition count 467
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 218 place count 357 transition count 461
Applied a total of 218 rules in 38 ms. Remains 357 /462 variables (removed 105) and now considering 461/616 (removed 155) transitions.
// Phase 1: matrix 461 rows 357 cols
[2024-05-24 03:43:58] [INFO ] Computed 18 invariants in 2 ms
[2024-05-24 03:43:58] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-24 03:43:58] [INFO ] Invariant cache hit.
[2024-05-24 03:43:58] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-24 03:43:58] [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:44:03] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:44:03] [INFO ] Deduced a trap composed of 176 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:44:04] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:44:04] [INFO ] Deduced a trap composed of 200 places in 95 ms of which 3 ms to minimize.
[2024-05-24 03:44:04] [INFO ] Deduced a trap composed of 192 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:44:04] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:44:04] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:44:04] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:44:05] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 2 ms to minimize.
[2024-05-24 03:44:05] [INFO ] Deduced a trap composed of 70 places in 58 ms of which 2 ms to minimize.
[2024-05-24 03:44:05] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:44:06] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:44:06] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:44:06] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:44:06] [INFO ] Deduced a trap composed of 66 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:44:06] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:44:07] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 2 ms to minimize.
[2024-05-24 03:44:07] [INFO ] Deduced a trap composed of 65 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:44:07] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 2 ms to minimize.
[2024-05-24 03:44:07] [INFO ] Deduced a trap composed of 66 places in 68 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:44:10] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:44:10] [INFO ] Deduced a trap composed of 126 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:44:10] [INFO ] Deduced a trap composed of 64 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:44:11] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:44:11] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:44:11] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:44:11] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:44:12] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:44:12] [INFO ] Deduced a trap composed of 85 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:44:12] [INFO ] Deduced a trap composed of 212 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:44:13] [INFO ] Deduced a trap composed of 84 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:44:13] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:44:13] [INFO ] Deduced a trap composed of 69 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:44:14] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:44:14] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:44:14] [INFO ] Deduced a trap composed of 61 places in 62 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:44:14] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2024-05-24 03:44:15] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:44:15] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:44:17] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:44:17] [INFO ] Deduced a trap composed of 88 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:44:17] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 2 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:44:19] [INFO ] Deduced a trap composed of 113 places in 83 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:44:26] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:44:26] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-05-24 03:44:26] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:44:27] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:44:27] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 2 ms to minimize.
[2024-05-24 03:44:27] [INFO ] Deduced a trap composed of 70 places in 76 ms of which 1 ms to minimize.
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 30013 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:44:31] [INFO ] Deduced a trap composed of 134 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:44:31] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:44:32] [INFO ] Deduced a trap composed of 67 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:44:33] [INFO ] Deduced a trap composed of 68 places in 76 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:44:35] [INFO ] Deduced a trap composed of 61 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:44:35] [INFO ] Deduced a trap composed of 61 places in 81 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:44:40] [INFO ] Deduced a trap composed of 71 places in 66 ms of which 2 ms to minimize.
[2024-05-24 03:44:42] [INFO ] Deduced a trap composed of 72 places in 101 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:44:49] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:44:49] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:44:53] [INFO ] Deduced a trap composed of 71 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:44:53] [INFO ] Deduced a trap composed of 66 places in 74 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 30023 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 60091ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 357/462 places, 461/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60430 ms. Remains : 357/462 places, 461/616 transitions.
[2024-05-24 03:44:58] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:44:58] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:44:58] [INFO ] Input system was already deterministic with 461 transitions.
[2024-05-24 03:44:58] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:44:58] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:44:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality9200089330381521247.gal : 2 ms
[2024-05-24 03:44:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality3368207074678507404.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/CTLCardinality9200089330381521247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3368207074678507404.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.02798e+14,4.71582,144292,2,13045,5,443079,6,0,1891,876332,0


Converting to forward existential form...Done !
original formula: EF(AX(EF(AG((p300==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(E(TRUE U !(E(TRUE U !((p300==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, t44...885
(forward)formula 0,1,19.7254,513128,1,0,749,1.79528e+06,944,402,10656,2.06116e+06,934
FORMULA HealthRecord-PT-17-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 424 transition count 568
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 424 transition count 568
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 95 place count 405 transition count 538
Iterating global reduction 0 with 19 rules applied. Total rules applied 114 place count 405 transition count 538
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 116 place count 405 transition count 536
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 126 place count 395 transition count 520
Iterating global reduction 1 with 10 rules applied. Total rules applied 136 place count 395 transition count 520
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 147 place count 384 transition count 505
Iterating global reduction 1 with 11 rules applied. Total rules applied 158 place count 384 transition count 505
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 164 place count 378 transition count 493
Iterating global reduction 1 with 6 rules applied. Total rules applied 170 place count 378 transition count 493
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 176 place count 372 transition count 486
Iterating global reduction 1 with 6 rules applied. Total rules applied 182 place count 372 transition count 486
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 188 place count 366 transition count 479
Iterating global reduction 1 with 6 rules applied. Total rules applied 194 place count 366 transition count 479
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 199 place count 366 transition count 474
Applied a total of 199 rules in 36 ms. Remains 366 /462 variables (removed 96) and now considering 474/616 (removed 142) transitions.
// Phase 1: matrix 474 rows 366 cols
[2024-05-24 03:45:18] [INFO ] Computed 18 invariants in 5 ms
[2024-05-24 03:45:18] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-24 03:45:18] [INFO ] Invariant cache hit.
[2024-05-24 03:45:18] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 473 sub problems to find dead transitions.
[2024-05-24 03:45:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/366 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-05-24 03:45:24] [INFO ] Deduced a trap composed of 31 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:45:24] [INFO ] Deduced a trap composed of 134 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:45:24] [INFO ] Deduced a trap composed of 153 places in 105 ms of which 3 ms to minimize.
[2024-05-24 03:45:24] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:45:25] [INFO ] Deduced a trap composed of 51 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:45:25] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:45:25] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:45:25] [INFO ] Deduced a trap composed of 179 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:45:26] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
[2024-05-24 03:45:26] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:45:26] [INFO ] Deduced a trap composed of 89 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:45:26] [INFO ] Deduced a trap composed of 69 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:45:26] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:45:26] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:45:27] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:45:27] [INFO ] Deduced a trap composed of 70 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:45:27] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:45:27] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:45:27] [INFO ] Deduced a trap composed of 70 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:45:27] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-05-24 03:45:30] [INFO ] Deduced a trap composed of 202 places in 102 ms of which 3 ms to minimize.
[2024-05-24 03:45:30] [INFO ] Deduced a trap composed of 195 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:45:31] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 1 ms to minimize.
[2024-05-24 03:45:31] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:45:31] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:45:31] [INFO ] Deduced a trap composed of 73 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:45:31] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:45:32] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:45:32] [INFO ] Deduced a trap composed of 73 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:45:33] [INFO ] Deduced a trap composed of 79 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:45:33] [INFO ] Deduced a trap composed of 196 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:45:33] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:45:33] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:45:33] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:45:33] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:45:34] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:45:35] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:45:35] [INFO ] Deduced a trap composed of 62 places in 57 ms of which 2 ms to minimize.
[2024-05-24 03:45:35] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:45:35] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-05-24 03:45:36] [INFO ] Deduced a trap composed of 136 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:45:37] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:45:37] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:45:37] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:45:38] [INFO ] Deduced a trap composed of 54 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:45:38] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:45:38] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:45:38] [INFO ] Deduced a trap composed of 71 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:45:38] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:45:39] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:45:39] [INFO ] Deduced a trap composed of 72 places in 91 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 11/69 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-05-24 03:45:41] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:45:41] [INFO ] Deduced a trap composed of 83 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:45:42] [INFO ] Deduced a trap composed of 75 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:45:42] [INFO ] Deduced a trap composed of 76 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:45:42] [INFO ] Deduced a trap composed of 77 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:45:43] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:45:43] [INFO ] Deduced a trap composed of 72 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 7/76 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/840 variables, and 76 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/366 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 58/58 constraints]
Escalating to Integer solving :Problem set: 0 solved, 473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 1 (OVERLAPS) 1/366 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 58/76 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-05-24 03:45:51] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:45:52] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:45:55] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 2 ms to minimize.
[2024-05-24 03:45:55] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-05-24 03:45:59] [INFO ] Deduced a trap composed of 87 places in 85 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-05-24 03:46:03] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 473 unsolved
[2024-05-24 03:46:06] [INFO ] Deduced a trap composed of 135 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 9 (OVERLAPS) 474/840 variables, 366/449 constraints. Problems are: Problem set: 0 solved, 473 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/840 variables, 473/922 constraints. Problems are: Problem set: 0 solved, 473 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 840/840 variables, and 922 constraints, problems are : Problem set: 0 solved, 473 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 366/366 constraints, PredecessorRefiner: 473/473 constraints, Known Traps: 65/65 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 473 unsolved
Search for dead transitions found 0 dead transitions in 60098ms
Starting structural reductions in LTL mode, iteration 1 : 366/462 places, 474/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60403 ms. Remains : 366/462 places, 474/616 transitions.
[2024-05-24 03:46:18] [INFO ] Flatten gal took : 10 ms
[2024-05-24 03:46:18] [INFO ] Flatten gal took : 15 ms
[2024-05-24 03:46:18] [INFO ] Input system was already deterministic with 474 transitions.
[2024-05-24 03:46:18] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:46:18] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:46:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality3641344642696991599.gal : 1 ms
[2024-05-24 03:46:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality17686095398936350560.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/CTLCardinality3641344642696991599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17686095398936350560.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.30712e+14,4.6966,141988,2,13468,5,440760,6,0,1940,860689,0


Converting to forward existential form...Done !
original formula: A((AG((EX((p329==0)) + !(((p155==0)||(p441==1))))) + AX(EG(EX(((p137==0)||(p119==1)))))) U (p330==1))
=> equivalent forward existential formula: [((Init * !(EG(!((p330==1))))) * !(E(!((p330==1)) U (!((!(E(TRUE U !((EX((p329==0)) + !(((p155==0)||(p441==1))))...232
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...880
Detected timeout of ITS tools.
[2024-05-24 03:46:49] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:46:49] [INFO ] Applying decomposition
[2024-05-24 03:46:49] [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/graph17554959062471480328.txt' '-o' '/tmp/graph17554959062471480328.bin' '-w' '/tmp/graph17554959062471480328.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17554959062471480328.bin' '-l' '-1' '-v' '-w' '/tmp/graph17554959062471480328.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:46:49] [INFO ] Decomposing Gal with order
[2024-05-24 03:46:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:46:49] [INFO ] Removed a total of 191 redundant transitions.
[2024-05-24 03:46:49] [INFO ] Flatten gal took : 16 ms
[2024-05-24 03:46:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 3 ms.
[2024-05-24 03:46:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality5887306383585435258.gal : 3 ms
[2024-05-24 03:46:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality15972927866798070316.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/CTLCardinality5887306383585435258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15972927866798070316.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.30712e+14,4.55387,125376,3578,51,183928,735,795,533803,85,2817,0


Converting to forward existential form...Done !
original formula: A((AG((EX((i12.u65.p329==0)) + !(((i6.u23.p155==0)||(i18.u107.p441==1))))) + AX(EG(EX(((i6.u25.p137==0)||(i6.u22.p119==1)))))) U (i12.u69...165
=> equivalent forward existential formula: [((Init * !(EG(!((i12.u69.p330==1))))) * !(E(!((i12.u69.p330==1)) U (!((!(E(TRUE U !((EX((i12.u65.p329==0)) + !(...294
Reverse transition relation is NOT exact ! Due to transitions t85, t424, t429, i2.t400, i2.t394, i2.t385, i2.t383, i2.t381, i2.t376, i2.t367, i2.u6.t379, i...1501
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found a local 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
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,21.5969,580248,1,0,991523,740,5929,2.24651e+06,422,2817,1903399
FORMULA HealthRecord-PT-17-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Graph (trivial) has 523 edges and 462 vertex of which 74 / 462 are part of one of the 21 SCC in 1 ms
Free SCC test removed 53 places
Ensure Unique test removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 173 rules applied. Total rules applied 174 place count 408 transition count 383
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 191 rules applied. Total rules applied 365 place count 235 transition count 365
Reduce places removed 6 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 11 rules applied. Total rules applied 376 place count 229 transition count 360
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 7 rules applied. Total rules applied 383 place count 224 transition count 358
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 223 transition count 358
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 384 place count 223 transition count 353
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 394 place count 218 transition count 353
Discarding 41 places :
Symmetric choice reduction at 5 with 41 rule applications. Total rules 435 place count 177 transition count 278
Iterating global reduction 5 with 41 rules applied. Total rules applied 476 place count 177 transition count 278
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 5 with 4 rules applied. Total rules applied 480 place count 177 transition count 274
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 484 place count 173 transition count 274
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 493 place count 164 transition count 259
Iterating global reduction 7 with 9 rules applied. Total rules applied 502 place count 164 transition count 259
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 7 with 1 rules applied. Total rules applied 503 place count 164 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 504 place count 163 transition count 258
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 509 place count 158 transition count 251
Iterating global reduction 9 with 5 rules applied. Total rules applied 514 place count 158 transition count 251
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 517 place count 158 transition count 248
Discarding 4 places :
Symmetric choice reduction at 10 with 4 rule applications. Total rules 521 place count 154 transition count 243
Iterating global reduction 10 with 4 rules applied. Total rules applied 525 place count 154 transition count 243
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 10 with 3 rules applied. Total rules applied 528 place count 154 transition count 240
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 11 with 44 rules applied. Total rules applied 572 place count 132 transition count 218
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 578 place count 132 transition count 212
Discarding 9 places :
Symmetric choice reduction at 12 with 9 rule applications. Total rules 587 place count 123 transition count 194
Iterating global reduction 12 with 9 rules applied. Total rules applied 596 place count 123 transition count 194
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 602 place count 117 transition count 187
Iterating global reduction 12 with 6 rules applied. Total rules applied 608 place count 117 transition count 187
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 613 place count 112 transition count 180
Iterating global reduction 12 with 5 rules applied. Total rules applied 618 place count 112 transition count 180
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 620 place count 112 transition count 178
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 622 place count 110 transition count 174
Iterating global reduction 13 with 2 rules applied. Total rules applied 624 place count 110 transition count 174
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 626 place count 108 transition count 170
Iterating global reduction 13 with 2 rules applied. Total rules applied 628 place count 108 transition count 170
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 13 with 3 rules applied. Total rules applied 631 place count 108 transition count 167
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 635 place count 108 transition count 163
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 14 with 2 rules applied. Total rules applied 637 place count 108 transition count 161
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 15 with 3 rules applied. Total rules applied 640 place count 106 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 641 place count 105 transition count 160
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 642 place count 104 transition count 158
Iterating global reduction 17 with 1 rules applied. Total rules applied 643 place count 104 transition count 158
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 644 place count 103 transition count 156
Iterating global reduction 17 with 1 rules applied. Total rules applied 645 place count 103 transition count 156
Discarding 3 places :
Symmetric choice reduction at 17 with 3 rule applications. Total rules 648 place count 100 transition count 153
Iterating global reduction 17 with 3 rules applied. Total rules applied 651 place count 100 transition count 153
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 653 place count 99 transition count 152
Discarding 1 places :
Symmetric choice reduction at 17 with 1 rule applications. Total rules 654 place count 98 transition count 151
Iterating global reduction 17 with 1 rules applied. Total rules applied 655 place count 98 transition count 151
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 17 with 4 rules applied. Total rules applied 659 place count 98 transition count 147
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 17 with 1 rules applied. Total rules applied 660 place count 98 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 661 place count 97 transition count 146
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 19 with 6 rules applied. Total rules applied 667 place count 97 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 19 with 1 rules applied. Total rules applied 668 place count 96 transition count 145
Applied a total of 668 rules in 61 ms. Remains 96 /462 variables (removed 366) and now considering 145/616 (removed 471) transitions.
[2024-05-24 03:47:10] [INFO ] Flow matrix only has 135 transitions (discarded 10 similar events)
// Phase 1: matrix 135 rows 96 cols
[2024-05-24 03:47:10] [INFO ] Computed 9 invariants in 0 ms
[2024-05-24 03:47:10] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-24 03:47:11] [INFO ] Flow matrix only has 135 transitions (discarded 10 similar events)
[2024-05-24 03:47:11] [INFO ] Invariant cache hit.
[2024-05-24 03:47:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 03:47:11] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-24 03:47:11] [INFO ] Redundant transitions in 3 ms returned []
Running 130 sub problems to find dead transitions.
[2024-05-24 03:47:11] [INFO ] Flow matrix only has 135 transitions (discarded 10 similar events)
[2024-05-24 03:47:11] [INFO ] Invariant cache hit.
[2024-05-24 03:47:11] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 8/96 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-24 03:47:11] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-05-24 03:47:11] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 0 ms to minimize.
[2024-05-24 03:47:11] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-24 03:47:11] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2024-05-24 03:47:11] [INFO ] Deduced a trap composed of 10 places in 22 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, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (OVERLAPS) 134/230 variables, 96/110 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-24 03:47:13] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/230 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-24 03:47:13] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/230 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (OVERLAPS) 1/231 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/231 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (OVERLAPS) 0/231 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 231/231 variables, and 114 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5442 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 96/96 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (OVERLAPS) 8/96 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-24 03:47:16] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 0 ms to minimize.
[2024-05-24 03:47:16] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-05-24 03:47:17] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-24 03:47:17] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 134/230 variables, 96/116 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/230 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/230 variables, 130/247 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/230 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (OVERLAPS) 1/231 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/231 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 14 (OVERLAPS) 0/231 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 231/231 variables, and 248 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5221 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 96/96 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 11/11 constraints]
After SMT, in 10693ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 10695ms
Starting structural reductions in SI_CTL mode, iteration 1 : 96/462 places, 145/616 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10942 ms. Remains : 96/462 places, 145/616 transitions.
[2024-05-24 03:47:21] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:47:21] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:47:21] [INFO ] Input system was already deterministic with 145 transitions.
[2024-05-24 03:47:21] [INFO ] Flatten gal took : 3 ms
[2024-05-24 03:47:21] [INFO ] Flatten gal took : 4 ms
[2024-05-24 03:47:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality6246967120893140219.gal : 1 ms
[2024-05-24 03:47:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality15163106675491947327.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/CTLCardinality6246967120893140219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15163106675491947327.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.58822e+09,0.485144,24376,2,4592,5,95998,6,0,516,98390,0


Converting to forward existential form...Done !
original formula: EF(((AF(EG((p527==0))) * E((p115==1) U (((p564!=0)&&(p320==1)) * E(((p175==0)||(p141==1)) U (p188==1))))) * ((p319==0)||(p336==1))))
=> equivalent forward existential formula: [(FwdU((FwdU(((FwdU(Init,TRUE) * ((p319==0)||(p336==1))) * !(EG(!(EG((p527==0)))))),(p115==1)) * ((p564!=0)&&(p3...210
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t12, t16, t18, t20, t63, t69, t73, t75, t76, t78, t84, t85, t86,...345
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 143/0/2
Hit Full ! (commute/partial/dont) 140/0/5
(forward)formula 0,1,10.867,364276,1,0,553,2.26012e+06,324,253,3760,2.19049e+06,627
FORMULA HealthRecord-PT-17-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 427 transition count 573
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 427 transition count 573
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 87 place count 410 transition count 546
Iterating global reduction 0 with 17 rules applied. Total rules applied 104 place count 410 transition count 546
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 105 place count 410 transition count 545
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 115 place count 400 transition count 529
Iterating global reduction 1 with 10 rules applied. Total rules applied 125 place count 400 transition count 529
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 136 place count 389 transition count 514
Iterating global reduction 1 with 11 rules applied. Total rules applied 147 place count 389 transition count 514
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 153 place count 383 transition count 502
Iterating global reduction 1 with 6 rules applied. Total rules applied 159 place count 383 transition count 502
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 165 place count 377 transition count 495
Iterating global reduction 1 with 6 rules applied. Total rules applied 171 place count 377 transition count 495
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 175 place count 373 transition count 491
Iterating global reduction 1 with 4 rules applied. Total rules applied 179 place count 373 transition count 491
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 180 place count 373 transition count 490
Applied a total of 180 rules in 30 ms. Remains 373 /462 variables (removed 89) and now considering 490/616 (removed 126) transitions.
// Phase 1: matrix 490 rows 373 cols
[2024-05-24 03:47:32] [INFO ] Computed 18 invariants in 5 ms
[2024-05-24 03:47:32] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-24 03:47:32] [INFO ] Invariant cache hit.
[2024-05-24 03:47:33] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 489 sub problems to find dead transitions.
[2024-05-24 03:47:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-24 03:47:38] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 3 ms to minimize.
[2024-05-24 03:47:38] [INFO ] Deduced a trap composed of 137 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:47:38] [INFO ] Deduced a trap composed of 139 places in 109 ms of which 3 ms to minimize.
[2024-05-24 03:47:38] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:47:39] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:47:39] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 3 ms to minimize.
[2024-05-24 03:47:39] [INFO ] Deduced a trap composed of 75 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:47:39] [INFO ] Deduced a trap composed of 43 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:47:39] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 3 ms to minimize.
[2024-05-24 03:47:39] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:47:40] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:47:40] [INFO ] Deduced a trap composed of 198 places in 101 ms of which 3 ms to minimize.
[2024-05-24 03:47:40] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:47:41] [INFO ] Deduced a trap composed of 67 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:47:42] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:47:42] [INFO ] Deduced a trap composed of 68 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:47:42] [INFO ] Deduced a trap composed of 70 places in 86 ms of which 1 ms to minimize.
[2024-05-24 03:47:42] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 2 ms to minimize.
[2024-05-24 03:47:42] [INFO ] Deduced a trap composed of 75 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:47:42] [INFO ] Deduced a trap composed of 70 places in 80 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, 489 unsolved
[2024-05-24 03:47:45] [INFO ] Deduced a trap composed of 154 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:47:45] [INFO ] Deduced a trap composed of 131 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:47:46] [INFO ] Deduced a trap composed of 87 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:47:46] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:47:46] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:47:47] [INFO ] Deduced a trap composed of 136 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:47:47] [INFO ] Deduced a trap composed of 114 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:47:48] [INFO ] Deduced a trap composed of 86 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:47:48] [INFO ] Deduced a trap composed of 87 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:47:48] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:47:48] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:47:48] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:47:48] [INFO ] Deduced a trap composed of 66 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:47:49] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:47:49] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:47:49] [INFO ] Deduced a trap composed of 81 places in 57 ms of which 2 ms to minimize.
[2024-05-24 03:47:49] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 2 ms to minimize.
[2024-05-24 03:47:50] [INFO ] Deduced a trap composed of 79 places in 60 ms of which 2 ms to minimize.
[2024-05-24 03:47:50] [INFO ] Deduced a trap composed of 76 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:47:50] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 20/58 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-24 03:47:52] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 1 ms to minimize.
[2024-05-24 03:47:52] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:47:52] [INFO ] Deduced a trap composed of 83 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:47:52] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:47:52] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:47:53] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 2 ms to minimize.
[2024-05-24 03:47:53] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 2 ms to minimize.
[2024-05-24 03:47:53] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:47:53] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:47:53] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 2 ms to minimize.
[2024-05-24 03:47:53] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:47:53] [INFO ] Deduced a trap composed of 75 places in 66 ms of which 2 ms to minimize.
[2024-05-24 03:47:54] [INFO ] Deduced a trap composed of 82 places in 67 ms of which 2 ms to minimize.
[2024-05-24 03:47:54] [INFO ] Deduced a trap composed of 79 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:47:54] [INFO ] Deduced a trap composed of 74 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:47:55] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-24 03:47:59] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:47:59] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 2 ms to minimize.
[2024-05-24 03:47:59] [INFO ] Deduced a trap composed of 51 places in 94 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 373/863 variables, and 77 constraints, problems are : Problem set: 0 solved, 489 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: 489/489 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 489 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/372 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 1 (OVERLAPS) 1/373 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/373 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/373 variables, 59/77 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-24 03:48:08] [INFO ] Deduced a trap composed of 65 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:48:09] [INFO ] Deduced a trap composed of 78 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/373 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-24 03:48:11] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:48:12] [INFO ] Deduced a trap composed of 96 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:48:12] [INFO ] Deduced a trap composed of 76 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:48:13] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/373 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-24 03:48:17] [INFO ] Deduced a trap composed of 71 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:48:17] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:48:18] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/373 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 489 unsolved
[2024-05-24 03:48:20] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:48:20] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-05-24 03:48:21] [INFO ] Deduced a trap composed of 75 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/373 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/373 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 9 (OVERLAPS) 490/863 variables, 373/462 constraints. Problems are: Problem set: 0 solved, 489 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/863 variables, 489/951 constraints. Problems are: Problem set: 0 solved, 489 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 863/863 variables, and 951 constraints, problems are : Problem set: 0 solved, 489 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 373/373 constraints, PredecessorRefiner: 489/489 constraints, Known Traps: 71/71 constraints]
After SMT, in 60106ms problems are : Problem set: 0 solved, 489 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 373/462 places, 490/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60413 ms. Remains : 373/462 places, 490/616 transitions.
[2024-05-24 03:48:33] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:48:33] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:48:33] [INFO ] Input system was already deterministic with 490 transitions.
[2024-05-24 03:48:33] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:48:33] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:48:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality9683342441384979460.gal : 2 ms
[2024-05-24 03:48:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality105576398478431878.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/CTLCardinality9683342441384979460.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality105576398478431878.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
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.60447e+14,6.81583,218724,2,16988,5,694515,6,0,1984,1.35356e+06,0


Converting to forward existential form...Done !
original formula: EF(((EF(((p405==0)&&(p104==1))) + EG(((p151!=0)&&(p127!=1)))) + ((!(E((p18==1) U (p155==1))) * ((p70==1)||(p241==1))) + (AX((p419==1)) * ...193
=> equivalent forward existential formula: (([(FwdU(FwdU(Init,TRUE),TRUE) * ((p405==0)&&(p104==1)))] != FALSE + [FwdG(FwdU(Init,TRUE),((p151!=0)&&(p127!=1)...349
(forward)formula 0,1,7.07951,218724,1,0,7,694515,9,1,3455,1.35356e+06,3
FORMULA HealthRecord-PT-17-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 425 transition count 569
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 425 transition count 569
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 92 place count 407 transition count 543
Iterating global reduction 0 with 18 rules applied. Total rules applied 110 place count 407 transition count 543
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 112 place count 407 transition count 541
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 123 place count 396 transition count 524
Iterating global reduction 1 with 11 rules applied. Total rules applied 134 place count 396 transition count 524
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 145 place count 385 transition count 507
Iterating global reduction 1 with 11 rules applied. Total rules applied 156 place count 385 transition count 507
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 163 place count 378 transition count 494
Iterating global reduction 1 with 7 rules applied. Total rules applied 170 place count 378 transition count 494
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 176 place count 372 transition count 488
Iterating global reduction 1 with 6 rules applied. Total rules applied 182 place count 372 transition count 488
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 188 place count 366 transition count 482
Iterating global reduction 1 with 6 rules applied. Total rules applied 194 place count 366 transition count 482
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 197 place count 366 transition count 479
Applied a total of 197 rules in 31 ms. Remains 366 /462 variables (removed 96) and now considering 479/616 (removed 137) transitions.
// Phase 1: matrix 479 rows 366 cols
[2024-05-24 03:48:40] [INFO ] Computed 18 invariants in 6 ms
[2024-05-24 03:48:40] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-24 03:48:40] [INFO ] Invariant cache hit.
[2024-05-24 03:48:40] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 478 sub problems to find dead transitions.
[2024-05-24 03:48:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (OVERLAPS) 1/366 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-24 03:48:45] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:48:46] [INFO ] Deduced a trap composed of 137 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:48:46] [INFO ] Deduced a trap composed of 85 places in 108 ms of which 2 ms to minimize.
[2024-05-24 03:48:46] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:48:46] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:48:46] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-05-24 03:48:47] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:48:47] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 3 ms to minimize.
[2024-05-24 03:48:47] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:48:47] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-05-24 03:48:47] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:48:47] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:48:48] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:48:48] [INFO ] Deduced a trap composed of 70 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:48:48] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:48:48] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:48:48] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:48:48] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:48:48] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:48:48] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-24 03:48:52] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:48:52] [INFO ] Deduced a trap composed of 116 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:48:52] [INFO ] Deduced a trap composed of 138 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:48:53] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-24 03:48:53] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 5 ms to minimize.
[2024-05-24 03:48:53] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 3 ms to minimize.
[2024-05-24 03:48:53] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:48:53] [INFO ] Deduced a trap composed of 52 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:48:53] [INFO ] Deduced a trap composed of 135 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:48:53] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:48:53] [INFO ] Deduced a trap composed of 65 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:48:54] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:48:54] [INFO ] Deduced a trap composed of 82 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:48:54] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:48:54] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:48:55] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 1 ms to minimize.
[2024-05-24 03:48:55] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:48:55] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 18/56 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-24 03:48:57] [INFO ] Deduced a trap composed of 141 places in 99 ms of which 2 ms to minimize.
[2024-05-24 03:48:57] [INFO ] Deduced a trap composed of 117 places in 93 ms of which 3 ms to minimize.
[2024-05-24 03:48:58] [INFO ] Deduced a trap composed of 191 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:48:58] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:48:58] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-05-24 03:48:59] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:48:59] [INFO ] Deduced a trap composed of 91 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:48:59] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:49:00] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:49:00] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 1 ms to minimize.
[2024-05-24 03:49:00] [INFO ] Deduced a trap composed of 66 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:49:00] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:49:00] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 1 ms to minimize.
[2024-05-24 03:49:00] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:49:00] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:49:00] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:49:01] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:49:01] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 18/74 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-24 03:49:02] [INFO ] Deduced a trap composed of 212 places in 105 ms of which 2 ms to minimize.
[2024-05-24 03:49:04] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 2 ms to minimize.
[2024-05-24 03:49:05] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-24 03:49:10] [INFO ] Deduced a trap composed of 139 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 366/845 variables, and 78 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/366 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 478 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/365 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 1 (OVERLAPS) 1/366 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/366 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/366 variables, 60/78 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-24 03:49:13] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:49:14] [INFO ] Deduced a trap composed of 109 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:49:14] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:49:15] [INFO ] Deduced a trap composed of 54 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:49:15] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:49:16] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:49:16] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 7/85 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-24 03:49:19] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:49:19] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 7 (OVERLAPS) 479/845 variables, 366/453 constraints. Problems are: Problem set: 0 solved, 478 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/845 variables, 478/931 constraints. Problems are: Problem set: 0 solved, 478 unsolved
[2024-05-24 03:49:29] [INFO ] Deduced a trap composed of 135 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:49:32] [INFO ] Deduced a trap composed of 85 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:49:33] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/845 variables, 3/934 constraints. Problems are: Problem set: 0 solved, 478 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 845/845 variables, and 934 constraints, problems are : Problem set: 0 solved, 478 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 366/366 constraints, PredecessorRefiner: 478/478 constraints, Known Traps: 72/72 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 478 unsolved
Search for dead transitions found 0 dead transitions in 60101ms
Starting structural reductions in LTL mode, iteration 1 : 366/462 places, 479/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60383 ms. Remains : 366/462 places, 479/616 transitions.
[2024-05-24 03:49:40] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:49:40] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:49:40] [INFO ] Input system was already deterministic with 479 transitions.
[2024-05-24 03:49:40] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:49:40] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:49:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality4121176395246631166.gal : 2 ms
[2024-05-24 03:49:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality3094217612734709246.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/CTLCardinality4121176395246631166.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3094217612734709246.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.23554e+14,5.18259,166964,2,15629,5,497035,6,0,1945,1.02939e+06,0


Converting to forward existential form...Done !
original formula: EF((((p147==1) * AX(((p386==0)&&(p165==1)))) * (p178==0)))
=> equivalent forward existential formula: [(((FwdU(Init,TRUE) * (p178==0)) * (p147==1)) * !(EX(!(((p386==0)&&(p165==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, t44...936
(forward)formula 0,0,23.6266,596872,1,0,782,2.09739e+06,977,417,10564,2.65202e+06,967
FORMULA HealthRecord-PT-17-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 422 transition count 566
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 422 transition count 566
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 100 place count 402 transition count 535
Iterating global reduction 0 with 20 rules applied. Total rules applied 120 place count 402 transition count 535
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 122 place count 402 transition count 533
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 133 place count 391 transition count 516
Iterating global reduction 1 with 11 rules applied. Total rules applied 144 place count 391 transition count 516
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 156 place count 379 transition count 498
Iterating global reduction 1 with 12 rules applied. Total rules applied 168 place count 379 transition count 498
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 176 place count 371 transition count 483
Iterating global reduction 1 with 8 rules applied. Total rules applied 184 place count 371 transition count 483
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 191 place count 364 transition count 475
Iterating global reduction 1 with 7 rules applied. Total rules applied 198 place count 364 transition count 475
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 205 place count 357 transition count 467
Iterating global reduction 1 with 7 rules applied. Total rules applied 212 place count 357 transition count 467
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 218 place count 357 transition count 461
Applied a total of 218 rules in 29 ms. Remains 357 /462 variables (removed 105) and now considering 461/616 (removed 155) transitions.
// Phase 1: matrix 461 rows 357 cols
[2024-05-24 03:50:04] [INFO ] Computed 18 invariants in 3 ms
[2024-05-24 03:50:04] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-24 03:50:04] [INFO ] Invariant cache hit.
[2024-05-24 03:50:04] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-24 03:50:04] [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:50:09] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:50:10] [INFO ] Deduced a trap composed of 176 places in 104 ms of which 2 ms to minimize.
[2024-05-24 03:50:10] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:50:10] [INFO ] Deduced a trap composed of 200 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:50:10] [INFO ] Deduced a trap composed of 192 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:50:10] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:50:11] [INFO ] Deduced a trap composed of 70 places in 96 ms of which 2 ms to minimize.
[2024-05-24 03:50:11] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:50:11] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:50:11] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:50:11] [INFO ] Deduced a trap composed of 64 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:50:12] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2024-05-24 03:50:12] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:50:13] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:50:13] [INFO ] Deduced a trap composed of 66 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:50:13] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:50:13] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 2 ms to minimize.
[2024-05-24 03:50:13] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:50:13] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 2 ms to minimize.
[2024-05-24 03:50:13] [INFO ] Deduced a trap composed of 66 places in 62 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:50:16] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:50:16] [INFO ] Deduced a trap composed of 126 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:50:16] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:50:17] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 2 ms to minimize.
[2024-05-24 03:50:17] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 1 ms to minimize.
[2024-05-24 03:50:17] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:50:17] [INFO ] Deduced a trap composed of 73 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:50:18] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:50:18] [INFO ] Deduced a trap composed of 85 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:50:18] [INFO ] Deduced a trap composed of 212 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:50:18] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:50:19] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:50:19] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:50:20] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 2 ms to minimize.
[2024-05-24 03:50:20] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2024-05-24 03:50:20] [INFO ] Deduced a trap composed of 61 places in 60 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:50:20] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:50:20] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:50:21] [INFO ] Deduced a trap composed of 85 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:50:23] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 3 ms to minimize.
[2024-05-24 03:50:23] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 1 ms to minimize.
[2024-05-24 03:50:23] [INFO ] Deduced a trap composed of 65 places in 72 ms of which 2 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:50:25] [INFO ] Deduced a trap composed of 113 places in 95 ms of which 1 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:50:31] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:50:32] [INFO ] Deduced a trap composed of 74 places in 81 ms of which 1 ms to minimize.
[2024-05-24 03:50:32] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:50:32] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:50:32] [INFO ] Deduced a trap composed of 70 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:50:33] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/357 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 460 unsolved
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 30015 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:50:37] [INFO ] Deduced a trap composed of 134 places in 100 ms of which 2 ms to minimize.
[2024-05-24 03:50:37] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:50:38] [INFO ] Deduced a trap composed of 67 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:50:40] [INFO ] Deduced a trap composed of 68 places in 76 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:50:41] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 1 ms to minimize.
[2024-05-24 03:50:41] [INFO ] Deduced a trap composed of 61 places in 85 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:50:46] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 2 ms to minimize.
[2024-05-24 03:50:49] [INFO ] Deduced a trap composed of 72 places in 97 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:50:55] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 2 ms to minimize.
[2024-05-24 03:50:55] [INFO ] Deduced a trap composed of 71 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:50:59] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:50:59] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 2 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 30013 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 60083ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60087ms
Starting structural reductions in LTL mode, iteration 1 : 357/462 places, 461/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60373 ms. Remains : 357/462 places, 461/616 transitions.
[2024-05-24 03:51:05] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:51:05] [INFO ] Flatten gal took : 12 ms
[2024-05-24 03:51:05] [INFO ] Input system was already deterministic with 461 transitions.
[2024-05-24 03:51:05] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:51:05] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:51:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality13093531349050138254.gal : 2 ms
[2024-05-24 03:51:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality13920259648823649993.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/CTLCardinality13093531349050138254.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13920259648823649993.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,4.2432,144400,2,13045,5,443079,6,0,1891,876332,0


Converting to forward existential form...Done !
original formula: EX(AG((p514==0)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((p514==0)))))] != 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:51:35] [INFO ] Flatten gal took : 9 ms
[2024-05-24 03:51:35] [INFO ] Applying decomposition
[2024-05-24 03:51:35] [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/graph1400799026876821681.txt' '-o' '/tmp/graph1400799026876821681.bin' '-w' '/tmp/graph1400799026876821681.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1400799026876821681.bin' '-l' '-1' '-v' '-w' '/tmp/graph1400799026876821681.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:51:35] [INFO ] Decomposing Gal with order
[2024-05-24 03:51:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:51:35] [INFO ] Removed a total of 177 redundant transitions.
[2024-05-24 03:51:35] [INFO ] Flatten gal took : 25 ms
[2024-05-24 03:51:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 4 ms.
[2024-05-24 03:51:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality9108308226032778440.gal : 7 ms
[2024-05-24 03:51:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality8779864663435095002.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/CTLCardinality9108308226032778440.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8779864663435095002.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.02798e+14,1.32853,48496,1879,46,73221,490,900,172404,76,1339,0


Converting to forward existential form...Done !
original formula: EX(AG((i19.i1.u117.p514==0)))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !((i19.i1.u117.p514==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t197, t412, t417, i1.i1.t355, i1.i1.t364, i1.i1.t369, i1.i1.t371, i1.i1.t373, i1.i1.t382, i1....1787
(forward)formula 0,0,14.9073,407272,1,0,646219,580,6218,1.24177e+06,348,1339,1398118
FORMULA HealthRecord-PT-17-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 423 transition count 567
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 423 transition count 567
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 97 place count 404 transition count 537
Iterating global reduction 0 with 19 rules applied. Total rules applied 116 place count 404 transition count 537
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 404 transition count 536
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 128 place count 393 transition count 519
Iterating global reduction 1 with 11 rules applied. Total rules applied 139 place count 393 transition count 519
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 151 place count 381 transition count 501
Iterating global reduction 1 with 12 rules applied. Total rules applied 163 place count 381 transition count 501
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 171 place count 373 transition count 486
Iterating global reduction 1 with 8 rules applied. Total rules applied 179 place count 373 transition count 486
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 186 place count 366 transition count 478
Iterating global reduction 1 with 7 rules applied. Total rules applied 193 place count 366 transition count 478
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 199 place count 360 transition count 471
Iterating global reduction 1 with 6 rules applied. Total rules applied 205 place count 360 transition count 471
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 210 place count 360 transition count 466
Applied a total of 210 rules in 28 ms. Remains 360 /462 variables (removed 102) and now considering 466/616 (removed 150) transitions.
// Phase 1: matrix 466 rows 360 cols
[2024-05-24 03:51:50] [INFO ] Computed 18 invariants in 4 ms
[2024-05-24 03:51:50] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-24 03:51:50] [INFO ] Invariant cache hit.
[2024-05-24 03:51:50] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2024-05-24 03:51:50] [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:51:55] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:51:55] [INFO ] Deduced a trap composed of 177 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:51:55] [INFO ] Deduced a trap composed of 107 places in 94 ms of which 2 ms to minimize.
[2024-05-24 03:51:56] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:51:56] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:51:56] [INFO ] Deduced a trap composed of 57 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:51:56] [INFO ] Deduced a trap composed of 51 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:51:56] [INFO ] Deduced a trap composed of 40 places in 84 ms of which 1 ms to minimize.
[2024-05-24 03:51:56] [INFO ] Deduced a trap composed of 195 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:51:56] [INFO ] Deduced a trap composed of 70 places in 89 ms of which 3 ms to minimize.
[2024-05-24 03:51:57] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-05-24 03:51:57] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:51:57] [INFO ] Deduced a trap composed of 77 places in 51 ms of which 1 ms to minimize.
[2024-05-24 03:51:57] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:51:57] [INFO ] Deduced a trap composed of 68 places in 53 ms of which 1 ms to minimize.
[2024-05-24 03:51:58] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:51:58] [INFO ] Deduced a trap composed of 69 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:51:58] [INFO ] Deduced a trap composed of 71 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:51:58] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:51:58] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/360 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:52:03] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:52:03] [INFO ] Deduced a trap composed of 86 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:52:03] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:52:03] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:52:03] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 2 ms to minimize.
[2024-05-24 03:52:03] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:52:04] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:52:04] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:52:04] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
[2024-05-24 03:52:04] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:52:04] [INFO ] Deduced a trap composed of 72 places in 79 ms of which 1 ms to minimize.
[2024-05-24 03:52:05] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 1 ms to minimize.
[2024-05-24 03:52:05] [INFO ] Deduced a trap composed of 61 places in 60 ms of which 2 ms to minimize.
[2024-05-24 03:52:05] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:52:06] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:52:08] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2024-05-24 03:52:08] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:52:09] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:52:09] [INFO ] Deduced a trap composed of 66 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:52:10] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:52:10] [INFO ] Deduced a trap composed of 134 places in 88 ms of which 2 ms to minimize.
[2024-05-24 03:52:10] [INFO ] Deduced a trap composed of 112 places in 92 ms of which 2 ms to minimize.
[2024-05-24 03:52:12] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:52:12] [INFO ] Deduced a trap composed of 69 places in 73 ms of which 1 ms to minimize.
[2024-05-24 03:52:12] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 2 ms to minimize.
[2024-05-24 03:52:13] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:52:18] [INFO ] Deduced a trap composed of 52 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:52:18] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-05-24 03:52:18] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2024-05-24 03:52:18] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2024-05-24 03:52:18] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/826 variables, and 69 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30012 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: 51/51 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, 51/69 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:52:23] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 1 ms to minimize.
[2024-05-24 03:52:25] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:52:27] [INFO ] Deduced a trap composed of 67 places in 78 ms of which 2 ms to minimize.
[2024-05-24 03:52:27] [INFO ] Deduced a trap composed of 113 places in 76 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 7 (OVERLAPS) 466/826 variables, 360/433 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/826 variables, 465/898 constraints. Problems are: Problem set: 0 solved, 465 unsolved
[2024-05-24 03:52:41] [INFO ] Deduced a trap composed of 66 places in 85 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/826 variables, 1/899 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 826/826 variables, and 899 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30012 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: 56/56 constraints]
After SMT, in 60090ms problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 360/462 places, 466/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60382 ms. Remains : 360/462 places, 466/616 transitions.
[2024-05-24 03:52:50] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:52:50] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:52:50] [INFO ] Input system was already deterministic with 466 transitions.
[2024-05-24 03:52:50] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:52:50] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:52:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality14962104646900100329.gal : 2 ms
[2024-05-24 03:52:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality18349199903543884392.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/CTLCardinality14962104646900100329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18349199903543884392.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.09776e+14,4.21935,144388,2,13060,5,443156,6,0,1908,876032,0


Converting to forward existential form...Done !
original formula: EX(EX((EG(AX((p42==0))) + (EG(EF(((p169==0)||(p556==1)))) * AF((p19==0))))))
=> equivalent forward existential formula: ([FwdG(EY(EY(Init)),!(EX(!((p42==0)))))] != FALSE + [((EY(EY(Init)) * EG(E(TRUE U ((p169==0)||(p556==1))))) * !(...183
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...891
Detected timeout of ITS tools.
[2024-05-24 03:53:20] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:53:20] [INFO ] Applying decomposition
[2024-05-24 03:53:20] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14684147821460997048.txt' '-o' '/tmp/graph14684147821460997048.bin' '-w' '/tmp/graph14684147821460997048.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14684147821460997048.bin' '-l' '-1' '-v' '-w' '/tmp/graph14684147821460997048.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:53:20] [INFO ] Decomposing Gal with order
[2024-05-24 03:53:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:53:20] [INFO ] Removed a total of 174 redundant transitions.
[2024-05-24 03:53:20] [INFO ] Flatten gal took : 13 ms
[2024-05-24 03:53:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 3 ms.
[2024-05-24 03:53:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality5550638656809093037.gal : 2 ms
[2024-05-24 03:53:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality17421285651968952794.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/CTLCardinality5550638656809093037.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17421285651968952794.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.09776e+14,2.10004,72280,2342,110,110728,1073,934,319356,116,5341,0


Converting to forward existential form...Done !
original formula: EX(EX((EG(AX((i2.i0.u8.p42==0))) + (EG(EF(((i5.i0.u27.p169==0)||(i23.i2.u127.p556==1)))) * AF((i2.i0.u6.p19==0))))))
=> equivalent forward existential formula: ([FwdG(EY(EY(Init)),!(EX(!((i2.i0.u8.p42==0)))))] != FALSE + [((EY(EY(Init)) * EG(E(TRUE U ((i5.i0.u27.p169==0)|...223
Reverse transition relation is NOT exact ! Due to transitions t85, t417, t422, i2.i0.t355, i2.i0.t365, i2.i0.t370, i2.i0.t372, i2.i0.t374, i2.i0.t375, i2.i...1837
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 462/462 places, 616/616 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 422 transition count 566
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 422 transition count 566
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 100 place count 402 transition count 535
Iterating global reduction 0 with 20 rules applied. Total rules applied 120 place count 402 transition count 535
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 122 place count 402 transition count 533
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 133 place count 391 transition count 516
Iterating global reduction 1 with 11 rules applied. Total rules applied 144 place count 391 transition count 516
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 156 place count 379 transition count 498
Iterating global reduction 1 with 12 rules applied. Total rules applied 168 place count 379 transition count 498
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 176 place count 371 transition count 483
Iterating global reduction 1 with 8 rules applied. Total rules applied 184 place count 371 transition count 483
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 191 place count 364 transition count 475
Iterating global reduction 1 with 7 rules applied. Total rules applied 198 place count 364 transition count 475
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 205 place count 357 transition count 467
Iterating global reduction 1 with 7 rules applied. Total rules applied 212 place count 357 transition count 467
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 218 place count 357 transition count 461
Applied a total of 218 rules in 36 ms. Remains 357 /462 variables (removed 105) and now considering 461/616 (removed 155) transitions.
// Phase 1: matrix 461 rows 357 cols
[2024-05-24 03:53:50] [INFO ] Computed 18 invariants in 4 ms
[2024-05-24 03:53:50] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-24 03:53:50] [INFO ] Invariant cache hit.
[2024-05-24 03:53:51] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2024-05-24 03:53:51] [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:53:56] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 2 ms to minimize.
[2024-05-24 03:53:56] [INFO ] Deduced a trap composed of 176 places in 90 ms of which 2 ms to minimize.
[2024-05-24 03:53:56] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:53:56] [INFO ] Deduced a trap composed of 200 places in 91 ms of which 3 ms to minimize.
[2024-05-24 03:53:56] [INFO ] Deduced a trap composed of 192 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:53:57] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 2 ms to minimize.
[2024-05-24 03:53:57] [INFO ] Deduced a trap composed of 70 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:53:57] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:53:57] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 2 ms to minimize.
[2024-05-24 03:53:57] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2024-05-24 03:53:57] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:53:58] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 2 ms to minimize.
[2024-05-24 03:53:59] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:53:59] [INFO ] Deduced a trap composed of 64 places in 55 ms of which 1 ms to minimize.
[2024-05-24 03:53:59] [INFO ] Deduced a trap composed of 66 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:53:59] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 2 ms to minimize.
[2024-05-24 03:53:59] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 2 ms to minimize.
[2024-05-24 03:53:59] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:53:59] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
[2024-05-24 03:53:59] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 2 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:54:02] [INFO ] Deduced a trap composed of 40 places in 95 ms of which 2 ms to minimize.
[2024-05-24 03:54:02] [INFO ] Deduced a trap composed of 126 places in 87 ms of which 2 ms to minimize.
[2024-05-24 03:54:03] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 1 ms to minimize.
[2024-05-24 03:54:03] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 1 ms to minimize.
[2024-05-24 03:54:03] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 1 ms to minimize.
[2024-05-24 03:54:04] [INFO ] Deduced a trap composed of 70 places in 69 ms of which 1 ms to minimize.
[2024-05-24 03:54:04] [INFO ] Deduced a trap composed of 73 places in 61 ms of which 2 ms to minimize.
[2024-05-24 03:54:04] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 1 ms to minimize.
[2024-05-24 03:54:04] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 1 ms to minimize.
[2024-05-24 03:54:04] [INFO ] Deduced a trap composed of 212 places in 76 ms of which 1 ms to minimize.
[2024-05-24 03:54:05] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:54:05] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 2 ms to minimize.
[2024-05-24 03:54:05] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 2 ms to minimize.
[2024-05-24 03:54:06] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2024-05-24 03:54:06] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2024-05-24 03:54:06] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 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:54:07] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-05-24 03:54:07] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-24 03:54:07] [INFO ] Deduced a trap composed of 85 places in 85 ms of which 2 ms to minimize.
[2024-05-24 03:54:09] [INFO ] Deduced a trap composed of 60 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:54:09] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:54:09] [INFO ] Deduced a trap composed of 65 places in 66 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:54:11] [INFO ] Deduced a trap composed of 113 places in 79 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:54:18] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2024-05-24 03:54:18] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 2 ms to minimize.
[2024-05-24 03:54:18] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 1 ms to minimize.
[2024-05-24 03:54:18] [INFO ] Deduced a trap composed of 69 places in 67 ms of which 1 ms to minimize.
[2024-05-24 03:54:19] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-05-24 03:54:19] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 1 ms to minimize.
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 30013 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:54:24] [INFO ] Deduced a trap composed of 134 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:54:24] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 2 ms to minimize.
[2024-05-24 03:54:24] [INFO ] Deduced a trap composed of 67 places in 86 ms of which 1 ms to minimize.
[2024-05-24 03:54:26] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 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:54:28] [INFO ] Deduced a trap composed of 61 places in 95 ms of which 1 ms to minimize.
[2024-05-24 03:54:28] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 1 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:54:32] [INFO ] Deduced a trap composed of 71 places in 68 ms of which 2 ms to minimize.
[2024-05-24 03:54:34] [INFO ] Deduced a trap composed of 72 places in 90 ms of which 1 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:54:41] [INFO ] Deduced a trap composed of 73 places in 82 ms of which 2 ms to minimize.
[2024-05-24 03:54:41] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 2 ms to minimize.
[2024-05-24 03:54:45] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 2 ms to minimize.
[2024-05-24 03:54:45] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 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 30015 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 60081ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 357/462 places, 461/616 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60402 ms. Remains : 357/462 places, 461/616 transitions.
[2024-05-24 03:54:51] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:54:51] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:54:51] [INFO ] Input system was already deterministic with 461 transitions.
[2024-05-24 03:54:51] [INFO ] Flatten gal took : 6 ms
[2024-05-24 03:54:51] [INFO ] Flatten gal took : 7 ms
[2024-05-24 03:54:51] [INFO ] Time to serialize gal into /tmp/CTLCardinality6109550283898720698.gal : 2 ms
[2024-05-24 03:54:51] [INFO ] Time to serialize properties into /tmp/CTLCardinality16135407405848999965.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/CTLCardinality6109550283898720698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16135407405848999965.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.02798e+14,4.2109,144556,2,13045,5,443079,6,0,1891,876332,0


Converting to forward existential form...Done !
original formula: AX(FALSE)
=> equivalent forward existential formula: [(EY(Init) * !(FALSE))] = FALSE
(forward)formula 0,0,4.24646,144556,1,0,6,443079,7,1,2219,876332,1
FORMULA HealthRecord-PT-17-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2024-05-24 03:54:55] [INFO ] Flatten gal took : 14 ms
[2024-05-24 03:54:55] [INFO ] Flatten gal took : 8 ms
[2024-05-24 03:54:55] [INFO ] Applying decomposition
[2024-05-24 03:54:55] [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/graph14016488579249735149.txt' '-o' '/tmp/graph14016488579249735149.bin' '-w' '/tmp/graph14016488579249735149.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14016488579249735149.bin' '-l' '-1' '-v' '-w' '/tmp/graph14016488579249735149.weights' '-q' '0' '-e' '0.001'
[2024-05-24 03:54:55] [INFO ] Decomposing Gal with order
[2024-05-24 03:54:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 03:54:55] [INFO ] Removed a total of 219 redundant transitions.
[2024-05-24 03:54:55] [INFO ] Flatten gal took : 18 ms
[2024-05-24 03:54:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 5 ms.
[2024-05-24 03:54:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality500849264069465714.gal : 3 ms
[2024-05-24 03:54:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality758136690833316511.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/CTLCardinality500849264069465714.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality758136690833316511.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 -...260
No direction supplied, using forward translation only.
Parsed 6 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.27111e+14,51.1306,1090908,9492,1540,1.21096e+06,54209,1240,5.4727e+06,260,526906,0


Converting to forward existential form...Done !
original formula: (E((!((EG((i11.i2.u99.p353!=1)) + (i24.i1.u162.p541==0))) * A((AX((i0.i0.u16.p81==1)) + (AX(((i11.i3.u105.p371==0)||(i0.i0.u16.p71==1))) ...692
=> equivalent forward existential formula: ([(Init * !(E((!((EG((i11.i2.u99.p353!=1)) + (i24.i1.u162.p541==0))) * !((E(!(!(E(TRUE U !(E(((i0.i0.u16.p84==0)...1075
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t364, t382, t386, t443, t444, t552, u48.t374, u72.t300, u110.t198, u121.t167, i0.i0...2655
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found 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
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-24 04:01:45] [INFO ] Applying decomposition
[2024-05-24 04:01:45] [INFO ] Flatten gal took : 9 ms
[2024-05-24 04:01:45] [INFO ] Decomposing Gal with order
[2024-05-24 04:01:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:01:45] [INFO ] Removed a total of 52 redundant transitions.
[2024-05-24 04:01:45] [INFO ] Flatten gal took : 14 ms
[2024-05-24 04:01:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 100 labels/synchronizations in 3 ms.
[2024-05-24 04:01:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality16539659884112485141.gal : 2 ms
[2024-05-24 04:01:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality5208764194056143670.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/CTLCardinality16539659884112485141.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5208764194056143670.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 6 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.27111e+14,6.66071,240352,1882,7928,275777,133297,615,1.22759e+06,765,1.13577e+06,0


Converting to forward existential form...Done !
original formula: (E((!((EG((i0.i1.i0.i0.u13.p353!=1)) + (i1.u18.p541==0))) * A((AX((i0.i0.i0.u4.p81==1)) + (AX(((i0.i1.i0.i0.u13.p371==0)||(i0.i0.i0.u4.p7...721
=> equivalent forward existential formula: ([(Init * !(E((!((EG((i0.i1.i0.i0.u13.p353!=1)) + (i1.u18.p541==0))) * !((E(!(!(E(TRUE U !(E(((i0.i0.i0.u4.p84==...1118
Reverse transition relation is NOT exact ! Due to transitions t552, i0.i0.u6.t314, i0.i0.u6.t316, i0.i0.u6.t317, i0.i0.u6.t323, i0.i0.u6.t324, i0.i0.u6.t32...3154
ITS-tools command line returned an error code 137
[2024-05-24 04:14:17] [INFO ] Flatten gal took : 16 ms
[2024-05-24 04:14:17] [INFO ] Input system was already deterministic with 616 transitions.
[2024-05-24 04:14:17] [INFO ] Transformed 462 places.
[2024-05-24 04:14:17] [INFO ] Transformed 616 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:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality16002149933554270958.gal : 2 ms
[2024-05-24 04:14:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality13795867631422483303.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/CTLCardinality16002149933554270958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13795867631422483303.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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 6 CTL formulae.
ITS-tools command line returned an error code 137
Total runtime 3267273 ms.

BK_STOP 1716524631705

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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="CTLCardinality"
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 CTLCardinality"
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-171640604300825"
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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;