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.r488-tall-171631132900559.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 ltsminxred
Input is DoubleExponent-PT-010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900559
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16: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:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 16K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 169K 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-010-ReachabilityFireability-2024-00
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-01
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-02
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-03
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-04
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-05
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-06
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-07
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-08
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-09
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-10
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2023-11
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2023-12
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2024-13
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2023-14
FORMULA_NAME DoubleExponent-PT-010-ReachabilityFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717194430202

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:27:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:27:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:27:11] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-05-31 22:27:11] [INFO ] Transformed 534 places.
[2024-05-31 22:27:11] [INFO ] Transformed 498 transitions.
[2024-05-31 22:27:11] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (1325 resets) in 1346 ms. (29 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (112 resets) in 108 ms. (36 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 68 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (110 resets) in 52 ms. (75 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (108 resets) in 77 ms. (51 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (117 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (115 resets) in 76 ms. (51 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (108 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (113 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (106 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 28 ms. (137 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (109 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (108 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (114 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (109 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (109 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 183765 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 16
Probabilistic random walk after 183765 steps, saw 91896 distinct states, run finished after 3009 ms. (steps per millisecond=61 ) properties seen :0
// Phase 1: matrix 498 rows 534 cols
[2024-05-31 22:27:15] [INFO ] Computed 54 invariants in 66 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem DoubleExponent-PT-010-ReachabilityFireability-2024-01 is UNSAT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-010-ReachabilityFireability-2024-02 is UNSAT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-010-ReachabilityFireability-2024-05 is UNSAT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleExponent-PT-010-ReachabilityFireability-2024-07 is UNSAT
FORMULA DoubleExponent-PT-010-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 266/446 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/446 variables, 2/5 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 88/534 variables, 49/54 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 0/54 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 498/1032 variables, 534/588 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1032 variables, 0/588 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/1032 variables, 0/588 constraints. Problems are: Problem set: 4 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1032/1032 variables, and 588 constraints, problems are : Problem set: 4 solved, 12 unsolved in 2266 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 534/534 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 321/405 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-05-31 22:27:18] [INFO ] Deduced a trap composed of 60 places in 140 ms of which 23 ms to minimize.
[2024-05-31 22:27:18] [INFO ] Deduced a trap composed of 311 places in 124 ms of which 3 ms to minimize.
[2024-05-31 22:27:18] [INFO ] Deduced a trap composed of 324 places in 127 ms of which 6 ms to minimize.
[2024-05-31 22:27:18] [INFO ] Deduced a trap composed of 314 places in 109 ms of which 3 ms to minimize.
[2024-05-31 22:27:18] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 3 ms to minimize.
[2024-05-31 22:27:18] [INFO ] Deduced a trap composed of 320 places in 108 ms of which 2 ms to minimize.
[2024-05-31 22:27:18] [INFO ] Deduced a trap composed of 334 places in 100 ms of which 2 ms to minimize.
[2024-05-31 22:27:19] [INFO ] Deduced a trap composed of 325 places in 102 ms of which 2 ms to minimize.
[2024-05-31 22:27:19] [INFO ] Deduced a trap composed of 318 places in 94 ms of which 3 ms to minimize.
[2024-05-31 22:27:19] [INFO ] Deduced a trap composed of 331 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:27:19] [INFO ] Deduced a trap composed of 323 places in 97 ms of which 3 ms to minimize.
[2024-05-31 22:27:19] [INFO ] Deduced a trap composed of 337 places in 96 ms of which 2 ms to minimize.
[2024-05-31 22:27:19] [INFO ] Deduced a trap composed of 328 places in 99 ms of which 2 ms to minimize.
[2024-05-31 22:27:19] [INFO ] Deduced a trap composed of 334 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:27:19] [INFO ] Deduced a trap composed of 317 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 15/16 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/16 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 10/415 variables, 2/18 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/415 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 119/534 variables, 51/69 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-05-31 22:27:20] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 3 ms to minimize.
[2024-05-31 22:27:20] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 3 ms to minimize.
[2024-05-31 22:27:20] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 3 ms to minimize.
[2024-05-31 22:27:20] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 3 ms to minimize.
[2024-05-31 22:27:21] [INFO ] Deduced a trap composed of 31 places in 138 ms of which 3 ms to minimize.
[2024-05-31 22:27:21] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 3 ms to minimize.
[2024-05-31 22:27:21] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 3 ms to minimize.
[2024-05-31 22:27:21] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 3 ms to minimize.
[2024-05-31 22:27:21] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 3 ms to minimize.
[2024-05-31 22:27:21] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 3 ms to minimize.
[2024-05-31 22:27:21] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 3 ms to minimize.
[2024-05-31 22:27:22] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 3 ms to minimize.
[2024-05-31 22:27:22] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 2 ms to minimize.
[2024-05-31 22:27:22] [INFO ] Deduced a trap composed of 192 places in 121 ms of which 2 ms to minimize.
[2024-05-31 22:27:22] [INFO ] Deduced a trap composed of 193 places in 113 ms of which 2 ms to minimize.
[2024-05-31 22:27:22] [INFO ] Deduced a trap composed of 184 places in 116 ms of which 3 ms to minimize.
[2024-05-31 22:27:22] [INFO ] Deduced a trap composed of 185 places in 119 ms of which 3 ms to minimize.
[2024-05-31 22:27:22] [INFO ] Deduced a trap composed of 205 places in 117 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 1)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 1)
(s70 1)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 1)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 1)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 1)
(s192 1)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 1)
(s250 1)
(s251 1)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 1)
(s305 1)
(s306 0)
(s307 1)
(s308 1)
(s309 2)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 1)
(s486 1)
(s487 1)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 534/1032 variables, and 87 constraints, problems are : Problem set: 4 solved, 12 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 0/534 constraints, PredecessorRefiner: 0/16 constraints, Known Traps: 33/33 constraints]
After SMT, in 7477ms problems are : Problem set: 4 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 84 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 530 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 530 transition count 443
Reduce places removed 55 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 77 rules applied. Total rules applied 133 place count 475 transition count 421
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 155 place count 453 transition count 421
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 155 place count 453 transition count 399
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 199 place count 431 transition count 399
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 5 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 299 place count 381 transition count 349
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 323 place count 369 transition count 349
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 3 with 38 rules applied. Total rules applied 361 place count 369 transition count 311
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 3 with 38 rules applied. Total rules applied 399 place count 331 transition count 311
Partial Free-agglomeration rule applied 34 times.
Drop transitions (Partial Free agglomeration) removed 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 433 place count 331 transition count 311
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 434 place count 331 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 435 place count 330 transition count 310
Applied a total of 435 rules in 171 ms. Remains 330 /534 variables (removed 204) and now considering 310/498 (removed 188) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 330/534 places, 310/498 transitions.
RANDOM walk for 40000 steps (2291 resets) in 539 ms. (74 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1772 resets) in 157 ms. (253 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (1772 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (1777 resets) in 270 ms. (147 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1769 resets) in 240 ms. (165 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1763 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1768 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1769 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (1764 resets) in 112 ms. (354 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1775 resets) in 96 ms. (412 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1780 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1758 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (1762 resets) in 104 ms. (380 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 218043 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :2 out of 12
Probabilistic random walk after 218043 steps, saw 109085 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :2
FORMULA DoubleExponent-PT-010-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA DoubleExponent-PT-010-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 310 rows 330 cols
[2024-05-31 22:27:26] [INFO ] Computed 51 invariants in 28 ms
[2024-05-31 22:27:26] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 225/264 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/268 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 36/304 variables, 14/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 310/614 variables, 304/355 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/614 variables, 22/377 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 26/640 variables, 26/403 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/640 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/640 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 640/640 variables, and 403 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1608 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 330/330 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 225/264 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 22:27:28] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 4/268 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 36/304 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/304 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 310/614 variables, 304/356 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/614 variables, 22/378 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/614 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/614 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 26/640 variables, 26/410 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/640 variables, 4/414 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 22:27:30] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 5 ms to minimize.
[2024-05-31 22:27:30] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:27:31] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:27:31] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:27:31] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:27:31] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:27:31] [INFO ] Deduced a trap composed of 30 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:27:31] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:27:31] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:27:31] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:27:32] [INFO ] Deduced a trap composed of 54 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:27:32] [INFO ] Deduced a trap composed of 55 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:27:32] [INFO ] Deduced a trap composed of 46 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:27:32] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:27:32] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/640 variables, 15/429 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 22:27:33] [INFO ] Deduced a trap composed of 65 places in 49 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/640 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/640 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/640 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 640/640 variables, and 430 constraints, problems are : Problem set: 0 solved, 10 unsolved in 7092 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 330/330 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 17/17 constraints]
After SMT, in 8745ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 30002 ms.
Support contains 39 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 310/310 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 330 transition count 306
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 326 transition count 304
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 324 transition count 304
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 12 place count 324 transition count 299
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 22 place count 319 transition count 299
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 60 place count 300 transition count 280
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 72 place count 294 transition count 281
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 83 place count 294 transition count 270
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 94 place count 283 transition count 270
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 103 place count 283 transition count 270
Applied a total of 103 rules in 66 ms. Remains 283 /330 variables (removed 47) and now considering 270/310 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 283/330 places, 270/310 transitions.
RANDOM walk for 40000 steps (3442 resets) in 151 ms. (263 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (2339 resets) in 124 ms. (320 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2418 resets) in 215 ms. (185 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2387 resets) in 227 ms. (175 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (2393 resets) in 91 ms. (434 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2401 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (2381 resets) in 72 ms. (547 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (2375 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (2405 resets) in 73 ms. (540 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (2371 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2361 resets) in 75 ms. (526 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 264902 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 10
Probabilistic random walk after 264902 steps, saw 132506 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
// Phase 1: matrix 270 rows 283 cols
[2024-05-31 22:28:09] [INFO ] Computed 51 invariants in 24 ms
[2024-05-31 22:28:09] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 199/238 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/242 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/267 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 270/537 variables, 267/318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 35/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 16/553 variables, 16/369 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/553 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/553 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 369 constraints, problems are : Problem set: 0 solved, 10 unsolved in 995 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 283/283 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 199/238 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/242 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 25/267 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 270/537 variables, 267/318 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/537 variables, 35/353 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/537 variables, 6/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 22:28:10] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/537 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/537 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 16/553 variables, 16/376 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/553 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 22:28:12] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:28:12] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:28:12] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:28:12] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:28:12] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:28:12] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:28:12] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 3 ms to minimize.
[2024-05-31 22:28:12] [INFO ] Deduced a trap composed of 34 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:28:13] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/553 variables, 9/389 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/553 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 22:28:13] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:28:13] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
At refinement iteration 16 (OVERLAPS) 0/553 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/553 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 0/553 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 553/553 variables, and 391 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4737 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 283/283 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 12/12 constraints]
After SMT, in 5772ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 34205 ms.
Support contains 39 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 270/270 transitions.
Applied a total of 0 rules in 26 ms. Remains 283 /283 variables (removed 0) and now considering 270/270 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 283/283 places, 270/270 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 270/270 transitions.
Applied a total of 0 rules in 9 ms. Remains 283 /283 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-31 22:28:49] [INFO ] Invariant cache hit.
[2024-05-31 22:28:49] [INFO ] Implicit Places using invariants in 162 ms returned [236]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 169 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 282/283 places, 270/270 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 281 transition count 269
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 281 transition count 269
Applied a total of 2 rules in 13 ms. Remains 281 /282 variables (removed 1) and now considering 269/270 (removed 1) transitions.
// Phase 1: matrix 269 rows 281 cols
[2024-05-31 22:28:49] [INFO ] Computed 50 invariants in 15 ms
[2024-05-31 22:28:49] [INFO ] Implicit Places using invariants in 148 ms returned []
[2024-05-31 22:28:49] [INFO ] Invariant cache hit.
[2024-05-31 22:28:49] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 22:28:50] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned [56, 63, 86, 92, 114, 123, 154, 179, 184, 227, 272, 278]
[2024-05-31 22:28:50] [INFO ] Actually due to overlaps returned [63, 227, 56, 154, 179, 184]
Discarding 6 places :
Implicit Place search using SMT with State Equation took 1259 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 275/283 places, 269/270 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 275 transition count 268
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 274 transition count 268
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 274 transition count 268
Applied a total of 4 rules in 43 ms. Remains 274 /275 variables (removed 1) and now considering 268/269 (removed 1) transitions.
// Phase 1: matrix 268 rows 274 cols
[2024-05-31 22:28:50] [INFO ] Computed 44 invariants in 18 ms
[2024-05-31 22:28:50] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-31 22:28:50] [INFO ] Invariant cache hit.
[2024-05-31 22:28:50] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 22:28:51] [INFO ] Implicit Places using invariants and state equation in 1203 ms returned [83, 89, 111, 120, 265, 271]
[2024-05-31 22:28:51] [INFO ] Actually due to overlaps returned [89, 83, 265, 271]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 1342 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 270/283 places, 268/270 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 270 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 269 transition count 267
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 269 transition count 267
Applied a total of 4 rules in 27 ms. Remains 269 /270 variables (removed 1) and now considering 267/268 (removed 1) transitions.
// Phase 1: matrix 267 rows 269 cols
[2024-05-31 22:28:52] [INFO ] Computed 40 invariants in 8 ms
[2024-05-31 22:28:52] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-31 22:28:52] [INFO ] Invariant cache hit.
[2024-05-31 22:28:52] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 22:28:53] [INFO ] Implicit Places using invariants and state equation in 1260 ms returned [109, 118]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1390 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 267/283 places, 267/270 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 267 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 266 transition count 266
Applied a total of 2 rules in 15 ms. Remains 266 /267 variables (removed 1) and now considering 266/267 (removed 1) transitions.
// Phase 1: matrix 266 rows 266 cols
[2024-05-31 22:28:53] [INFO ] Computed 38 invariants in 9 ms
[2024-05-31 22:28:53] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-31 22:28:53] [INFO ] Invariant cache hit.
[2024-05-31 22:28:53] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 22:28:54] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 5 : 266/283 places, 266/270 transitions.
Finished structural reductions in REACHABILITY mode , in 5 iterations and 5323 ms. Remains : 266/283 places, 266/270 transitions.
RANDOM walk for 40000 steps (3403 resets) in 117 ms. (338 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2362 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (2372 resets) in 74 ms. (533 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2402 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2385 resets) in 77 ms. (512 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2392 resets) in 72 ms. (547 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2383 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2393 resets) in 72 ms. (547 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (2384 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2379 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (2398 resets) in 71 ms. (555 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 273570 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :0 out of 10
Probabilistic random walk after 273570 steps, saw 136836 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
[2024-05-31 22:28:57] [INFO ] Invariant cache hit.
[2024-05-31 22:28:57] [INFO ] State equation strengthened by 35 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 188/227 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/231 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 16/247 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 265/512 variables, 247/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 34/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 20/532 variables, 19/338 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/532 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/532 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 0/532 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 339 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1070 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 266/266 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 188/227 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/231 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 16/247 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 265/512 variables, 247/285 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 34/319 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 6/325 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 22:28:59] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 20/532 variables, 19/345 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/532 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/532 variables, 4/350 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 22:29:00] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:29:01] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:29:01] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:29:01] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:29:01] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:29:01] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:29:01] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:29:01] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:29:01] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/532 variables, 9/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/532 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/532 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 532/532 variables, and 359 constraints, problems are : Problem set: 0 solved, 10 unsolved in 4164 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 266/266 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 10/10 constraints]
After SMT, in 5244ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 30001 ms.
Support contains 39 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 266/266 transitions.
Applied a total of 0 rules in 6 ms. Remains 266 /266 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 266/266 places, 266/266 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 266/266 transitions.
Applied a total of 0 rules in 5 ms. Remains 266 /266 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-05-31 22:29:33] [INFO ] Invariant cache hit.
[2024-05-31 22:29:33] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-31 22:29:33] [INFO ] Invariant cache hit.
[2024-05-31 22:29:33] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-31 22:29:34] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1041 ms to find 0 implicit places.
[2024-05-31 22:29:34] [INFO ] Redundant transitions in 17 ms returned []
Running 265 sub problems to find dead transitions.
[2024-05-31 22:29:34] [INFO ] Invariant cache hit.
[2024-05-31 22:29:34] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/265 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 1/266 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 266/532 variables, 266/304 constraints. Problems are: Problem set: 0 solved, 265 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 35/339 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 8 (OVERLAPS) 0/532 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 265 unsolved
No progress, stopping.
After SMT solving in domain Real declared 532/532 variables, and 339 constraints, problems are : Problem set: 0 solved, 265 unsolved in 20241 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 266/266 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/265 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/265 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (OVERLAPS) 1/266 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/266 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (OVERLAPS) 266/532 variables, 266/304 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 35/339 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/532 variables, 265/604 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-31 22:30:07] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:30:09] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/532 variables, 2/606 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-05-31 22:30:18] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:30:19] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:30:19] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:30:19] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:30:19] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:30:20] [INFO ] Deduced a trap composed of 53 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:30:20] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:30:20] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:30:20] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:30:20] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:30:21] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 0 ms to minimize.
[2024-05-31 22:30:22] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:30:22] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:30:23] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 532/532 variables, and 620 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 36/36 constraints, State Equation: 266/266 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 16/16 constraints]
After SMT, in 50330ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 50333ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51410 ms. Remains : 266/266 places, 266/266 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 266 transition count 264
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 264 transition count 264
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 4 place count 264 transition count 250
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 32 place count 250 transition count 250
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 246 transition count 246
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 246 transition count 246
Applied a total of 40 rules in 12 ms. Remains 246 /266 variables (removed 20) and now considering 246/266 (removed 20) transitions.
Running SMT prover for 10 properties.
// Phase 1: matrix 246 rows 246 cols
[2024-05-31 22:30:24] [INFO ] Computed 38 invariants in 15 ms
[2024-05-31 22:30:24] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-31 22:30:24] [INFO ] [Real]Absence check using 2 positive and 36 generalized place invariants in 21 ms returned sat
[2024-05-31 22:30:24] [INFO ] After 153ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-31 22:30:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 22:30:24] [INFO ] [Nat]Absence check using 2 positive and 36 generalized place invariants in 18 ms returned sat
[2024-05-31 22:30:25] [INFO ] After 407ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-31 22:30:25] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-31 22:30:25] [INFO ] After 443ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-05-31 22:30:25] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 2 ms to minimize.
[2024-05-31 22:30:25] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:30:26] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:30:26] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:30:26] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-31 22:30:26] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:30:26] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:30:26] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 615 ms
[2024-05-31 22:30:26] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:30:26] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:30:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2024-05-31 22:30:26] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:30:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
TRAPS : Iteration 1
[2024-05-31 22:30:27] [INFO ] Deduced a trap composed of 43 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:30:27] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:30:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 143 ms
[2024-05-31 22:30:27] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:30:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-05-31 22:30:27] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:30:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
TRAPS : Iteration 2
[2024-05-31 22:30:28] [INFO ] After 2968ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-05-31 22:30:28] [INFO ] After 3795ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 3991 ms.
[2024-05-31 22:30:28] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 2 ms.
[2024-05-31 22:30:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 266 places, 266 transitions and 1191 arcs took 7 ms.
[2024-05-31 22:30:28] [INFO ] Flatten gal took : 49 ms
Total runtime 197322 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DoubleExponent-PT-010-ReachabilityFireability-2024-03
Could not compute solution for formula : DoubleExponent-PT-010-ReachabilityFireability-2024-04
Could not compute solution for formula : DoubleExponent-PT-010-ReachabilityFireability-2024-06
Could not compute solution for formula : DoubleExponent-PT-010-ReachabilityFireability-2024-08
Could not compute solution for formula : DoubleExponent-PT-010-ReachabilityFireability-2024-10
Could not compute solution for formula : DoubleExponent-PT-010-ReachabilityFireability-2023-11
Could not compute solution for formula : DoubleExponent-PT-010-ReachabilityFireability-2023-12
Could not compute solution for formula : DoubleExponent-PT-010-ReachabilityFireability-2024-13
Could not compute solution for formula : DoubleExponent-PT-010-ReachabilityFireability-2023-14
Could not compute solution for formula : DoubleExponent-PT-010-ReachabilityFireability-2023-15

BK_STOP 1717194628969

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name DoubleExponent-PT-010-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/907/inv_0_
rfs formula name DoubleExponent-PT-010-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/907/inv_1_
rfs formula name DoubleExponent-PT-010-ReachabilityFireability-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/907/inv_2_
rfs formula name DoubleExponent-PT-010-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/907/inv_3_
rfs formula name DoubleExponent-PT-010-ReachabilityFireability-2024-10
rfs formula type EF
rfs formula formula --invariant=/tmp/907/inv_4_
rfs formula name DoubleExponent-PT-010-ReachabilityFireability-2023-11
rfs formula type AG
rfs formula formula --invariant=/tmp/907/inv_5_
rfs formula name DoubleExponent-PT-010-ReachabilityFireability-2023-12
rfs formula type EF
rfs formula formula --invariant=/tmp/907/inv_6_
rfs formula name DoubleExponent-PT-010-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/907/inv_7_
rfs formula name DoubleExponent-PT-010-ReachabilityFireability-2023-14
rfs formula type AG
rfs formula formula --invariant=/tmp/907/inv_8_
rfs formula name DoubleExponent-PT-010-ReachabilityFireability-2023-15
rfs formula type EF
rfs formula formula --invariant=/tmp/907/inv_9_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-010"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DoubleExponent-PT-010, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132900559"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;