About the Execution of ITS-Tools for DoubleExponent-PT-020
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16205.067 | 3600000.00 | 4466338.00 | 9313.50 | TF???????????T?? | normal |
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.r136-tall-171631132900561.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 DoubleExponent-PT-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132900561
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 340K 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 DoubleExponent-PT-020-CTLCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-020-CTLCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-020-CTLCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-020-CTLCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-020-CTLCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-020-CTLCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-020-CTLCardinality-2024-06
FORMULA_NAME DoubleExponent-PT-020-CTLCardinality-2024-07
FORMULA_NAME DoubleExponent-PT-020-CTLCardinality-2024-08
FORMULA_NAME DoubleExponent-PT-020-CTLCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-020-CTLCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-020-CTLCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-020-CTLCardinality-2023-12
FORMULA_NAME DoubleExponent-PT-020-CTLCardinality-2023-13
FORMULA_NAME DoubleExponent-PT-020-CTLCardinality-2023-14
FORMULA_NAME DoubleExponent-PT-020-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716393296239
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 15:54:57] [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-22 15:54:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 15:54:57] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-22 15:54:57] [INFO ] Transformed 1064 places.
[2024-05-22 15:54:57] [INFO ] Transformed 998 transitions.
[2024-05-22 15:54:57] [INFO ] Parsed PT model containing 1064 places and 998 transitions and 2814 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 139 out of 1064 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1064/1064 places, 998/998 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1060 transition count 998
Applied a total of 4 rules in 147 ms. Remains 1060 /1064 variables (removed 4) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1060 cols
[2024-05-22 15:54:58] [INFO ] Invariants computation overflowed in 139 ms
[2024-05-22 15:54:58] [INFO ] Implicit Places using invariants in 621 ms returned []
// Phase 1: matrix 998 rows 1060 cols
[2024-05-22 15:54:58] [INFO ] Invariants computation overflowed in 85 ms
[2024-05-22 15:55:16] [INFO ] Implicit Places using invariants and state equation in 17840 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 18504 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1059/1064 places, 998/998 transitions.
Applied a total of 0 rules in 78 ms. Remains 1059 /1059 variables (removed 0) and now considering 998/998 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18743 ms. Remains : 1059/1064 places, 998/998 transitions.
Support contains 139 out of 1059 places after structural reductions.
[2024-05-22 15:55:16] [INFO ] Flatten gal took : 104 ms
[2024-05-22 15:55:16] [INFO ] Flatten gal took : 55 ms
[2024-05-22 15:55:16] [INFO ] Input system was already deterministic with 998 transitions.
RANDOM walk for 40000 steps (1329 resets) in 1428 ms. (27 steps per ms) remains 87/88 properties
BEST_FIRST walk for 4001 steps (113 resets) in 65 ms. (60 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (107 resets) in 166 ms. (23 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (111 resets) in 45 ms. (86 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (108 resets) in 50 ms. (78 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (114 resets) in 35 ms. (111 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (112 resets) in 43 ms. (90 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (112 resets) in 54 ms. (72 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (110 resets) in 44 ms. (88 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (111 resets) in 37 ms. (105 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (112 resets) in 56 ms. (70 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (107 resets) in 40 ms. (97 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (108 resets) in 38 ms. (102 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (106 resets) in 37 ms. (105 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (119 resets) in 56 ms. (70 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (108 resets) in 70 ms. (56 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (112 resets) in 45 ms. (86 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (119 resets) in 54 ms. (72 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (113 resets) in 56 ms. (70 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (108 resets) in 31 ms. (125 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4002 steps (105 resets) in 46 ms. (85 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (115 resets) in 42 ms. (93 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (115 resets) in 45 ms. (86 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (117 resets) in 50 ms. (78 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4000 steps (111 resets) in 32 ms. (121 steps per ms) remains 87/87 properties
BEST_FIRST walk for 4001 steps (110 resets) in 74 ms. (53 steps per ms) remains 85/87 properties
BEST_FIRST walk for 4001 steps (112 resets) in 55 ms. (71 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (104 resets) in 44 ms. (88 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (120 resets) in 43 ms. (90 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4002 steps (112 resets) in 53 ms. (74 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (110 resets) in 51 ms. (76 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (109 resets) in 67 ms. (58 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (113 resets) in 37 ms. (105 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (113 resets) in 36 ms. (108 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4002 steps (112 resets) in 37 ms. (105 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (110 resets) in 62 ms. (63 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (109 resets) in 42 ms. (93 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (108 resets) in 31 ms. (125 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (115 resets) in 35 ms. (111 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (110 resets) in 30 ms. (129 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (114 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4002 steps (114 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (115 resets) in 30 ms. (129 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (122 resets) in 51 ms. (76 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (113 resets) in 33 ms. (117 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (120 resets) in 33 ms. (117 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (113 resets) in 32 ms. (121 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (109 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (111 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (113 resets) in 31 ms. (125 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (113 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (115 resets) in 28 ms. (137 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (110 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (112 resets) in 28 ms. (137 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (106 resets) in 43 ms. (90 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (109 resets) in 34 ms. (114 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (113 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (113 resets) in 31 ms. (125 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (108 resets) in 30 ms. (129 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (113 resets) in 36 ms. (108 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (112 resets) in 32 ms. (121 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (104 resets) in 32 ms. (121 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (107 resets) in 31 ms. (125 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (112 resets) in 30 ms. (129 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (113 resets) in 41 ms. (95 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4002 steps (112 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (109 resets) in 28 ms. (137 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (114 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (113 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (111 resets) in 28 ms. (137 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (104 resets) in 31 ms. (125 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (110 resets) in 30 ms. (129 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4000 steps (116 resets) in 29 ms. (133 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (115 resets) in 28 ms. (137 steps per ms) remains 85/85 properties
BEST_FIRST walk for 4001 steps (104 resets) in 27 ms. (142 steps per ms) remains 85/85 properties
Interrupted probabilistic random walk after 118256 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :4 out of 85
Probabilistic random walk after 118256 steps, saw 59142 distinct states, run finished after 3005 ms. (steps per millisecond=39 ) properties seen :4
// Phase 1: matrix 998 rows 1059 cols
[2024-05-22 15:55:21] [INFO ] Computed 100 invariants in 116 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 752/882 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/882 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 6/888 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 56/944 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/944 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 973/1917 variables, 944/1044 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 (/ 17.0 16.0))
(s10 0.0)
(s11 0.0)
(s12 (/ 15.0 16.0))
(s13 0.0)
(s14 0.0)
(s15 (/ 1.0 8.0))
(s16 (/ 1.0 16.0))
(s17 0.0)
(s18 0.0)
(s20 0.0)
(s22 0.0)
(s24 0.0)
(s29 (/ 15.0 16.0))
(s32 1.0)
(s33 0.0)
(s34 1.0)
(s37 0.0)
(s39 (/ 3.0 32.0))
(s41 (/ 3.0 32.0))
(s42 (/ 1.0 16.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 (/ 15.0 16.0))
(s55 0.0)
(s56 0.0)
(s57 (/ 1.0 16.0))
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 (/ 31.0 32.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 (/ 17.0 16.0))
(s72 0.0)
(s73 (/ 17.0 16.0))
(s74 (/ 17.0 16.0))
(s75 0.0)
(s76 0.0)
(s78 0.0)
(s80 0.0)
(s82 (/ 1.0 16.0))
(s83 0.0)
(s84 1.0)
(s86 0.0)
(s88 (/ 1.0 16.0))
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 (/ 1.0 16.0))
(s104 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 1.0)
(s134 0.0)
(s136 0.0)
(s138 0.0)
(s139 0.0)
(s141 (/ 1.0 16.0))
(s142 0.0)
(s144 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 (/ 1.0 16.0))
(s169 (/ 17.0 16.0))
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 (/ 17.0 16.0))
(s192 1.0)
(s193 0.0)
(s194 (/ 17.0 16.0))
(s196 0.0)
(s198 0.0)
(s200 1.0)
(s201 0.0)
(s202 (/ 9.0 8.0))
(s203 0.0)
(s206 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 (/ 17.0 16.0))
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 (/ 17.0 8.0))
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)timeout
(s240 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1917/2057 variables, and 1044 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 944/1059 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (OVERLAPS) 752/882 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/882 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 6/888 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/888 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 56/944 variables, 11/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/944 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 973/1917 variables, 944/1044 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1917 variables, 58/1102 constraints. Problems are: Problem set: 0 solved, 81 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1917/2057 variables, and 1102 constraints, problems are : Problem set: 0 solved, 81 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 944/1059 constraints, PredecessorRefiner: 58/81 constraints, Known Traps: 0/0 constraints]
After SMT, in 10222ms problems are : Problem set: 0 solved, 81 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 130 out of 1059 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 135 rules applied. Total rules applied 135 place count 1059 transition count 863
Reduce places removed 135 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 165 rules applied. Total rules applied 300 place count 924 transition count 833
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 330 place count 894 transition count 833
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 330 place count 894 transition count 799
Deduced a syphon composed of 34 places in 7 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 398 place count 860 transition count 799
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 20 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 252 rules applied. Total rules applied 650 place count 734 transition count 673
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 23 places in 14 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 696 place count 711 transition count 673
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 697 place count 711 transition count 672
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 698 place count 710 transition count 672
Free-agglomeration rule (complex) applied 87 times.
Iterating global reduction 4 with 87 rules applied. Total rules applied 785 place count 710 transition count 585
Reduce places removed 87 places and 0 transitions.
Iterating post reduction 4 with 87 rules applied. Total rules applied 872 place count 623 transition count 585
Partial Free-agglomeration rule applied 74 times.
Drop transitions (Partial Free agglomeration) removed 74 transitions
Iterating global reduction 5 with 74 rules applied. Total rules applied 946 place count 623 transition count 585
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 947 place count 622 transition count 584
Applied a total of 947 rules in 304 ms. Remains 622 /1059 variables (removed 437) and now considering 584/998 (removed 414) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 622/1059 places, 584/998 transitions.
RANDOM walk for 40000 steps (4593 resets) in 658 ms. (60 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (313 resets) in 29 ms. (133 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (302 resets) in 42 ms. (93 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (311 resets) in 45 ms. (86 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (308 resets) in 43 ms. (90 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (322 resets) in 37 ms. (105 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (326 resets) in 52 ms. (75 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (322 resets) in 42 ms. (93 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (312 resets) in 31 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (316 resets) in 30 ms. (129 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (327 resets) in 29 ms. (133 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (321 resets) in 28 ms. (137 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (313 resets) in 30 ms. (129 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (306 resets) in 28 ms. (137 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (297 resets) in 27 ms. (142 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (315 resets) in 30 ms. (129 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (315 resets) in 28 ms. (137 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (312 resets) in 51 ms. (76 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (334 resets) in 43 ms. (90 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (327 resets) in 34 ms. (114 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (305 resets) in 31 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (302 resets) in 30 ms. (129 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (314 resets) in 30 ms. (129 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (317 resets) in 39 ms. (100 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (303 resets) in 39 ms. (100 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (308 resets) in 44 ms. (88 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (318 resets) in 34 ms. (114 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (302 resets) in 31 ms. (125 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (305 resets) in 58 ms. (67 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (314 resets) in 38 ms. (102 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (303 resets) in 39 ms. (100 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (319 resets) in 48 ms. (81 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (313 resets) in 33 ms. (117 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (310 resets) in 32 ms. (121 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (318 resets) in 33 ms. (117 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (324 resets) in 33 ms. (117 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (310 resets) in 45 ms. (86 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (307 resets) in 38 ms. (102 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (326 resets) in 44 ms. (88 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (302 resets) in 37 ms. (105 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (310 resets) in 38 ms. (102 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (326 resets) in 34 ms. (114 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (323 resets) in 51 ms. (76 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (308 resets) in 35 ms. (111 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (326 resets) in 35 ms. (111 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (320 resets) in 41 ms. (95 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (317 resets) in 52 ms. (75 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (323 resets) in 32 ms. (121 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4001 steps (325 resets) in 32 ms. (121 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4000 steps (304 resets) in 33 ms. (117 steps per ms) remains 81/81 properties
BEST_FIRST walk for 4002 steps (314 resets) in 34 ms. (114 steps per ms) remains 81/81 properties
Interrupted probabilistic random walk after 128469 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :1 out of 81
Probabilistic random walk after 128469 steps, saw 64571 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :1
// Phase 1: matrix 584 rows 622 cols
[2024-05-22 15:55:36] [INFO ] Invariants computation overflowed in 70 ms
[2024-05-22 15:55:36] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 359/487 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 615/1102 variables, 402/533 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1102 variables, 40/573 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1102 variables, 0/573 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 103/1205 variables, 91/664 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1205 variables, 2/666 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1205 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp78 is UNSAT
At refinement iteration 10 (OVERLAPS) 1/1206 variables, 1/667 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1206 variables, 0/667 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 0/1206 variables, 0/667 constraints. Problems are: Problem set: 14 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1206/1206 variables, and 667 constraints, problems are : Problem set: 14 solved, 66 unsolved in 25536 ms.
Refiners :[State Equation: 622/622 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 14 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 314/422 variables, 108/108 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 2/110 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/422 variables, 2/112 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/422 variables, 0/112 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 620/1042 variables, 379/491 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1042 variables, 36/527 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1042 variables, 63/590 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1042 variables, 0/590 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 159/1201 variables, 131/721 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1201 variables, 7/728 constraints. Problems are: Problem set: 14 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1201 variables, 1/729 constraints. Problems are: Problem set: 14 solved, 66 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1201/1206 variables, and 729 constraints, problems are : Problem set: 14 solved, 66 unsolved in 45017 ms.
Refiners :[State Equation: 618/622 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 66/80 constraints, Known Traps: 0/0 constraints]
After SMT, in 70661ms problems are : Problem set: 14 solved, 66 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 584/584 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 622 transition count 582
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 620 transition count 582
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 620 transition count 580
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 618 transition count 580
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 28 place count 608 transition count 570
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 607 transition count 570
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 607 transition count 569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 606 transition count 569
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 38 place count 606 transition count 563
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 44 place count 600 transition count 563
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 47 place count 600 transition count 563
Applied a total of 47 rules in 98 ms. Remains 600 /622 variables (removed 22) and now considering 563/584 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 600/622 places, 563/584 transitions.
RANDOM walk for 40000 steps (5044 resets) in 371 ms. (107 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (358 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (338 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (355 resets) in 34 ms. (114 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (343 resets) in 25 ms. (153 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (357 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (339 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (341 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (332 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (331 resets) in 22 ms. (173 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (311 resets) in 21 ms. (181 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (347 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (317 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (354 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (342 resets) in 22 ms. (173 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (335 resets) in 22 ms. (174 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (342 resets) in 22 ms. (174 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (348 resets) in 27 ms. (142 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (358 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (358 resets) in 22 ms. (173 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (375 resets) in 22 ms. (173 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (327 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (320 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (330 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (338 resets) in 22 ms. (173 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (333 resets) in 21 ms. (181 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (343 resets) in 20 ms. (190 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (329 resets) in 22 ms. (174 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (331 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (355 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (339 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (337 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (336 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (342 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (335 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (342 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (344 resets) in 22 ms. (174 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (310 resets) in 21 ms. (181 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (328 resets) in 21 ms. (181 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (334 resets) in 32 ms. (121 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (345 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (324 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (333 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4003 steps (346 resets) in 22 ms. (174 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (332 resets) in 22 ms. (173 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (333 resets) in 24 ms. (160 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4000 steps (344 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (339 resets) in 22 ms. (173 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4002 steps (345 resets) in 28 ms. (138 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4001 steps (345 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
BEST_FIRST walk for 4004 steps (337 resets) in 23 ms. (166 steps per ms) remains 66/66 properties
Interrupted probabilistic random walk after 181927 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 66
Probabilistic random walk after 181927 steps, saw 91500 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
// Phase 1: matrix 563 rows 600 cols
[2024-05-22 15:56:50] [INFO ] Invariants computation overflowed in 89 ms
[2024-05-22 15:56:50] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 319/427 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/427 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 605/1032 variables, 378/489 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1032 variables, 36/525 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1032 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 130/1162 variables, 113/638 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1162 variables, 6/644 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1162 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (OVERLAPS) 1/1163 variables, 1/645 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1163 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (OVERLAPS) 0/1163 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 645 constraints, problems are : Problem set: 0 solved, 66 unsolved in 32215 ms.
Refiners :[State Equation: 600/600 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 319/427 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/427 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/427 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/427 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 605/1032 variables, 378/491 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1032 variables, 36/527 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1032 variables, 63/590 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1032 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 130/1162 variables, 113/703 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1162 variables, 6/709 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1162 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1162 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 13 (OVERLAPS) 1/1163 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 711 constraints, problems are : Problem set: 0 solved, 66 unsolved in 75018 ms.
Refiners :[State Equation: 600/600 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 107345ms problems are : Problem set: 0 solved, 66 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 563/563 transitions.
Applied a total of 0 rules in 15 ms. Remains 600 /600 variables (removed 0) and now considering 563/563 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 600/600 places, 563/563 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 600/600 places, 563/563 transitions.
Applied a total of 0 rules in 13 ms. Remains 600 /600 variables (removed 0) and now considering 563/563 (removed 0) transitions.
// Phase 1: matrix 563 rows 600 cols
[2024-05-22 15:58:38] [INFO ] Invariants computation overflowed in 56 ms
[2024-05-22 15:58:38] [INFO ] Implicit Places using invariants in 293 ms returned []
// Phase 1: matrix 563 rows 600 cols
[2024-05-22 15:58:38] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-22 15:58:38] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 15:58:49] [INFO ] Implicit Places using invariants and state equation in 10876 ms returned [32, 60, 66, 87, 94, 119, 124, 148, 154, 179, 185, 210, 216, 243, 251, 261, 279, 284, 312, 318, 414, 421, 489, 522, 529, 554, 562, 566, 597]
[2024-05-22 15:58:49] [INFO ] Actually due to overlaps returned [261, 216, 529, 312, 414, 522, 185, 210, 318, 421]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 11175 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 590/600 places, 563/563 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 590 transition count 561
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 588 transition count 561
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 588 transition count 561
Applied a total of 7 rules in 39 ms. Remains 588 /590 variables (removed 2) and now considering 561/563 (removed 2) transitions.
// Phase 1: matrix 561 rows 588 cols
[2024-05-22 15:58:49] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-22 15:58:49] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 561 rows 588 cols
[2024-05-22 15:58:49] [INFO ] Invariants computation overflowed in 56 ms
[2024-05-22 15:58:50] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 15:59:02] [INFO ] Implicit Places using invariants and state equation in 12339 ms returned [32, 60, 66, 87, 94, 119, 124, 148, 154, 179, 239, 247, 273, 278, 479, 542, 550, 554, 585]
[2024-05-22 15:59:02] [INFO ] Actually due to overlaps returned [554, 247, 550, 479, 239, 542]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 12622 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 582/600 places, 561/563 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 582 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 581 transition count 560
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 581 transition count 560
Applied a total of 5 rules in 38 ms. Remains 581 /582 variables (removed 1) and now considering 560/561 (removed 1) transitions.
// Phase 1: matrix 560 rows 581 cols
[2024-05-22 15:59:02] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 15:59:02] [INFO ] Implicit Places using invariants in 246 ms returned []
// Phase 1: matrix 560 rows 581 cols
[2024-05-22 15:59:02] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-22 15:59:02] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 15:59:21] [INFO ] Implicit Places using invariants and state equation in 19217 ms returned [32, 60, 66, 87, 94, 119, 124, 148, 154, 179, 271, 276, 578]
[2024-05-22 15:59:21] [INFO ] Actually due to overlaps returned [66, 60, 271, 578, 276]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 19467 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 576/600 places, 560/563 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 576 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 575 transition count 559
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 575 transition count 559
Applied a total of 3 rules in 34 ms. Remains 575 /576 variables (removed 1) and now considering 559/560 (removed 1) transitions.
// Phase 1: matrix 559 rows 575 cols
[2024-05-22 15:59:21] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-22 15:59:21] [INFO ] Implicit Places using invariants in 245 ms returned []
// Phase 1: matrix 559 rows 575 cols
[2024-05-22 15:59:21] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-22 15:59:22] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 15:59:49] [INFO ] Implicit Places using invariants and state equation in 27538 ms returned [32, 84, 91, 116, 121, 145, 151, 176]
[2024-05-22 15:59:49] [INFO ] Actually due to overlaps returned [91, 84, 32]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 27786 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 572/600 places, 559/563 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 572 transition count 558
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 571 transition count 558
Applied a total of 2 rules in 21 ms. Remains 571 /572 variables (removed 1) and now considering 558/559 (removed 1) transitions.
// Phase 1: matrix 558 rows 571 cols
[2024-05-22 15:59:49] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 15:59:49] [INFO ] Implicit Places using invariants in 242 ms returned []
// Phase 1: matrix 558 rows 571 cols
[2024-05-22 15:59:49] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 15:59:49] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 16:00:20] [INFO ] Performed 58/571 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:00:25] [INFO ] Implicit Places using invariants and state equation in 35484 ms returned [112, 117, 141, 147, 172]
[2024-05-22 16:00:25] [INFO ] Actually due to overlaps returned [117, 112]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 35730 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 569/600 places, 558/563 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 569 transition count 557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 568 transition count 557
Applied a total of 2 rules in 29 ms. Remains 568 /569 variables (removed 1) and now considering 557/558 (removed 1) transitions.
// Phase 1: matrix 557 rows 568 cols
[2024-05-22 16:00:25] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 16:00:25] [INFO ] Implicit Places using invariants in 261 ms returned []
// Phase 1: matrix 557 rows 568 cols
[2024-05-22 16:00:25] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 16:00:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 16:00:33] [INFO ] Implicit Places using invariants and state equation in 7830 ms returned [138, 144, 169]
[2024-05-22 16:00:33] [INFO ] Actually due to overlaps returned [138, 144]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8098 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 566/600 places, 557/563 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 566 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 565 transition count 556
Applied a total of 2 rules in 28 ms. Remains 565 /566 variables (removed 1) and now considering 556/557 (removed 1) transitions.
// Phase 1: matrix 556 rows 565 cols
[2024-05-22 16:00:33] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 16:00:33] [INFO ] Implicit Places using invariants in 243 ms returned []
// Phase 1: matrix 556 rows 565 cols
[2024-05-22 16:00:33] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:00:33] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-22 16:00:41] [INFO ] Implicit Places using invariants and state equation in 8354 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8600 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 564/600 places, 556/563 transitions.
Applied a total of 0 rules in 13 ms. Remains 564 /564 variables (removed 0) and now considering 556/556 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 8 iterations and 123694 ms. Remains : 564/600 places, 556/563 transitions.
Successfully simplified 14 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-020-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 16:00:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 16:00:41] [INFO ] Flatten gal took : 39 ms
[2024-05-22 16:00:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleExponent-PT-020-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-020-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 16:00:41] [INFO ] Flatten gal took : 38 ms
[2024-05-22 16:00:42] [INFO ] Input system was already deterministic with 998 transitions.
Support contains 90 out of 1059 places (down from 99) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 1808 edges and 1059 vertex of which 1057 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1058 transition count 756
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 817 transition count 756
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 40 Pre rules applied. Total rules applied 482 place count 817 transition count 716
Deduced a syphon composed of 40 places in 6 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 562 place count 777 transition count 716
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 3 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 844 place count 636 transition count 575
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 845 place count 635 transition count 574
Applied a total of 845 rules in 73 ms. Remains 635 /1059 variables (removed 424) and now considering 574/998 (removed 424) transitions.
// Phase 1: matrix 574 rows 635 cols
[2024-05-22 16:00:42] [INFO ] Invariants computation overflowed in 61 ms
[2024-05-22 16:00:42] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 574 rows 635 cols
[2024-05-22 16:00:42] [INFO ] Invariants computation overflowed in 59 ms
[2024-05-22 16:00:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 16:01:07] [INFO ] Implicit Places using invariants and state equation in 25303 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 25598 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 634/1059 places, 574/998 transitions.
Graph (complete) has 1669 edges and 634 vertex of which 633 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 632 transition count 572
Applied a total of 3 rules in 28 ms. Remains 632 /634 variables (removed 2) and now considering 572/574 (removed 2) transitions.
// Phase 1: matrix 572 rows 632 cols
[2024-05-22 16:01:07] [INFO ] Invariants computation overflowed in 61 ms
[2024-05-22 16:01:08] [INFO ] Implicit Places using invariants in 278 ms returned []
// Phase 1: matrix 572 rows 632 cols
[2024-05-22 16:01:08] [INFO ] Invariants computation overflowed in 58 ms
[2024-05-22 16:01:08] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 16:01:18] [INFO ] Implicit Places using invariants and state equation in 10222 ms returned []
Implicit Place search using SMT with State Equation took 10501 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 632/1059 places, 572/998 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 36201 ms. Remains : 632/1059 places, 572/998 transitions.
[2024-05-22 16:01:18] [INFO ] Flatten gal took : 21 ms
[2024-05-22 16:01:18] [INFO ] Flatten gal took : 21 ms
[2024-05-22 16:01:18] [INFO ] Input system was already deterministic with 572 transitions.
[2024-05-22 16:01:18] [INFO ] Flatten gal took : 28 ms
[2024-05-22 16:01:18] [INFO ] Flatten gal took : 31 ms
[2024-05-22 16:01:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality10676454401168544831.gal : 24 ms
[2024-05-22 16:01:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality1022335017470772806.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10676454401168544831.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1022335017470772806.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 16:01:48] [INFO ] Flatten gal took : 16 ms
[2024-05-22 16:01:48] [INFO ] Applying decomposition
[2024-05-22 16:01:48] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14810336393305690860.txt' '-o' '/tmp/graph14810336393305690860.bin' '-w' '/tmp/graph14810336393305690860.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14810336393305690860.bin' '-l' '-1' '-v' '-w' '/tmp/graph14810336393305690860.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:01:48] [INFO ] Decomposing Gal with order
[2024-05-22 16:01:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:01:48] [INFO ] Removed a total of 126 redundant transitions.
[2024-05-22 16:01:48] [INFO ] Flatten gal took : 111 ms
[2024-05-22 16:01:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 27 ms.
[2024-05-22 16:01:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality10074754709632331958.gal : 13 ms
[2024-05-22 16:01:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality13819149632293803971.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/CTLCardinality10074754709632331958.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13819149632293803971.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1058 transition count 756
Reduce places removed 241 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 242 rules applied. Total rules applied 483 place count 817 transition count 755
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 484 place count 816 transition count 755
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 484 place count 816 transition count 715
Deduced a syphon composed of 40 places in 7 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 564 place count 776 transition count 715
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 2 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 3 with 282 rules applied. Total rules applied 846 place count 635 transition count 574
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 847 place count 635 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 848 place count 634 transition count 573
Applied a total of 848 rules in 96 ms. Remains 634 /1059 variables (removed 425) and now considering 573/998 (removed 425) transitions.
// Phase 1: matrix 573 rows 634 cols
[2024-05-22 16:02:19] [INFO ] Invariants computation overflowed in 68 ms
[2024-05-22 16:02:19] [INFO ] Implicit Places using invariants in 375 ms returned []
// Phase 1: matrix 573 rows 634 cols
[2024-05-22 16:02:19] [INFO ] Invariants computation overflowed in 63 ms
[2024-05-22 16:02:19] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 16:02:52] [INFO ] Performed 3/634 implicitness test of which 0 returned IMPLICIT in 32 seconds.
[2024-05-22 16:02:58] [INFO ] Implicit Places using invariants and state equation in 38733 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 39117 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 633/1059 places, 573/998 transitions.
Graph (complete) has 1671 edges and 633 vertex of which 632 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 631 transition count 571
Applied a total of 3 rules in 30 ms. Remains 631 /633 variables (removed 2) and now considering 571/573 (removed 2) transitions.
// Phase 1: matrix 571 rows 631 cols
[2024-05-22 16:02:58] [INFO ] Invariants computation overflowed in 69 ms
[2024-05-22 16:02:58] [INFO ] Implicit Places using invariants in 364 ms returned []
// Phase 1: matrix 571 rows 631 cols
[2024-05-22 16:02:58] [INFO ] Invariants computation overflowed in 56 ms
[2024-05-22 16:02:58] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 16:03:08] [INFO ] Implicit Places using invariants and state equation in 9729 ms returned []
Implicit Place search using SMT with State Equation took 10099 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 631/1059 places, 571/998 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 49342 ms. Remains : 631/1059 places, 571/998 transitions.
[2024-05-22 16:03:08] [INFO ] Flatten gal took : 18 ms
[2024-05-22 16:03:08] [INFO ] Flatten gal took : 17 ms
[2024-05-22 16:03:08] [INFO ] Input system was already deterministic with 571 transitions.
[2024-05-22 16:03:08] [INFO ] Flatten gal took : 16 ms
[2024-05-22 16:03:08] [INFO ] Flatten gal took : 17 ms
[2024-05-22 16:03:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality5676540869179664337.gal : 3 ms
[2024-05-22 16:03:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality15848590307373235495.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/CTLCardinality5676540869179664337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15848590307373235495.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 16:03:38] [INFO ] Flatten gal took : 17 ms
[2024-05-22 16:03:38] [INFO ] Applying decomposition
[2024-05-22 16:03:38] [INFO ] Flatten gal took : 17 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/graph13105343407048169626.txt' '-o' '/tmp/graph13105343407048169626.bin' '-w' '/tmp/graph13105343407048169626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13105343407048169626.bin' '-l' '-1' '-v' '-w' '/tmp/graph13105343407048169626.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:03:38] [INFO ] Decomposing Gal with order
[2024-05-22 16:03:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:03:38] [INFO ] Removed a total of 129 redundant transitions.
[2024-05-22 16:03:38] [INFO ] Flatten gal took : 37 ms
[2024-05-22 16:03:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 12 ms.
[2024-05-22 16:03:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality15258510006520029557.gal : 8 ms
[2024-05-22 16:03:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality3104866490120509578.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/CTLCardinality15258510006520029557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3104866490120509578.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 SI_CTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 241 transitions
Trivial Post-agglo rules discarded 241 transitions
Performed 241 trivial Post agglomeration. Transition count delta: 241
Iterating post reduction 0 with 241 rules applied. Total rules applied 241 place count 1058 transition count 756
Reduce places removed 241 places and 0 transitions.
Iterating post reduction 1 with 241 rules applied. Total rules applied 482 place count 817 transition count 756
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 39 Pre rules applied. Total rules applied 482 place count 817 transition count 717
Deduced a syphon composed of 39 places in 7 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 560 place count 778 transition count 717
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 3 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 842 place count 637 transition count 576
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 843 place count 636 transition count 575
Applied a total of 843 rules in 77 ms. Remains 636 /1059 variables (removed 423) and now considering 575/998 (removed 423) transitions.
// Phase 1: matrix 575 rows 636 cols
[2024-05-22 16:04:09] [INFO ] Invariants computation overflowed in 71 ms
[2024-05-22 16:04:09] [INFO ] Implicit Places using invariants in 317 ms returned []
// Phase 1: matrix 575 rows 636 cols
[2024-05-22 16:04:09] [INFO ] Invariants computation overflowed in 62 ms
[2024-05-22 16:04:09] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 16:04:18] [INFO ] Implicit Places using invariants and state equation in 9649 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9971 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 635/1059 places, 575/998 transitions.
Graph (complete) has 1670 edges and 635 vertex of which 634 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 633 transition count 573
Applied a total of 3 rules in 27 ms. Remains 633 /635 variables (removed 2) and now considering 573/575 (removed 2) transitions.
// Phase 1: matrix 573 rows 633 cols
[2024-05-22 16:04:19] [INFO ] Invariants computation overflowed in 69 ms
[2024-05-22 16:04:19] [INFO ] Implicit Places using invariants in 307 ms returned []
// Phase 1: matrix 573 rows 633 cols
[2024-05-22 16:04:19] [INFO ] Invariants computation overflowed in 69 ms
[2024-05-22 16:04:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 16:04:33] [INFO ] Implicit Places using invariants and state equation in 13954 ms returned []
Implicit Place search using SMT with State Equation took 14265 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 633/1059 places, 573/998 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 24340 ms. Remains : 633/1059 places, 573/998 transitions.
[2024-05-22 16:04:33] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:04:33] [INFO ] Flatten gal took : 16 ms
[2024-05-22 16:04:33] [INFO ] Input system was already deterministic with 573 transitions.
[2024-05-22 16:04:33] [INFO ] Flatten gal took : 31 ms
RANDOM walk for 40000 steps (4054 resets) in 68 ms. (579 steps per ms) remains 1/1 properties
[2024-05-22 16:04:33] [INFO ] Flatten gal took : 39 ms
[2024-05-22 16:04:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5707409529118265858.gal : 3 ms
[2024-05-22 16:04:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17251765431446254233.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5707409529118265858.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17251765431446254233.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (2711 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17251765431446254233.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 26
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :26 after 48
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :48 after 100
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :100 after 493
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :493 after 1557
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1557 after 14867
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :14867 after 119373
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :119373 after 416833
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :416833 after 952656
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :952656 after 5.94248e+07
Probably explored full state space saw : 165778 states, properties seen :0
Probabilistic random walk after 331560 steps, saw 165778 distinct states, run finished after 2111 ms. (steps per millisecond=157 ) properties seen :0
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :5.94248e+07 after 6.92282e+08
Interrupted probabilistic random walk after 467565 steps, run timeout after 3001 ms. (steps per millisecond=155 ) properties seen :0 out of 1
Exhaustive walk after 467565 steps, saw 233852 distinct states, run finished after 3001 ms. (steps per millisecond=155 ) properties seen :0
// Phase 1: matrix 573 rows 633 cols
[2024-05-22 16:04:38] [INFO ] Invariants computation overflowed in 85 ms
[2024-05-22 16:04:38] [INFO ] State equation strengthened by 37 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 58/88 variables, 27/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 98/186 variables, 48/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 118/304 variables, 61/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/304 variables, 4/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 122/426 variables, 64/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/426 variables, 4/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 120/546 variables, 64/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/546 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/546 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 101/647 variables, 57/346 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/647 variables, 6/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/647 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 67/714 variables, 37/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/714 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/714 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 61/775 variables, 32/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/775 variables, 2/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/775 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 61/836 variables, 32/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/836 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/836 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 61/897 variables, 32/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/897 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/897 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 61/958 variables, 32/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/958 variables, 2/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/958 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (OVERLAPS) 61/1019 variables, 32/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1019 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1019 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (OVERLAPS) 61/1080 variables, 32/593 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1080 variables, 2/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1080 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (OVERLAPS) 60/1140 variables, 32/627 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/1140 variables, 2/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1140 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (OVERLAPS) 46/1186 variables, 26/655 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1186 variables, 1/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1186 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 50 (OVERLAPS) 19/1205 variables, 13/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/1205 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 52 (OVERLAPS) 1/1206 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/1206 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 54 (OVERLAPS) 0/1206 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1206/1206 variables, and 670 constraints, problems are : Problem set: 0 solved, 1 unsolved in 691 ms.
Refiners :[State Equation: 633/633 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 58/88 variables, 27/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/88 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 98/186 variables, 48/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 118/304 variables, 61/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/304 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/304 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 122/426 variables, 64/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/426 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/426 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 120/546 variables, 64/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/546 variables, 4/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 101/647 variables, 57/347 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/647 variables, 6/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/647 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 67/714 variables, 37/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/714 variables, 2/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/714 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 61/775 variables, 32/424 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/775 variables, 2/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/775 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 61/836 variables, 32/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/836 variables, 2/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/836 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 61/897 variables, 32/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/897 variables, 2/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 131072
At refinement iteration 35 (INCLUDED_ONLY) 0/897 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD size :6.92282e+08 after 3.09921e+09
At refinement iteration 36 (OVERLAPS) 61/958 variables, 32/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/958 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/958 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 61/1019 variables, 32/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1019 variables, 2/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1019 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 61/1080 variables, 32/594 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1080 variables, 2/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1080 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 45 (OVERLAPS) 60/1140 variables, 32/628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1140 variables, 2/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/1140 variables, 0/630 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 48 (OVERLAPS) 46/1186 variables, 26/656 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/1186 variables, 1/657 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:04:40] [INFO ] Deduced a trap composed of 61 places in 219 ms of which 16 ms to minimize.
[2024-05-22 16:04:40] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 3 ms to minimize.
[2024-05-22 16:04:41] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 3 ms to minimize.
[2024-05-22 16:04:41] [INFO ] Deduced a trap composed of 60 places in 222 ms of which 2 ms to minimize.
[2024-05-22 16:04:41] [INFO ] Deduced a trap composed of 56 places in 467 ms of which 2 ms to minimize.
[2024-05-22 16:04:42] [INFO ] Deduced a trap composed of 55 places in 304 ms of which 16 ms to minimize.
[2024-05-22 16:04:44] [INFO ] Deduced a trap composed of 52 places in 2031 ms of which 2 ms to minimize.
SMT process timed out in 5876ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 573/573 transitions.
Graph (complete) has 1589 edges and 633 vertex of which 632 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 632 transition count 572
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 632 transition count 571
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 631 transition count 571
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 1 with 82 rules applied. Total rules applied 86 place count 590 transition count 530
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 2 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 1 with 74 rules applied. Total rules applied 160 place count 553 transition count 530
Free-agglomeration rule (complex) applied 78 times.
Iterating global reduction 1 with 78 rules applied. Total rules applied 238 place count 553 transition count 452
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 316 place count 475 transition count 452
Partial Free-agglomeration rule applied 78 times.
Drop transitions (Partial Free agglomeration) removed 78 transitions
Iterating global reduction 2 with 78 rules applied. Total rules applied 394 place count 475 transition count 452
Applied a total of 394 rules in 102 ms. Remains 475 /633 variables (removed 158) and now considering 452/573 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 475/633 places, 452/573 transitions.
RANDOM walk for 4000000 steps (509279 resets) in 9845 ms. (406 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (336681 resets) in 4032 ms. (991 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :3.09921e+09 after 1.08361e+10
Probably explored full state space saw : 647222 states, properties seen :0
Probabilistic random walk after 1294498 steps, saw 647222 distinct states, run finished after 7549 ms. (steps per millisecond=171 ) properties seen :0
Interrupted probabilistic random walk after 1578449 steps, run timeout after 9001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Exhaustive walk after 1578449 steps, saw 789307 distinct states, run finished after 9001 ms. (steps per millisecond=175 ) properties seen :0
// Phase 1: matrix 452 rows 475 cols
[2024-05-22 16:05:04] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 16:05:05] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/29 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 191/220 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 522/742 variables, 267/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/742 variables, 43/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 185/927 variables, 151/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/927 variables, 29/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/927 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 927/927 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 417 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/29 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 191/220 variables, 47/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 6/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/220 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 522/742 variables, 267/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/742 variables, 43/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/742 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 185/927 variables, 151/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/927 variables, 29/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:05:06] [INFO ] Deduced a trap composed of 48 places in 85 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/927 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/927 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/927 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 927/927 variables, and 555 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1087 ms.
Refiners :[State Equation: 475/475 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1631ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 524288
SDD size :1.08361e+10 after 2.99942e+10
Parikh walk visited 0 properties in 30002 ms.
Support contains 2 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 19 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 475/475 places, 452/452 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 452/452 transitions.
Applied a total of 0 rules in 9 ms. Remains 475 /475 variables (removed 0) and now considering 452/452 (removed 0) transitions.
// Phase 1: matrix 452 rows 475 cols
[2024-05-22 16:05:36] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 16:05:37] [INFO ] Implicit Places using invariants in 466 ms returned []
// Phase 1: matrix 452 rows 475 cols
[2024-05-22 16:05:37] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 16:05:37] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:05:50] [INFO ] Implicit Places using invariants and state equation in 13654 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 152, 172, 177, 198, 204, 211, 225, 230, 253, 259, 281, 286, 306, 311, 332, 337, 358, 366, 387, 389, 393, 413, 419, 441, 446, 450, 467, 473]
[2024-05-22 16:05:50] [INFO ] Actually due to overlaps returned [211, 151]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14130 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/475 places, 452/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 473 transition count 451
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 472 transition count 451
Applied a total of 2 rules in 21 ms. Remains 472 /473 variables (removed 1) and now considering 451/452 (removed 1) transitions.
// Phase 1: matrix 451 rows 472 cols
[2024-05-22 16:05:50] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 16:05:51] [INFO ] Implicit Places using invariants in 461 ms returned []
// Phase 1: matrix 451 rows 472 cols
[2024-05-22 16:05:51] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 16:05:51] [INFO ] State equation strengthened by 78 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 1048576
SDD size :2.99942e+10 after 7.28949e+10
[2024-05-22 16:06:04] [INFO ] Implicit Places using invariants and state equation in 13416 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 303, 308, 329, 334, 355, 363, 384, 386, 390, 410, 416, 438, 443, 447, 464, 470]
[2024-05-22 16:06:04] [INFO ] Actually due to overlaps returned [447, 386]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 13899 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 470/475 places, 451/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 470 transition count 450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 469 transition count 450
Applied a total of 2 rules in 35 ms. Remains 469 /470 variables (removed 1) and now considering 450/451 (removed 1) transitions.
// Phase 1: matrix 450 rows 469 cols
[2024-05-22 16:06:04] [INFO ] Computed 95 invariants in 121 ms
[2024-05-22 16:06:06] [INFO ] Implicit Places using invariants in 1401 ms returned [42, 48, 68, 73, 94, 99, 119, 125, 146, 151, 171, 176, 197, 203, 222, 227, 250, 256, 278, 283, 303, 308, 329, 334, 355, 363, 384, 389, 409, 415, 437, 442, 461, 467]
[2024-05-22 16:06:06] [INFO ] Actually due to overlaps returned [48, 42]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1417 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 467/475 places, 450/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 466 transition count 449
Applied a total of 2 rules in 35 ms. Remains 466 /467 variables (removed 1) and now considering 449/450 (removed 1) transitions.
// Phase 1: matrix 449 rows 466 cols
[2024-05-22 16:06:06] [INFO ] Invariants computation overflowed in 64 ms
[2024-05-22 16:06:06] [INFO ] Implicit Places using invariants in 774 ms returned []
// Phase 1: matrix 449 rows 466 cols
[2024-05-22 16:06:06] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 16:06:07] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:06:16] [INFO ] Implicit Places using invariants and state equation in 9177 ms returned [65, 70, 91, 96, 116, 122, 143, 148, 168, 173, 194, 200, 219, 224, 247, 253, 275, 280, 300, 305, 326, 331, 352, 360, 381, 386, 406, 412, 434, 439, 458, 464]
[2024-05-22 16:06:16] [INFO ] Actually due to overlaps returned [70, 65]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9961 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 464/475 places, 449/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 464 transition count 448
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 463 transition count 448
Applied a total of 2 rules in 22 ms. Remains 463 /464 variables (removed 1) and now considering 448/449 (removed 1) transitions.
// Phase 1: matrix 448 rows 463 cols
[2024-05-22 16:06:16] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 16:06:16] [INFO ] Implicit Places using invariants in 449 ms returned []
// Phase 1: matrix 448 rows 463 cols
[2024-05-22 16:06:16] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:06:17] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:06:34] [INFO ] Implicit Places using invariants and state equation in 17864 ms returned [88, 93, 113, 119, 140, 145, 165, 170, 191, 197, 216, 221, 244, 250, 272, 277, 297, 302, 323, 328, 349, 357, 378, 383, 403, 409, 431, 436, 455, 461]
[2024-05-22 16:06:34] [INFO ] Actually due to overlaps returned [93, 88]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 18344 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 461/475 places, 448/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 461 transition count 447
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 460 transition count 447
Applied a total of 2 rules in 18 ms. Remains 460 /461 variables (removed 1) and now considering 447/448 (removed 1) transitions.
// Phase 1: matrix 447 rows 460 cols
[2024-05-22 16:06:34] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:06:34] [INFO ] Implicit Places using invariants in 382 ms returned []
// Phase 1: matrix 447 rows 460 cols
[2024-05-22 16:06:34] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:06:35] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:06:45] [INFO ] Implicit Places using invariants and state equation in 10294 ms returned [110, 116, 137, 142, 162, 167, 188, 194, 213, 218, 241, 247, 269, 274, 294, 299, 320, 325, 346, 354, 375, 380, 400, 406, 428, 433, 452, 458]
[2024-05-22 16:06:45] [INFO ] Actually due to overlaps returned [116, 110]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 10688 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 6 : 458/475 places, 447/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 458 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 457 transition count 446
Applied a total of 2 rules in 21 ms. Remains 457 /458 variables (removed 1) and now considering 446/447 (removed 1) transitions.
// Phase 1: matrix 446 rows 457 cols
[2024-05-22 16:06:45] [INFO ] Invariants computation overflowed in 29 ms
[2024-05-22 16:06:45] [INFO ] Implicit Places using invariants in 385 ms returned []
// Phase 1: matrix 446 rows 457 cols
[2024-05-22 16:06:45] [INFO ] Invariants computation overflowed in 24 ms
[2024-05-22 16:06:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:06:57] [INFO ] Implicit Places using invariants and state equation in 12174 ms returned [134, 139, 159, 164, 185, 191, 210, 215, 238, 244, 266, 271, 291, 296, 317, 322, 343, 351, 372, 377, 397, 403, 425, 430, 449, 455]
[2024-05-22 16:06:57] [INFO ] Actually due to overlaps returned [139, 134]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 12571 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 7 : 455/475 places, 446/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 455 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 454 transition count 445
Applied a total of 2 rules in 17 ms. Remains 454 /455 variables (removed 1) and now considering 445/446 (removed 1) transitions.
// Phase 1: matrix 445 rows 454 cols
[2024-05-22 16:06:57] [INFO ] Invariants computation overflowed in 30 ms
[2024-05-22 16:06:58] [INFO ] Implicit Places using invariants in 353 ms returned []
// Phase 1: matrix 445 rows 454 cols
[2024-05-22 16:06:58] [INFO ] Invariants computation overflowed in 26 ms
[2024-05-22 16:06:58] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:07:12] [INFO ] Implicit Places using invariants and state equation in 14044 ms returned [156, 161, 182, 188, 207, 212, 235, 241, 263, 268, 288, 293, 314, 319, 340, 348, 369, 374, 394, 400, 422, 427, 446, 452]
[2024-05-22 16:07:12] [INFO ] Actually due to overlaps returned [161, 156]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 14411 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 8 : 452/475 places, 445/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 452 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 451 transition count 444
Applied a total of 2 rules in 20 ms. Remains 451 /452 variables (removed 1) and now considering 444/445 (removed 1) transitions.
// Phase 1: matrix 444 rows 451 cols
[2024-05-22 16:07:12] [INFO ] Invariants computation overflowed in 33 ms
[2024-05-22 16:07:12] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 444 rows 451 cols
[2024-05-22 16:07:12] [INFO ] Invariants computation overflowed in 28 ms
[2024-05-22 16:07:12] [INFO ] State equation strengthened by 78 read => feed constraints.
SDD proceeding with computation,1 properties remain. new max is 2097152
SDD size :7.28949e+10 after 1.5877e+11
[2024-05-22 16:07:39] [INFO ] Implicit Places using invariants and state equation in 26406 ms returned [179, 185, 204, 209, 232, 238, 260, 265, 285, 290, 311, 316, 337, 345, 366, 371, 391, 397, 419, 424, 443, 449]
[2024-05-22 16:07:39] [INFO ] Actually due to overlaps returned [185, 179]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 26795 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 9 : 449/475 places, 444/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 449 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 448 transition count 443
Applied a total of 2 rules in 15 ms. Remains 448 /449 variables (removed 1) and now considering 443/444 (removed 1) transitions.
// Phase 1: matrix 443 rows 448 cols
[2024-05-22 16:07:39] [INFO ] Invariants computation overflowed in 31 ms
[2024-05-22 16:07:39] [INFO ] Implicit Places using invariants in 365 ms returned []
// Phase 1: matrix 443 rows 448 cols
[2024-05-22 16:07:39] [INFO ] Invariants computation overflowed in 25 ms
[2024-05-22 16:07:39] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:07:45] [INFO ] Implicit Places using invariants and state equation in 6370 ms returned [201, 206, 229, 235, 257, 262, 282, 287, 308, 313, 334, 342, 363, 368, 388, 394, 416, 421, 440, 446]
[2024-05-22 16:07:45] [INFO ] Actually due to overlaps returned [206, 201]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6745 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 10 : 446/475 places, 443/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 446 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 445 transition count 442
Applied a total of 2 rules in 20 ms. Remains 445 /446 variables (removed 1) and now considering 442/443 (removed 1) transitions.
// Phase 1: matrix 442 rows 445 cols
[2024-05-22 16:07:45] [INFO ] Invariants computation overflowed in 32 ms
[2024-05-22 16:07:46] [INFO ] Implicit Places using invariants in 340 ms returned []
// Phase 1: matrix 442 rows 445 cols
[2024-05-22 16:07:46] [INFO ] Invariants computation overflowed in 27 ms
[2024-05-22 16:07:46] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:08:03] [INFO ] Implicit Places using invariants and state equation in 17436 ms returned [226, 232, 254, 259, 279, 284, 305, 310, 331, 339, 360, 365, 385, 391, 413, 418, 437, 443]
[2024-05-22 16:08:03] [INFO ] Actually due to overlaps returned [232, 226]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 17786 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 11 : 443/475 places, 442/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 443 transition count 441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 442 transition count 441
Applied a total of 2 rules in 19 ms. Remains 442 /443 variables (removed 1) and now considering 441/442 (removed 1) transitions.
// Phase 1: matrix 441 rows 442 cols
[2024-05-22 16:08:03] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 16:08:03] [INFO ] Implicit Places using invariants in 337 ms returned []
// Phase 1: matrix 441 rows 442 cols
[2024-05-22 16:08:03] [INFO ] Invariants computation overflowed in 36 ms
[2024-05-22 16:08:04] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:08:09] [INFO ] Implicit Places using invariants and state equation in 5423 ms returned [251, 256, 276, 281, 302, 307, 328, 336, 357, 362, 382, 388, 410, 415, 434, 440]
[2024-05-22 16:08:09] [INFO ] Actually due to overlaps returned [256, 251]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 5764 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 12 : 440/475 places, 441/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 440 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 439 transition count 440
Applied a total of 2 rules in 21 ms. Remains 439 /440 variables (removed 1) and now considering 440/441 (removed 1) transitions.
// Phase 1: matrix 440 rows 439 cols
[2024-05-22 16:08:09] [INFO ] Computed 75 invariants in 46 ms
[2024-05-22 16:08:09] [INFO ] Implicit Places using invariants in 551 ms returned [273, 278, 299, 304, 325, 333, 354, 359, 379, 385, 407, 412, 431, 437]
[2024-05-22 16:08:09] [INFO ] Actually due to overlaps returned [278, 273]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 556 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 13 : 437/475 places, 440/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 437 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 436 transition count 439
Applied a total of 2 rules in 17 ms. Remains 436 /437 variables (removed 1) and now considering 439/440 (removed 1) transitions.
// Phase 1: matrix 439 rows 436 cols
[2024-05-22 16:08:09] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 16:08:10] [INFO ] Implicit Places using invariants in 347 ms returned []
// Phase 1: matrix 439 rows 436 cols
[2024-05-22 16:08:10] [INFO ] Invariants computation overflowed in 34 ms
[2024-05-22 16:08:10] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:08:19] [INFO ] Implicit Places using invariants and state equation in 9377 ms returned [296, 301, 322, 330, 351, 356, 376, 382, 404, 409, 428, 434]
[2024-05-22 16:08:19] [INFO ] Actually due to overlaps returned [301, 296]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 9732 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 14 : 434/475 places, 439/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 434 transition count 438
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 433 transition count 438
Applied a total of 2 rules in 22 ms. Remains 433 /434 variables (removed 1) and now considering 438/439 (removed 1) transitions.
// Phase 1: matrix 438 rows 433 cols
[2024-05-22 16:08:19] [INFO ] Invariants computation overflowed in 44 ms
[2024-05-22 16:08:20] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 438 rows 433 cols
[2024-05-22 16:08:20] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 16:08:20] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:08:27] [INFO ] Implicit Places using invariants and state equation in 7067 ms returned [319, 327, 348, 353, 373, 379, 401, 406, 425, 431]
[2024-05-22 16:08:27] [INFO ] Actually due to overlaps returned [327, 319]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 7394 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 15 : 431/475 places, 438/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 437
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 430 transition count 437
Applied a total of 2 rules in 15 ms. Remains 430 /431 variables (removed 1) and now considering 437/438 (removed 1) transitions.
// Phase 1: matrix 437 rows 430 cols
[2024-05-22 16:08:27] [INFO ] Computed 69 invariants in 49 ms
[2024-05-22 16:08:27] [INFO ] Implicit Places using invariants in 460 ms returned [345, 350, 370, 376, 398, 403, 422, 428]
[2024-05-22 16:08:27] [INFO ] Actually due to overlaps returned [350, 345]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 478 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 16 : 428/475 places, 437/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 428 transition count 436
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 427 transition count 436
Applied a total of 2 rules in 15 ms. Remains 427 /428 variables (removed 1) and now considering 436/437 (removed 1) transitions.
// Phase 1: matrix 436 rows 427 cols
[2024-05-22 16:08:27] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-22 16:08:27] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 436 rows 427 cols
[2024-05-22 16:08:27] [INFO ] Invariants computation overflowed in 37 ms
[2024-05-22 16:08:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:08:34] [INFO ] Implicit Places using invariants and state equation in 6471 ms returned [367, 373, 395, 400, 419, 425]
[2024-05-22 16:08:34] [INFO ] Actually due to overlaps returned [373, 367]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6766 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 17 : 425/475 places, 436/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 425 transition count 435
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 424 transition count 435
Applied a total of 2 rules in 19 ms. Remains 424 /425 variables (removed 1) and now considering 435/436 (removed 1) transitions.
// Phase 1: matrix 435 rows 424 cols
[2024-05-22 16:08:34] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-22 16:08:34] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 435 rows 424 cols
[2024-05-22 16:08:34] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 16:08:34] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:08:42] [INFO ] Implicit Places using invariants and state equation in 8273 ms returned [392, 397, 416, 422]
[2024-05-22 16:08:42] [INFO ] Actually due to overlaps returned [397, 392]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8583 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 18 : 422/475 places, 435/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 422 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 421 transition count 434
Applied a total of 2 rules in 22 ms. Remains 421 /422 variables (removed 1) and now considering 434/435 (removed 1) transitions.
// Phase 1: matrix 434 rows 421 cols
[2024-05-22 16:08:43] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-22 16:08:43] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 434 rows 421 cols
[2024-05-22 16:08:43] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-22 16:08:43] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:08:51] [INFO ] Implicit Places using invariants and state equation in 8293 ms returned [413, 419]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8595 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 19 : 419/475 places, 434/452 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 419 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 418 transition count 433
Applied a total of 2 rules in 23 ms. Remains 418 /419 variables (removed 1) and now considering 433/434 (removed 1) transitions.
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:08:51] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-22 16:08:52] [INFO ] Implicit Places using invariants in 515 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:08:52] [INFO ] Invariants computation overflowed in 45 ms
[2024-05-22 16:08:52] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:08:58] [INFO ] Implicit Places using invariants and state equation in 6812 ms returned []
Implicit Place search using SMT with State Equation took 7345 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 20 : 418/475 places, 433/452 transitions.
Finished structural reductions in REACHABILITY mode , in 20 iterations and 202375 ms. Remains : 418/475 places, 433/452 transitions.
RANDOM walk for 4000000 steps (571713 resets) in 5299 ms. (754 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000001 steps (363515 resets) in 3513 ms. (1138 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1114000 steps, run timeout after 6001 ms. (steps per millisecond=185 ) properties seen :0 out of 1
Probabilistic random walk after 1114000 steps, saw 557115 distinct states, run finished after 6001 ms. (steps per millisecond=185 ) properties seen :0
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:09:07] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-22 16:09:07] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 440/631 variables, 201/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 43/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 220/851 variables, 174/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/851 variables, 29/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 338 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 440/631 variables, 201/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 43/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/631 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 220/851 variables, 174/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/851 variables, 29/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:09:11] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 3 ms to minimize.
[2024-05-22 16:09:11] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 2 ms to minimize.
[2024-05-22 16:09:11] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/851 variables, 3/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/851 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/851 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 851/851 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3810 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 4209ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 418/418 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:09:41] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-22 16:09:41] [INFO ] Implicit Places using invariants in 288 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:09:41] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-22 16:09:42] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:09:47] [INFO ] Implicit Places using invariants and state equation in 5954 ms returned []
Implicit Place search using SMT with State Equation took 6244 ms to find 0 implicit places.
[2024-05-22 16:09:47] [INFO ] Redundant transitions in 28 ms returned []
Running 432 sub problems to find dead transitions.
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:09:47] [INFO ] Invariants computation overflowed in 68 ms
[2024-05-22 16:09:47] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 433/850 variables, 417/417 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 78/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/850 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 1/851 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 851/851 variables, and 496 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30028 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 433/850 variables, 417/417 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 78/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/850 variables, 429/924 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 850/851 variables, and 924 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30017 ms.
Refiners :[State Equation: 417/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 429/432 constraints, Known Traps: 0/0 constraints]
After SMT, in 60481ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60487ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66775 ms. Remains : 418/418 places, 433/433 transitions.
RANDOM walk for 400000 steps (57161 resets) in 1440 ms. (277 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:10:48] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-22 16:10:49] [INFO ] After 220ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 16:10:49] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:10:49] [INFO ] After 477ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:10:49] [INFO ] After 521ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:10:49] [INFO ] After 807ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:10:49] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 16:10:51] [INFO ] After 1054ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:10:51] [INFO ] Deduced a trap composed of 42 places in 175 ms of which 2 ms to minimize.
[2024-05-22 16:10:51] [INFO ] Deduced a trap composed of 126 places in 160 ms of which 2 ms to minimize.
[2024-05-22 16:10:51] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 2 ms to minimize.
[2024-05-22 16:10:51] [INFO ] Deduced a trap composed of 132 places in 153 ms of which 3 ms to minimize.
[2024-05-22 16:10:52] [INFO ] Deduced a trap composed of 135 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:10:52] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 3 ms to minimize.
[2024-05-22 16:10:52] [INFO ] Deduced a trap composed of 126 places in 156 ms of which 2 ms to minimize.
[2024-05-22 16:10:52] [INFO ] Deduced a trap composed of 133 places in 150 ms of which 2 ms to minimize.
[2024-05-22 16:10:52] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 2 ms to minimize.
[2024-05-22 16:10:53] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 2 ms to minimize.
[2024-05-22 16:10:53] [INFO ] Deduced a trap composed of 133 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:10:53] [INFO ] Deduced a trap composed of 25 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:10:53] [INFO ] Deduced a trap composed of 138 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:10:54] [INFO ] Deduced a trap composed of 133 places in 173 ms of which 2 ms to minimize.
[2024-05-22 16:10:54] [INFO ] Deduced a trap composed of 130 places in 172 ms of which 3 ms to minimize.
[2024-05-22 16:10:55] [INFO ] Deduced a trap composed of 123 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:10:55] [INFO ] Deduced a trap composed of 28 places in 182 ms of which 3 ms to minimize.
[2024-05-22 16:10:55] [INFO ] Deduced a trap composed of 138 places in 173 ms of which 2 ms to minimize.
[2024-05-22 16:10:56] [INFO ] Deduced a trap composed of 131 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:10:56] [INFO ] Deduced a trap composed of 129 places in 168 ms of which 3 ms to minimize.
[2024-05-22 16:10:56] [INFO ] Deduced a trap composed of 135 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:10:56] [INFO ] Deduced a trap composed of 136 places in 168 ms of which 2 ms to minimize.
[2024-05-22 16:10:56] [INFO ] Deduced a trap composed of 134 places in 174 ms of which 2 ms to minimize.
[2024-05-22 16:10:57] [INFO ] Deduced a trap composed of 131 places in 153 ms of which 2 ms to minimize.
[2024-05-22 16:10:57] [INFO ] Deduced a trap composed of 121 places in 174 ms of which 2 ms to minimize.
[2024-05-22 16:10:57] [INFO ] Deduced a trap composed of 134 places in 170 ms of which 3 ms to minimize.
[2024-05-22 16:10:57] [INFO ] Deduced a trap composed of 139 places in 173 ms of which 2 ms to minimize.
[2024-05-22 16:10:58] [INFO ] Deduced a trap composed of 125 places in 170 ms of which 2 ms to minimize.
[2024-05-22 16:10:58] [INFO ] Deduced a trap composed of 135 places in 170 ms of which 2 ms to minimize.
[2024-05-22 16:10:58] [INFO ] Deduced a trap composed of 132 places in 174 ms of which 2 ms to minimize.
[2024-05-22 16:10:58] [INFO ] Deduced a trap composed of 131 places in 169 ms of which 2 ms to minimize.
[2024-05-22 16:10:58] [INFO ] Deduced a trap composed of 31 places in 169 ms of which 2 ms to minimize.
[2024-05-22 16:10:59] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 2 ms to minimize.
[2024-05-22 16:10:59] [INFO ] Deduced a trap composed of 81 places in 171 ms of which 2 ms to minimize.
[2024-05-22 16:10:59] [INFO ] Deduced a trap composed of 80 places in 169 ms of which 2 ms to minimize.
[2024-05-22 16:11:00] [INFO ] Deduced a trap composed of 81 places in 169 ms of which 2 ms to minimize.
[2024-05-22 16:11:00] [INFO ] Deduced a trap composed of 83 places in 163 ms of which 3 ms to minimize.
[2024-05-22 16:11:00] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
[2024-05-22 16:11:00] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 2 ms to minimize.
[2024-05-22 16:11:00] [INFO ] Deduced a trap composed of 53 places in 81 ms of which 2 ms to minimize.
[2024-05-22 16:11:00] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2024-05-22 16:11:01] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 1 ms to minimize.
[2024-05-22 16:11:01] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2024-05-22 16:11:01] [INFO ] Deduced a trap composed of 57 places in 81 ms of which 1 ms to minimize.
[2024-05-22 16:11:01] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
[2024-05-22 16:11:01] [INFO ] Deduced a trap composed of 69 places in 61 ms of which 2 ms to minimize.
[2024-05-22 16:11:01] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 1 ms to minimize.
[2024-05-22 16:11:02] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 1 ms to minimize.
[2024-05-22 16:11:02] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 11302 ms
TRAPS : Iteration 1
[2024-05-22 16:11:02] [INFO ] After 12580ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:11:02] [INFO ] After 13003ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (571806 resets) in 5047 ms. (792 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (363451 resets) in 3389 ms. (1179 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1113659 steps, run timeout after 6001 ms. (steps per millisecond=185 ) properties seen :0 out of 1
Probabilistic random walk after 1113659 steps, saw 556948 distinct states, run finished after 6001 ms. (steps per millisecond=185 ) properties seen :0
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:11:10] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 16:11:10] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 440/631 variables, 201/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 43/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 220/851 variables, 174/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/851 variables, 29/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 440/631 variables, 201/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 43/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/631 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 220/851 variables, 174/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/851 variables, 29/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 16:11:14] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 3 ms to minimize.
[2024-05-22 16:11:14] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
[2024-05-22 16:11:14] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/851 variables, 3/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/851 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/851 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 851/851 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3728 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 4119ms problems are : Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,1 properties remain. new max is 4194304
SDD size :1.5877e+11 after 3.20675e+11
Parikh walk visited 0 properties in 30000 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 6 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 418/418 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 6 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:11:45] [INFO ] Invariants computation overflowed in 47 ms
[2024-05-22 16:11:45] [INFO ] Implicit Places using invariants in 295 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:11:45] [INFO ] Invariants computation overflowed in 39 ms
[2024-05-22 16:11:45] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:11:51] [INFO ] Implicit Places using invariants and state equation in 5689 ms returned []
Implicit Place search using SMT with State Equation took 5987 ms to find 0 implicit places.
[2024-05-22 16:11:51] [INFO ] Redundant transitions in 6 ms returned []
Running 432 sub problems to find dead transitions.
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:11:51] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-22 16:11:51] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 433/850 variables, 417/417 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 78/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/850 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 1/851 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 851/851 variables, and 496 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30029 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 433/850 variables, 417/417 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 78/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/850 variables, 429/924 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 850/851 variables, and 924 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30019 ms.
Refiners :[State Equation: 417/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 429/432 constraints, Known Traps: 0/0 constraints]
After SMT, in 60383ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60390ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66399 ms. Remains : 418/418 places, 433/433 transitions.
RANDOM walk for 400000 steps (56942 resets) in 508 ms. (785 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:12:51] [INFO ] Invariants computation overflowed in 43 ms
[2024-05-22 16:12:51] [INFO ] After 229ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-22 16:12:51] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:12:52] [INFO ] After 473ms SMT Verify possible using 78 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:12:52] [INFO ] After 513ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:12:52] [INFO ] After 802ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:12:52] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 16:12:53] [INFO ] After 1055ms SMT Verify possible using 78 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:12:54] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 3 ms to minimize.
[2024-05-22 16:12:54] [INFO ] Deduced a trap composed of 126 places in 159 ms of which 3 ms to minimize.
[2024-05-22 16:12:54] [INFO ] Deduced a trap composed of 45 places in 161 ms of which 3 ms to minimize.
[2024-05-22 16:12:54] [INFO ] Deduced a trap composed of 132 places in 160 ms of which 2 ms to minimize.
[2024-05-22 16:12:55] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 3 ms to minimize.
[2024-05-22 16:12:55] [INFO ] Deduced a trap composed of 24 places in 161 ms of which 3 ms to minimize.
[2024-05-22 16:12:55] [INFO ] Deduced a trap composed of 126 places in 160 ms of which 2 ms to minimize.
[2024-05-22 16:12:55] [INFO ] Deduced a trap composed of 133 places in 163 ms of which 2 ms to minimize.
[2024-05-22 16:12:55] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 2 ms to minimize.
[2024-05-22 16:12:55] [INFO ] Deduced a trap composed of 131 places in 175 ms of which 2 ms to minimize.
[2024-05-22 16:12:56] [INFO ] Deduced a trap composed of 133 places in 165 ms of which 2 ms to minimize.
[2024-05-22 16:12:56] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 3 ms to minimize.
[2024-05-22 16:12:56] [INFO ] Deduced a trap composed of 138 places in 165 ms of which 2 ms to minimize.
[2024-05-22 16:12:57] [INFO ] Deduced a trap composed of 133 places in 159 ms of which 2 ms to minimize.
[2024-05-22 16:12:57] [INFO ] Deduced a trap composed of 130 places in 154 ms of which 3 ms to minimize.
[2024-05-22 16:12:58] [INFO ] Deduced a trap composed of 123 places in 169 ms of which 2 ms to minimize.
[2024-05-22 16:12:58] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 3 ms to minimize.
[2024-05-22 16:12:58] [INFO ] Deduced a trap composed of 138 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:12:58] [INFO ] Deduced a trap composed of 131 places in 180 ms of which 3 ms to minimize.
[2024-05-22 16:12:59] [INFO ] Deduced a trap composed of 129 places in 177 ms of which 2 ms to minimize.
[2024-05-22 16:12:59] [INFO ] Deduced a trap composed of 135 places in 174 ms of which 2 ms to minimize.
[2024-05-22 16:12:59] [INFO ] Deduced a trap composed of 136 places in 175 ms of which 3 ms to minimize.
[2024-05-22 16:12:59] [INFO ] Deduced a trap composed of 134 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:12:59] [INFO ] Deduced a trap composed of 131 places in 176 ms of which 2 ms to minimize.
[2024-05-22 16:13:00] [INFO ] Deduced a trap composed of 121 places in 174 ms of which 3 ms to minimize.
[2024-05-22 16:13:00] [INFO ] Deduced a trap composed of 134 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:13:00] [INFO ] Deduced a trap composed of 139 places in 175 ms of which 2 ms to minimize.
[2024-05-22 16:13:01] [INFO ] Deduced a trap composed of 125 places in 176 ms of which 2 ms to minimize.
[2024-05-22 16:13:01] [INFO ] Deduced a trap composed of 135 places in 173 ms of which 2 ms to minimize.
[2024-05-22 16:13:01] [INFO ] Deduced a trap composed of 132 places in 178 ms of which 2 ms to minimize.
[2024-05-22 16:13:01] [INFO ] Deduced a trap composed of 131 places in 173 ms of which 2 ms to minimize.
[2024-05-22 16:13:01] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 2 ms to minimize.
[2024-05-22 16:13:02] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 2 ms to minimize.
[2024-05-22 16:13:02] [INFO ] Deduced a trap composed of 81 places in 171 ms of which 3 ms to minimize.
[2024-05-22 16:13:02] [INFO ] Deduced a trap composed of 80 places in 178 ms of which 3 ms to minimize.
[2024-05-22 16:13:02] [INFO ] Deduced a trap composed of 81 places in 176 ms of which 3 ms to minimize.
[2024-05-22 16:13:03] [INFO ] Deduced a trap composed of 83 places in 173 ms of which 2 ms to minimize.
[2024-05-22 16:13:03] [INFO ] Deduced a trap composed of 43 places in 85 ms of which 2 ms to minimize.
[2024-05-22 16:13:03] [INFO ] Deduced a trap composed of 59 places in 88 ms of which 2 ms to minimize.
[2024-05-22 16:13:03] [INFO ] Deduced a trap composed of 53 places in 88 ms of which 1 ms to minimize.
[2024-05-22 16:13:03] [INFO ] Deduced a trap composed of 60 places in 83 ms of which 1 ms to minimize.
[2024-05-22 16:13:03] [INFO ] Deduced a trap composed of 46 places in 87 ms of which 1 ms to minimize.
[2024-05-22 16:13:04] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-05-22 16:13:04] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 1 ms to minimize.
[2024-05-22 16:13:04] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-05-22 16:13:04] [INFO ] Deduced a trap composed of 69 places in 65 ms of which 1 ms to minimize.
[2024-05-22 16:13:04] [INFO ] Deduced a trap composed of 79 places in 68 ms of which 1 ms to minimize.
[2024-05-22 16:13:05] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-05-22 16:13:05] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 11465 ms
TRAPS : Iteration 1
[2024-05-22 16:13:05] [INFO ] After 12739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:13:05] [INFO ] After 13159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (5648 resets) in 96 ms. (412 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3673 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 553732 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 1
Probabilistic random walk after 553732 steps, saw 276928 distinct states, run finished after 3002 ms. (steps per millisecond=184 ) properties seen :0
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:13:08] [INFO ] Invariants computation overflowed in 51 ms
[2024-05-22 16:13:08] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 440/631 variables, 201/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 43/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 220/851 variables, 174/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/851 variables, 29/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 440/631 variables, 201/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 43/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/631 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 851/851 variables, and 468 constraints, problems are : Problem set: 0 solved, 1 unsolved in 872 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 49/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1294ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 9 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 418/418 places, 433/433 transitions.
RANDOM walk for 40000 steps (5702 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3591 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 551955 steps, run timeout after 3001 ms. (steps per millisecond=183 ) properties seen :0 out of 1
Probabilistic random walk after 551955 steps, saw 276037 distinct states, run finished after 3001 ms. (steps per millisecond=183 ) properties seen :0
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:13:43] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-22 16:13:43] [INFO ] State equation strengthened by 78 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 440/631 variables, 201/250 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/631 variables, 43/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 220/851 variables, 174/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/851 variables, 29/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/851 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 496 constraints, problems are : Problem set: 0 solved, 1 unsolved in 333 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/30 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 161/191 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 440/631 variables, 201/251 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/631 variables, 43/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/631 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 220/851 variables, 174/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/851 variables, 29/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/851 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/851 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 851/851 variables, and 497 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1284 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1676ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 2 out of 418 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 9 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 418/418 places, 433/433 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 418/418 places, 433/433 transitions.
Applied a total of 0 rules in 7 ms. Remains 418 /418 variables (removed 0) and now considering 433/433 (removed 0) transitions.
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:14:14] [INFO ] Invariants computation overflowed in 48 ms
[2024-05-22 16:14:14] [INFO ] Implicit Places using invariants in 292 ms returned []
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:14:15] [INFO ] Invariants computation overflowed in 38 ms
[2024-05-22 16:14:15] [INFO ] State equation strengthened by 78 read => feed constraints.
[2024-05-22 16:14:20] [INFO ] Implicit Places using invariants and state equation in 5543 ms returned []
Implicit Place search using SMT with State Equation took 5836 ms to find 0 implicit places.
[2024-05-22 16:14:20] [INFO ] Redundant transitions in 2 ms returned []
Running 432 sub problems to find dead transitions.
// Phase 1: matrix 433 rows 418 cols
[2024-05-22 16:14:20] [INFO ] Invariants computation overflowed in 42 ms
[2024-05-22 16:14:20] [INFO ] State equation strengthened by 78 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 433/850 variables, 417/417 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 78/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Detected timeout of ITS tools.
[2024-05-22 16:14:33] [INFO ] Flatten gal took : 19 ms
[2024-05-22 16:14:33] [INFO ] Applying decomposition
[2024-05-22 16:14:33] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17037535340096205677.txt' '-o' '/tmp/graph17037535340096205677.bin' '-w' '/tmp/graph17037535340096205677.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17037535340096205677.bin' '-l' '-1' '-v' '-w' '/tmp/graph17037535340096205677.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:14:33] [INFO ] Decomposing Gal with order
[2024-05-22 16:14:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:14:33] [INFO ] Removed a total of 129 redundant transitions.
[2024-05-22 16:14:33] [INFO ] Flatten gal took : 29 ms
[2024-05-22 16:14:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 15 ms.
[2024-05-22 16:14:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15826261607924047563.gal : 7 ms
[2024-05-22 16:14:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13937276724229845194.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15826261607924047563.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13937276724229845194.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 ...330
Loading property file /tmp/ReachabilityCardinality13937276724229845194.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 12
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :12 after 27
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :27 after 48
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :48 after 100
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :100 after 514
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :514 after 1952
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1952 after 27990
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :27990 after 177912
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :177912 after 570393
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :570393 after 1.36513e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1.36513e+06 after 4.92096e+08
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4.92096e+08 after 3.48078e+09
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/850 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 4 (OVERLAPS) 1/851 variables, 1/496 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 851/851 variables, and 496 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30023 ms.
Refiners :[State Equation: 418/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 432/432 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 432 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/417 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 432 unsolved
At refinement iteration 1 (OVERLAPS) 433/850 variables, 417/417 constraints. Problems are: Problem set: 0 solved, 432 unsolved
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :3.48078e+09 after 1.41818e+10
At refinement iteration 2 (INCLUDED_ONLY) 0/850 variables, 78/495 constraints. Problems are: Problem set: 0 solved, 432 unsolved
SDD proceeding with computation,1 properties remain. new max is 262144
SDD size :1.41818e+10 after 3.7895e+10
At refinement iteration 3 (INCLUDED_ONLY) 0/850 variables, 429/924 constraints. Problems are: Problem set: 0 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 850/851 variables, and 924 constraints, problems are : Problem set: 0 solved, 432 unsolved in 30025 ms.
Refiners :[State Equation: 417/418 constraints, ReadFeed: 78/78 constraints, PredecessorRefiner: 429/432 constraints, Known Traps: 0/0 constraints]
After SMT, in 60370ms problems are : Problem set: 0 solved, 432 unsolved
Search for dead transitions found 0 dead transitions in 60374ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66229 ms. Remains : 418/418 places, 433/433 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 418 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 417 transition count 432
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 2 place count 417 transition count 396
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 74 place count 381 transition count 396
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 93 place count 362 transition count 377
Iterating global reduction 2 with 19 rules applied. Total rules applied 112 place count 362 transition count 377
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 361 transition count 376
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 361 transition count 374
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 118 place count 359 transition count 374
Applied a total of 118 rules in 69 ms. Remains 359 /418 variables (removed 59) and now considering 374/433 (removed 59) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 374 rows 359 cols
[2024-05-22 16:15:21] [INFO ] Invariants computation overflowed in 23 ms
[2024-05-22 16:15:21] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 16:15:21] [INFO ] After 281ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 16:15:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 16:15:21] [INFO ] After 29ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 16:15:21] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 4 ms to minimize.
[2024-05-22 16:15:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
TRAPS : Iteration 1
[2024-05-22 16:15:21] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:15:21] [INFO ] After 588ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-22 16:15:21] [INFO ] Flatten gal took : 36 ms
[2024-05-22 16:15:21] [INFO ] Flatten gal took : 32 ms
[2024-05-22 16:15:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6050386739969613237.gal : 4 ms
[2024-05-22 16:15:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10054909183722474365.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6050386739969613237.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10054909183722474365.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10054909183722474365.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 42
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :42 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 183
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :183 after 317
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :317 after 1146
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1146 after 3523
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3523 after 12460
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :12460 after 29991
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :29991 after 70339
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :70339 after 185797
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :185797 after 443047
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :443047 after 1.04192e+06
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :1.04192e+06 after 2.40926e+06
Detected timeout of ITS tools.
[2024-05-22 16:15:36] [INFO ] Flatten gal took : 19 ms
[2024-05-22 16:15:36] [INFO ] Applying decomposition
[2024-05-22 16:15:36] [INFO ] Flatten gal took : 19 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/graph5754121585510423169.txt' '-o' '/tmp/graph5754121585510423169.bin' '-w' '/tmp/graph5754121585510423169.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5754121585510423169.bin' '-l' '-1' '-v' '-w' '/tmp/graph5754121585510423169.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:15:36] [INFO ] Decomposing Gal with order
[2024-05-22 16:15:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:15:36] [INFO ] Removed a total of 205 redundant transitions.
[2024-05-22 16:15:36] [INFO ] Flatten gal took : 38 ms
[2024-05-22 16:15:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 118 labels/synchronizations in 8 ms.
[2024-05-22 16:15:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11712920506824417901.gal : 5 ms
[2024-05-22 16:15:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9334954996116222305.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11712920506824417901.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9334954996116222305.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9334954996116222305.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 30
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :30 after 52
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :52 after 63
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :63 after 178
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :178 after 203
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :203 after 1023
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1023 after 3523
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3523 after 14210
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :14210 after 35614
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :35614 after 93887
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :93887 after 248875
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :248875 after 713913
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :713913 after 2.00209e+06
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31122 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-22 16:15:52] [INFO ] Flatten gal took : 19 ms
[2024-05-22 16:15:52] [INFO ] Flatten gal took : 19 ms
[2024-05-22 16:15:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality14695083134700562912.gal : 4 ms
[2024-05-22 16:15:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality17433305140853304117.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/CTLCardinality14695083134700562912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17433305140853304117.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 16:16:22] [INFO ] Flatten gal took : 22 ms
[2024-05-22 16:16:22] [INFO ] Applying decomposition
[2024-05-22 16:16:22] [INFO ] Flatten gal took : 29 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/graph12105571642153350956.txt' '-o' '/tmp/graph12105571642153350956.bin' '-w' '/tmp/graph12105571642153350956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12105571642153350956.bin' '-l' '-1' '-v' '-w' '/tmp/graph12105571642153350956.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:16:22] [INFO ] Decomposing Gal with order
[2024-05-22 16:16:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:16:22] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-22 16:16:22] [INFO ] Flatten gal took : 54 ms
[2024-05-22 16:16:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 150 labels/synchronizations in 6 ms.
[2024-05-22 16:16:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality8349308988516296909.gal : 5 ms
[2024-05-22 16:16:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality12060861877588229925.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/CTLCardinality8349308988516296909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12060861877588229925.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Applied a total of 0 rules in 50 ms. Remains 1059 /1059 variables (removed 0) and now considering 998/998 (removed 0) transitions.
// Phase 1: matrix 998 rows 1059 cols
[2024-05-22 16:16:52] [INFO ] Computed 100 invariants in 93 ms
[2024-05-22 16:16:52] [INFO ] Implicit Places using invariants in 403 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 404 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1059 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 59 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:16:53] [INFO ] Invariants computation overflowed in 108 ms
[2024-05-22 16:16:53] [INFO ] Implicit Places using invariants in 374 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:16:53] [INFO ] Invariants computation overflowed in 101 ms
[2024-05-22 16:17:06] [INFO ] Implicit Places using invariants and state equation in 13387 ms returned []
Implicit Place search using SMT with State Equation took 13764 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1059 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14278 ms. Remains : 1057/1059 places, 997/998 transitions.
[2024-05-22 16:17:06] [INFO ] Flatten gal took : 19 ms
[2024-05-22 16:17:06] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:17:06] [INFO ] Input system was already deterministic with 997 transitions.
[2024-05-22 16:17:06] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:17:06] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:17:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality14158571463434673416.gal : 3 ms
[2024-05-22 16:17:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality12824730601694932842.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/CTLCardinality14158571463434673416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12824730601694932842.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 16:17:37] [INFO ] Flatten gal took : 25 ms
[2024-05-22 16:17:37] [INFO ] Applying decomposition
[2024-05-22 16:17:37] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12792134637833126317.txt' '-o' '/tmp/graph12792134637833126317.bin' '-w' '/tmp/graph12792134637833126317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12792134637833126317.bin' '-l' '-1' '-v' '-w' '/tmp/graph12792134637833126317.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:17:37] [INFO ] Decomposing Gal with order
[2024-05-22 16:17:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:17:37] [INFO ] Removed a total of 286 redundant transitions.
[2024-05-22 16:17:37] [INFO ] Flatten gal took : 42 ms
[2024-05-22 16:17:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 8 ms.
[2024-05-22 16:17:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality7518043667831071462.gal : 8 ms
[2024-05-22 16:17:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality16468196916692858931.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/CTLCardinality7518043667831071462.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16468196916692858931.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 230 transitions
Trivial Post-agglo rules discarded 230 transitions
Performed 230 trivial Post agglomeration. Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 230 place count 1058 transition count 767
Reduce places removed 230 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 233 rules applied. Total rules applied 463 place count 828 transition count 764
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 466 place count 825 transition count 764
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 466 place count 825 transition count 722
Deduced a syphon composed of 42 places in 6 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 550 place count 783 transition count 722
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 2 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 824 place count 646 transition count 585
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 825 place count 645 transition count 584
Applied a total of 825 rules in 72 ms. Remains 645 /1059 variables (removed 414) and now considering 584/998 (removed 414) transitions.
// Phase 1: matrix 584 rows 645 cols
[2024-05-22 16:18:07] [INFO ] Invariants computation overflowed in 66 ms
[2024-05-22 16:18:07] [INFO ] Implicit Places using invariants in 312 ms returned []
// Phase 1: matrix 584 rows 645 cols
[2024-05-22 16:18:07] [INFO ] Invariants computation overflowed in 67 ms
[2024-05-22 16:18:08] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 16:18:19] [INFO ] Implicit Places using invariants and state equation in 11507 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11821 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 644/1059 places, 584/998 transitions.
Graph (complete) has 1667 edges and 644 vertex of which 643 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 642 transition count 582
Applied a total of 3 rules in 29 ms. Remains 642 /644 variables (removed 2) and now considering 582/584 (removed 2) transitions.
// Phase 1: matrix 582 rows 642 cols
[2024-05-22 16:18:19] [INFO ] Invariants computation overflowed in 46 ms
[2024-05-22 16:18:19] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 582 rows 642 cols
[2024-05-22 16:18:19] [INFO ] Invariants computation overflowed in 41 ms
[2024-05-22 16:18:19] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 16:18:29] [INFO ] Implicit Places using invariants and state equation in 10130 ms returned []
Implicit Place search using SMT with State Equation took 10434 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 642/1059 places, 582/998 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 22356 ms. Remains : 642/1059 places, 582/998 transitions.
[2024-05-22 16:18:29] [INFO ] Flatten gal took : 13 ms
[2024-05-22 16:18:29] [INFO ] Flatten gal took : 14 ms
[2024-05-22 16:18:29] [INFO ] Input system was already deterministic with 582 transitions.
[2024-05-22 16:18:29] [INFO ] Flatten gal took : 13 ms
[2024-05-22 16:18:29] [INFO ] Flatten gal took : 13 ms
[2024-05-22 16:18:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality2024913257584104362.gal : 2 ms
[2024-05-22 16:18:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality10687816971214854988.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/CTLCardinality2024913257584104362.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10687816971214854988.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 16:18:59] [INFO ] Flatten gal took : 16 ms
[2024-05-22 16:18:59] [INFO ] Applying decomposition
[2024-05-22 16:18:59] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9413490475484208419.txt' '-o' '/tmp/graph9413490475484208419.bin' '-w' '/tmp/graph9413490475484208419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9413490475484208419.bin' '-l' '-1' '-v' '-w' '/tmp/graph9413490475484208419.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:18:59] [INFO ] Decomposing Gal with order
[2024-05-22 16:18:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:18:59] [INFO ] Removed a total of 158 redundant transitions.
[2024-05-22 16:19:00] [INFO ] Flatten gal took : 27 ms
[2024-05-22 16:19:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 10 ms.
[2024-05-22 16:19:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality5377874337505713501.gal : 6 ms
[2024-05-22 16:19:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality4024530897816508809.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/CTLCardinality5377874337505713501.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4024530897816508809.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 237 transitions
Trivial Post-agglo rules discarded 237 transitions
Performed 237 trivial Post agglomeration. Transition count delta: 237
Iterating post reduction 0 with 237 rules applied. Total rules applied 237 place count 1058 transition count 760
Reduce places removed 237 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 238 rules applied. Total rules applied 475 place count 821 transition count 759
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 476 place count 820 transition count 759
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 476 place count 820 transition count 719
Deduced a syphon composed of 40 places in 5 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 556 place count 780 transition count 719
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 2 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 3 with 282 rules applied. Total rules applied 838 place count 639 transition count 578
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 839 place count 638 transition count 577
Applied a total of 839 rules in 66 ms. Remains 638 /1059 variables (removed 421) and now considering 577/998 (removed 421) transitions.
// Phase 1: matrix 577 rows 638 cols
[2024-05-22 16:19:30] [INFO ] Invariants computation overflowed in 58 ms
[2024-05-22 16:19:30] [INFO ] Implicit Places using invariants in 280 ms returned []
// Phase 1: matrix 577 rows 638 cols
[2024-05-22 16:19:30] [INFO ] Invariants computation overflowed in 49 ms
[2024-05-22 16:19:30] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 16:19:43] [INFO ] Implicit Places using invariants and state equation in 12718 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 13001 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 637/1059 places, 577/998 transitions.
Graph (complete) has 1671 edges and 637 vertex of which 636 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 635 transition count 575
Applied a total of 3 rules in 30 ms. Remains 635 /637 variables (removed 2) and now considering 575/577 (removed 2) transitions.
// Phase 1: matrix 575 rows 635 cols
[2024-05-22 16:19:43] [INFO ] Invariants computation overflowed in 52 ms
[2024-05-22 16:19:43] [INFO ] Implicit Places using invariants in 287 ms returned []
// Phase 1: matrix 575 rows 635 cols
[2024-05-22 16:19:43] [INFO ] Invariants computation overflowed in 53 ms
[2024-05-22 16:19:43] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-22 16:19:57] [INFO ] Implicit Places using invariants and state equation in 13864 ms returned []
Implicit Place search using SMT with State Equation took 14153 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 635/1059 places, 575/998 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 27250 ms. Remains : 635/1059 places, 575/998 transitions.
[2024-05-22 16:19:57] [INFO ] Flatten gal took : 15 ms
[2024-05-22 16:19:57] [INFO ] Flatten gal took : 14 ms
[2024-05-22 16:19:57] [INFO ] Input system was already deterministic with 575 transitions.
[2024-05-22 16:19:57] [INFO ] Flatten gal took : 14 ms
[2024-05-22 16:19:57] [INFO ] Flatten gal took : 14 ms
[2024-05-22 16:19:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality12011955805921028356.gal : 3 ms
[2024-05-22 16:19:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality5478715035782789306.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/CTLCardinality12011955805921028356.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5478715035782789306.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 16:20:27] [INFO ] Flatten gal took : 17 ms
[2024-05-22 16:20:27] [INFO ] Applying decomposition
[2024-05-22 16:20:27] [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/graph9229777195099171132.txt' '-o' '/tmp/graph9229777195099171132.bin' '-w' '/tmp/graph9229777195099171132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9229777195099171132.bin' '-l' '-1' '-v' '-w' '/tmp/graph9229777195099171132.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:20:27] [INFO ] Decomposing Gal with order
[2024-05-22 16:20:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:20:27] [INFO ] Removed a total of 134 redundant transitions.
[2024-05-22 16:20:27] [INFO ] Flatten gal took : 26 ms
[2024-05-22 16:20:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2024-05-22 16:20:27] [INFO ] Time to serialize gal into /tmp/CTLCardinality2860675268440451694.gal : 6 ms
[2024-05-22 16:20:27] [INFO ] Time to serialize properties into /tmp/CTLCardinality2411361934108435428.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/CTLCardinality2860675268440451694.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2411361934108435428.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Applied a total of 0 rules in 45 ms. Remains 1059 /1059 variables (removed 0) and now considering 998/998 (removed 0) transitions.
[2024-05-22 16:20:57] [INFO ] Invariant cache hit.
[2024-05-22 16:20:58] [INFO ] Implicit Places using invariants in 343 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 344 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1059 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 55 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:20:58] [INFO ] Invariants computation overflowed in 111 ms
[2024-05-22 16:20:58] [INFO ] Implicit Places using invariants in 374 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:20:58] [INFO ] Invariants computation overflowed in 100 ms
[2024-05-22 16:21:12] [INFO ] Implicit Places using invariants and state equation in 13538 ms returned []
Implicit Place search using SMT with State Equation took 13917 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1059 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14361 ms. Remains : 1057/1059 places, 997/998 transitions.
[2024-05-22 16:21:12] [INFO ] Flatten gal took : 19 ms
[2024-05-22 16:21:12] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:21:12] [INFO ] Input system was already deterministic with 997 transitions.
[2024-05-22 16:21:12] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:21:12] [INFO ] Flatten gal took : 19 ms
[2024-05-22 16:21:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality2347164124461837699.gal : 3 ms
[2024-05-22 16:21:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality16529002684270216034.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/CTLCardinality2347164124461837699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16529002684270216034.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 16:21:42] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:21:42] [INFO ] Applying decomposition
[2024-05-22 16:21:42] [INFO ] Flatten gal took : 20 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/graph6168872127349827975.txt' '-o' '/tmp/graph6168872127349827975.bin' '-w' '/tmp/graph6168872127349827975.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6168872127349827975.bin' '-l' '-1' '-v' '-w' '/tmp/graph6168872127349827975.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:21:42] [INFO ] Decomposing Gal with order
[2024-05-22 16:21:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:21:42] [INFO ] Removed a total of 282 redundant transitions.
[2024-05-22 16:21:42] [INFO ] Flatten gal took : 40 ms
[2024-05-22 16:21:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 12 ms.
[2024-05-22 16:21:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality9226017566803416696.gal : 11 ms
[2024-05-22 16:21:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality14332049396724153607.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/CTLCardinality9226017566803416696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14332049396724153607.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Applied a total of 0 rules in 32 ms. Remains 1059 /1059 variables (removed 0) and now considering 998/998 (removed 0) transitions.
[2024-05-22 16:22:12] [INFO ] Invariant cache hit.
[2024-05-22 16:22:13] [INFO ] Implicit Places using invariants in 314 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 315 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1059 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 55 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:22:13] [INFO ] Invariants computation overflowed in 112 ms
[2024-05-22 16:22:13] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:22:13] [INFO ] Invariants computation overflowed in 101 ms
[2024-05-22 16:22:26] [INFO ] Implicit Places using invariants and state equation in 13060 ms returned []
Implicit Place search using SMT with State Equation took 13430 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1059 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13841 ms. Remains : 1057/1059 places, 997/998 transitions.
[2024-05-22 16:22:26] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:22:26] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:22:26] [INFO ] Input system was already deterministic with 997 transitions.
[2024-05-22 16:22:26] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:22:26] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:22:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality3807464013235125707.gal : 3 ms
[2024-05-22 16:22:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality9155896197860776186.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/CTLCardinality3807464013235125707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9155896197860776186.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 16:22:56] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:22:56] [INFO ] Applying decomposition
[2024-05-22 16:22:56] [INFO ] Flatten gal took : 20 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/graph133948449568114482.txt' '-o' '/tmp/graph133948449568114482.bin' '-w' '/tmp/graph133948449568114482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph133948449568114482.bin' '-l' '-1' '-v' '-w' '/tmp/graph133948449568114482.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:22:56] [INFO ] Decomposing Gal with order
[2024-05-22 16:22:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:22:57] [INFO ] Removed a total of 287 redundant transitions.
[2024-05-22 16:22:57] [INFO ] Flatten gal took : 37 ms
[2024-05-22 16:22:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 13 ms.
[2024-05-22 16:22:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality12045446655636707365.gal : 10 ms
[2024-05-22 16:22:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality4319085414353768276.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/CTLCardinality12045446655636707365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4319085414353768276.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Applied a total of 0 rules in 34 ms. Remains 1059 /1059 variables (removed 0) and now considering 998/998 (removed 0) transitions.
[2024-05-22 16:23:27] [INFO ] Invariant cache hit.
[2024-05-22 16:23:27] [INFO ] Implicit Places using invariants in 313 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 314 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1059 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 54 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:23:27] [INFO ] Invariants computation overflowed in 112 ms
[2024-05-22 16:23:28] [INFO ] Implicit Places using invariants in 377 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:23:28] [INFO ] Invariants computation overflowed in 102 ms
[2024-05-22 16:23:43] [INFO ] Implicit Places using invariants and state equation in 15162 ms returned []
Implicit Place search using SMT with State Equation took 15542 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1059 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15944 ms. Remains : 1057/1059 places, 997/998 transitions.
[2024-05-22 16:23:43] [INFO ] Flatten gal took : 18 ms
[2024-05-22 16:23:43] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:23:43] [INFO ] Input system was already deterministic with 997 transitions.
[2024-05-22 16:23:43] [INFO ] Flatten gal took : 19 ms
[2024-05-22 16:23:43] [INFO ] Flatten gal took : 33 ms
[2024-05-22 16:23:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality5076502785123560775.gal : 3 ms
[2024-05-22 16:23:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality11590422344434234325.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/CTLCardinality5076502785123560775.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11590422344434234325.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 16:24:13] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:24:13] [INFO ] Applying decomposition
[2024-05-22 16:24:13] [INFO ] Flatten gal took : 20 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/graph4960693165246674484.txt' '-o' '/tmp/graph4960693165246674484.bin' '-w' '/tmp/graph4960693165246674484.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4960693165246674484.bin' '-l' '-1' '-v' '-w' '/tmp/graph4960693165246674484.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:24:13] [INFO ] Decomposing Gal with order
[2024-05-22 16:24:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:24:13] [INFO ] Removed a total of 279 redundant transitions.
[2024-05-22 16:24:13] [INFO ] Flatten gal took : 36 ms
[2024-05-22 16:24:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 20 ms.
[2024-05-22 16:24:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality6491036194110563710.gal : 10 ms
[2024-05-22 16:24:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality14913061381389648031.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/CTLCardinality6491036194110563710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14913061381389648031.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 230 transitions
Trivial Post-agglo rules discarded 230 transitions
Performed 230 trivial Post agglomeration. Transition count delta: 230
Iterating post reduction 0 with 230 rules applied. Total rules applied 230 place count 1058 transition count 767
Reduce places removed 230 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 234 rules applied. Total rules applied 464 place count 828 transition count 763
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 468 place count 824 transition count 763
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 468 place count 824 transition count 722
Deduced a syphon composed of 41 places in 6 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 550 place count 783 transition count 722
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 3 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 828 place count 644 transition count 583
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 829 place count 643 transition count 582
Applied a total of 829 rules in 65 ms. Remains 643 /1059 variables (removed 416) and now considering 582/998 (removed 416) transitions.
// Phase 1: matrix 582 rows 643 cols
[2024-05-22 16:24:44] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-22 16:24:44] [INFO ] Implicit Places using invariants in 274 ms returned []
// Phase 1: matrix 582 rows 643 cols
[2024-05-22 16:24:44] [INFO ] Invariants computation overflowed in 50 ms
[2024-05-22 16:24:44] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 16:24:52] [INFO ] Implicit Places using invariants and state equation in 8700 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 8976 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 642/1059 places, 582/998 transitions.
Graph (complete) has 1664 edges and 642 vertex of which 641 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 640 transition count 580
Applied a total of 3 rules in 27 ms. Remains 640 /642 variables (removed 2) and now considering 580/582 (removed 2) transitions.
// Phase 1: matrix 580 rows 640 cols
[2024-05-22 16:24:53] [INFO ] Invariants computation overflowed in 60 ms
[2024-05-22 16:24:53] [INFO ] Implicit Places using invariants in 291 ms returned []
// Phase 1: matrix 580 rows 640 cols
[2024-05-22 16:24:53] [INFO ] Invariants computation overflowed in 61 ms
[2024-05-22 16:24:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-22 16:25:02] [INFO ] Implicit Places using invariants and state equation in 9158 ms returned []
Implicit Place search using SMT with State Equation took 9463 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 640/1059 places, 580/998 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 18531 ms. Remains : 640/1059 places, 580/998 transitions.
[2024-05-22 16:25:02] [INFO ] Flatten gal took : 15 ms
[2024-05-22 16:25:02] [INFO ] Flatten gal took : 13 ms
[2024-05-22 16:25:02] [INFO ] Input system was already deterministic with 580 transitions.
[2024-05-22 16:25:02] [INFO ] Flatten gal took : 13 ms
[2024-05-22 16:25:02] [INFO ] Flatten gal took : 14 ms
[2024-05-22 16:25:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality2546974139817166779.gal : 2 ms
[2024-05-22 16:25:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality6683181771228298477.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/CTLCardinality2546974139817166779.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6683181771228298477.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 16:25:32] [INFO ] Flatten gal took : 14 ms
[2024-05-22 16:25:32] [INFO ] Applying decomposition
[2024-05-22 16:25:32] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17194832501406988283.txt' '-o' '/tmp/graph17194832501406988283.bin' '-w' '/tmp/graph17194832501406988283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17194832501406988283.bin' '-l' '-1' '-v' '-w' '/tmp/graph17194832501406988283.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:25:32] [INFO ] Decomposing Gal with order
[2024-05-22 16:25:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:25:32] [INFO ] Removed a total of 139 redundant transitions.
[2024-05-22 16:25:32] [INFO ] Flatten gal took : 23 ms
[2024-05-22 16:25:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 5 ms.
[2024-05-22 16:25:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality3228941395249327090.gal : 5 ms
[2024-05-22 16:25:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality16168012709291006342.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/CTLCardinality3228941395249327090.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16168012709291006342.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Applied a total of 0 rules in 34 ms. Remains 1059 /1059 variables (removed 0) and now considering 998/998 (removed 0) transitions.
[2024-05-22 16:26:02] [INFO ] Invariant cache hit.
[2024-05-22 16:26:03] [INFO ] Implicit Places using invariants in 303 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 304 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1058/1059 places, 998/998 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1057 transition count 997
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1057 transition count 997
Applied a total of 2 rules in 54 ms. Remains 1057 /1058 variables (removed 1) and now considering 997/998 (removed 1) transitions.
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:26:03] [INFO ] Invariants computation overflowed in 110 ms
[2024-05-22 16:26:03] [INFO ] Implicit Places using invariants in 367 ms returned []
// Phase 1: matrix 997 rows 1057 cols
[2024-05-22 16:26:03] [INFO ] Invariants computation overflowed in 101 ms
[2024-05-22 16:26:17] [INFO ] Implicit Places using invariants and state equation in 13693 ms returned []
Implicit Place search using SMT with State Equation took 14062 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1057/1059 places, 997/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 14454 ms. Remains : 1057/1059 places, 997/998 transitions.
[2024-05-22 16:26:17] [INFO ] Flatten gal took : 19 ms
[2024-05-22 16:26:17] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:26:17] [INFO ] Input system was already deterministic with 997 transitions.
[2024-05-22 16:26:17] [INFO ] Flatten gal took : 19 ms
[2024-05-22 16:26:17] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:26:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality14472371573878772676.gal : 3 ms
[2024-05-22 16:26:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality2753110846281465810.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/CTLCardinality14472371573878772676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2753110846281465810.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 16:26:47] [INFO ] Flatten gal took : 19 ms
[2024-05-22 16:26:47] [INFO ] Applying decomposition
[2024-05-22 16:26:47] [INFO ] Flatten gal took : 19 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/graph15811027398422942996.txt' '-o' '/tmp/graph15811027398422942996.bin' '-w' '/tmp/graph15811027398422942996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15811027398422942996.bin' '-l' '-1' '-v' '-w' '/tmp/graph15811027398422942996.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:26:47] [INFO ] Decomposing Gal with order
[2024-05-22 16:26:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:26:47] [INFO ] Removed a total of 277 redundant transitions.
[2024-05-22 16:26:47] [INFO ] Flatten gal took : 38 ms
[2024-05-22 16:26:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 40 labels/synchronizations in 19 ms.
[2024-05-22 16:26:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality10752273230023181237.gal : 11 ms
[2024-05-22 16:26:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality10736118397965115874.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/CTLCardinality10752273230023181237.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10736118397965115874.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 242 transitions
Trivial Post-agglo rules discarded 242 transitions
Performed 242 trivial Post agglomeration. Transition count delta: 242
Iterating post reduction 0 with 242 rules applied. Total rules applied 242 place count 1058 transition count 755
Reduce places removed 242 places and 0 transitions.
Iterating post reduction 1 with 242 rules applied. Total rules applied 484 place count 816 transition count 755
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 484 place count 816 transition count 717
Deduced a syphon composed of 38 places in 6 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 560 place count 778 transition count 717
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 3 ms
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 842 place count 637 transition count 576
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 843 place count 636 transition count 575
Applied a total of 843 rules in 54 ms. Remains 636 /1059 variables (removed 423) and now considering 575/998 (removed 423) transitions.
// Phase 1: matrix 575 rows 636 cols
[2024-05-22 16:27:18] [INFO ] Invariants computation overflowed in 71 ms
[2024-05-22 16:27:18] [INFO ] Implicit Places using invariants in 299 ms returned []
// Phase 1: matrix 575 rows 636 cols
[2024-05-22 16:27:18] [INFO ] Invariants computation overflowed in 64 ms
[2024-05-22 16:27:18] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 16:27:28] [INFO ] Implicit Places using invariants and state equation in 10726 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 11026 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 635/1059 places, 575/998 transitions.
Graph (complete) has 1671 edges and 635 vertex of which 634 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 633 transition count 573
Applied a total of 3 rules in 25 ms. Remains 633 /635 variables (removed 2) and now considering 573/575 (removed 2) transitions.
// Phase 1: matrix 573 rows 633 cols
[2024-05-22 16:27:29] [INFO ] Invariants computation overflowed in 63 ms
[2024-05-22 16:27:29] [INFO ] Implicit Places using invariants in 290 ms returned []
// Phase 1: matrix 573 rows 633 cols
[2024-05-22 16:27:29] [INFO ] Invariants computation overflowed in 75 ms
[2024-05-22 16:27:29] [INFO ] State equation strengthened by 38 read => feed constraints.
[2024-05-22 16:27:40] [INFO ] Implicit Places using invariants and state equation in 10845 ms returned []
Implicit Place search using SMT with State Equation took 11136 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 633/1059 places, 573/998 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 22242 ms. Remains : 633/1059 places, 573/998 transitions.
[2024-05-22 16:27:40] [INFO ] Flatten gal took : 15 ms
[2024-05-22 16:27:40] [INFO ] Flatten gal took : 14 ms
[2024-05-22 16:27:40] [INFO ] Input system was already deterministic with 573 transitions.
[2024-05-22 16:27:40] [INFO ] Flatten gal took : 13 ms
[2024-05-22 16:27:40] [INFO ] Flatten gal took : 13 ms
[2024-05-22 16:27:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality388358842248072053.gal : 2 ms
[2024-05-22 16:27:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality15005436476814882971.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/CTLCardinality388358842248072053.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15005436476814882971.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 16:28:10] [INFO ] Flatten gal took : 13 ms
[2024-05-22 16:28:10] [INFO ] Applying decomposition
[2024-05-22 16:28:10] [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/graph6839769309391988314.txt' '-o' '/tmp/graph6839769309391988314.bin' '-w' '/tmp/graph6839769309391988314.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6839769309391988314.bin' '-l' '-1' '-v' '-w' '/tmp/graph6839769309391988314.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:28:10] [INFO ] Decomposing Gal with order
[2024-05-22 16:28:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:28:10] [INFO ] Removed a total of 130 redundant transitions.
[2024-05-22 16:28:10] [INFO ] Flatten gal took : 22 ms
[2024-05-22 16:28:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 8 ms.
[2024-05-22 16:28:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality10548939002930441599.gal : 5 ms
[2024-05-22 16:28:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality18324764878697386587.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/CTLCardinality10548939002930441599.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18324764878697386587.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 1059/1059 places, 998/998 transitions.
Applied a total of 0 rules in 27 ms. Remains 1059 /1059 variables (removed 0) and now considering 998/998 (removed 0) transitions.
[2024-05-22 16:28:40] [INFO ] Invariant cache hit.
[2024-05-22 16:28:40] [INFO ] Implicit Places using invariants in 308 ms returned []
[2024-05-22 16:28:40] [INFO ] Invariant cache hit.
[2024-05-22 16:28:52] [INFO ] Implicit Places using invariants and state equation in 11677 ms returned []
Implicit Place search using SMT with State Equation took 11992 ms to find 0 implicit places.
Running 997 sub problems to find dead transitions.
[2024-05-22 16:28:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1058 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 997 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1058/2057 variables, and 97 constraints, problems are : Problem set: 0 solved, 997 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, Generalized P Invariants (flows): 97/98 constraints, State Equation: 0/1059 constraints, PredecessorRefiner: 997/997 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 997 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1058 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 997 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1058 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 997 unsolved
At refinement iteration 2 (OVERLAPS) 1/1059 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 997 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1059 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 997 unsolved
[2024-05-22 16:29:44] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
[2024-05-22 16:29:46] [INFO ] Deduced a trap composed of 8 places in 23 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1059/2057 variables, and 102 constraints, problems are : Problem set: 0 solved, 997 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 98/98 constraints, State Equation: 0/1059 constraints, PredecessorRefiner: 0/997 constraints, Known Traps: 2/2 constraints]
After SMT, in 60169ms problems are : Problem set: 0 solved, 997 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Finished structural reductions in LTL mode , in 1 iterations and 72207 ms. Remains : 1059/1059 places, 998/998 transitions.
[2024-05-22 16:29:52] [INFO ] Flatten gal took : 19 ms
[2024-05-22 16:29:52] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:29:52] [INFO ] Input system was already deterministic with 998 transitions.
[2024-05-22 16:29:52] [INFO ] Flatten gal took : 19 ms
[2024-05-22 16:29:52] [INFO ] Flatten gal took : 19 ms
[2024-05-22 16:29:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality8081463326212461564.gal : 3 ms
[2024-05-22 16:29:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality4257823307344868199.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/CTLCardinality8081463326212461564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4257823307344868199.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 16:30:22] [INFO ] Flatten gal took : 25 ms
[2024-05-22 16:30:22] [INFO ] Applying decomposition
[2024-05-22 16:30:22] [INFO ] Flatten gal took : 20 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/graph16389107136446967698.txt' '-o' '/tmp/graph16389107136446967698.bin' '-w' '/tmp/graph16389107136446967698.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16389107136446967698.bin' '-l' '-1' '-v' '-w' '/tmp/graph16389107136446967698.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:30:22] [INFO ] Decomposing Gal with order
[2024-05-22 16:30:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:30:23] [INFO ] Removed a total of 285 redundant transitions.
[2024-05-22 16:30:23] [INFO ] Flatten gal took : 36 ms
[2024-05-22 16:30:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 17 ms.
[2024-05-22 16:30:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality8292327831902599363.gal : 10 ms
[2024-05-22 16:30:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality4222881834582440962.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/CTLCardinality8292327831902599363.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4222881834582440962.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 16:30:53] [INFO ] Flatten gal took : 21 ms
[2024-05-22 16:30:53] [INFO ] Flatten gal took : 20 ms
[2024-05-22 16:30:53] [INFO ] Applying decomposition
[2024-05-22 16:30:53] [INFO ] Flatten gal took : 20 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/graph10644784870038984073.txt' '-o' '/tmp/graph10644784870038984073.bin' '-w' '/tmp/graph10644784870038984073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10644784870038984073.bin' '-l' '-1' '-v' '-w' '/tmp/graph10644784870038984073.weights' '-q' '0' '-e' '0.001'
[2024-05-22 16:30:53] [INFO ] Decomposing Gal with order
[2024-05-22 16:30:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 16:30:53] [INFO ] Removed a total of 296 redundant transitions.
[2024-05-22 16:30:53] [INFO ] Flatten gal took : 35 ms
[2024-05-22 16:30:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 12 ms.
[2024-05-22 16:30:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality264619715214605378.gal : 10 ms
[2024-05-22 16:30:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality10815868368766226521.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/CTLCardinality264619715214605378.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10815868368766226521.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 13 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 16:46:55] [INFO ] Flatten gal took : 24 ms
[2024-05-22 16:46:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality4466474554007786988.gal : 3 ms
[2024-05-22 16:46:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality4326200166064089219.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4466474554007786988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4326200166064089219.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 13 CTL formulae.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="DoubleExponent-PT-020"
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 DoubleExponent-PT-020, 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 r136-tall-171631132900561"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-020.tgz
mv DoubleExponent-PT-020 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 '
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 ;