About the Execution of LTSMin+red for Peterson-PT-7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1543.464 | 238155.00 | 304774.00 | 800.30 | FT?T?T?FF??????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r512-smll-171654407300289.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 Peterson-PT-7, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654407300289
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.8M
-rw-r--r-- 1 mcc users 264K Apr 12 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 12 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 183K Apr 12 03:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 831K Apr 12 03:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 72K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 218K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 156K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 517K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 378K Apr 12 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Apr 12 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 617K Apr 12 04:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 12 04:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 58K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-00
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-01
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-02
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-03
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-04
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-05
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-06
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-07
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-08
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-09
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-10
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-11
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-12
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-13
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-14
FORMULA_NAME Peterson-PT-7-CTLCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1717278646078
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-7
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:50:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 21:50:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:50:49] [INFO ] Load time of PNML (sax parser for PT used): 529 ms
[2024-06-01 21:50:49] [INFO ] Transformed 1992 places.
[2024-06-01 21:50:49] [INFO ] Transformed 3096 transitions.
[2024-06-01 21:50:49] [INFO ] Found NUPN structural information;
[2024-06-01 21:50:49] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 957 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 126 ms.
FORMULA Peterson-PT-7-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1923 out of 1992 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 93 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2024-06-01 21:50:50] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2024-06-01 21:50:50] [INFO ] Computed 31 invariants in 81 ms
[2024-06-01 21:50:51] [INFO ] Implicit Places using invariants in 1398 ms returned []
[2024-06-01 21:50:51] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 21:50:51] [INFO ] Invariant cache hit.
[2024-06-01 21:50:53] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 21:50:59] [INFO ] Implicit Places using invariants and state equation in 7583 ms returned []
Implicit Place search using SMT with State Equation took 9048 ms to find 0 implicit places.
Running 3088 sub problems to find dead transitions.
[2024-06-01 21:50:59] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 21:50:59] [INFO ] Invariant cache hit.
[2024-06-01 21:50:59] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1984 variables, 1984/1984 constraints. Problems are: Problem set: 0 solved, 3088 unsolved
SMT process timed out in 32234ms, After SMT, problems are : Problem set: 0 solved, 3088 unsolved
Search for dead transitions found 0 dead transitions in 32356ms
Finished structural reductions in LTL mode , in 1 iterations and 41580 ms. Remains : 1992/1992 places, 3096/3096 transitions.
Support contains 1923 out of 1992 places after structural reductions.
[2024-06-01 21:51:32] [INFO ] Flatten gal took : 289 ms
[2024-06-01 21:51:32] [INFO ] Flatten gal took : 174 ms
[2024-06-01 21:51:33] [INFO ] Input system was already deterministic with 3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 7005 ms. (5 steps per ms) remains 38/56 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 35/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 143 ms. (27 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 35/35 properties
[2024-06-01 21:51:36] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
[2024-06-01 21:51:36] [INFO ] Invariant cache hit.
[2024-06-01 21:51:36] [INFO ] State equation strengthened by 497 read => feed constraints.
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp26 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1864 variables, 1864/1864 constraints. Problems are: Problem set: 5 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1864 variables, 0/1864 constraints. Problems are: Problem set: 5 solved, 30 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 2 (OVERLAPS) 64/1928 variables, 16/1880 constraints. Problems are: Problem set: 17 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1928 variables, 64/1944 constraints. Problems are: Problem set: 17 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1928/4752 variables, and 1944 constraints, problems are : Problem set: 17 solved, 18 unsolved in 5009 ms.
Refiners :[Domain max(s): 1928/1992 constraints, Positive P Invariants (semi-flows): 16/23 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/1992 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 34/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 409/409 constraints. Problems are: Problem set: 17 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/409 constraints. Problems are: Problem set: 17 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 1511/1920 variables, 8/417 constraints. Problems are: Problem set: 17 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1920 variables, 1511/1928 constraints. Problems are: Problem set: 17 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1920 variables, 0/1928 constraints. Problems are: Problem set: 17 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 8/1928 variables, 8/1936 constraints. Problems are: Problem set: 17 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1928 variables, 8/1944 constraints. Problems are: Problem set: 17 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1928/4752 variables, and 1944 constraints, problems are : Problem set: 17 solved, 18 unsolved in 5012 ms.
Refiners :[Domain max(s): 1928/1992 constraints, Positive P Invariants (semi-flows): 16/23 constraints, Generalized P Invariants (flows): 0/8 constraints, State Equation: 0/1992 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 11642ms problems are : Problem set: 17 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 409 out of 1992 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 487 transitions
Trivial Post-agglo rules discarded 487 transitions
Performed 487 trivial Post agglomeration. Transition count delta: 487
Iterating post reduction 0 with 487 rules applied. Total rules applied 487 place count 1992 transition count 2609
Reduce places removed 487 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 492 rules applied. Total rules applied 979 place count 1505 transition count 2604
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 984 place count 1500 transition count 2604
Performed 442 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 442 Pre rules applied. Total rules applied 984 place count 1500 transition count 2162
Deduced a syphon composed of 442 places in 7 ms
Reduce places removed 442 places and 0 transitions.
Iterating global reduction 3 with 884 rules applied. Total rules applied 1868 place count 1058 transition count 2162
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 53
Deduced a syphon composed of 53 places in 6 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 106 rules applied. Total rules applied 1974 place count 1005 transition count 2109
Applied a total of 1974 rules in 731 ms. Remains 1005 /1992 variables (removed 987) and now considering 2109/3096 (removed 987) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 733 ms. Remains : 1005/1992 places, 2109/3096 transitions.
RANDOM walk for 40000 steps (8 resets) in 1126 ms. (35 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 117297 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 17
Probabilistic random walk after 117297 steps, saw 70309 distinct states, run finished after 3007 ms. (steps per millisecond=39 ) properties seen :0
[2024-06-01 21:51:52] [INFO ] Flow matrix only has 1773 transitions (discarded 336 similar events)
// Phase 1: matrix 1773 rows 1005 cols
[2024-06-01 21:51:52] [INFO ] Computed 31 invariants in 9 ms
[2024-06-01 21:51:52] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 909/933 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/933 variables, 909/941 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 8/941 variables, 8/949 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/941 variables, 8/957 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/941 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 8/949 variables, 8/965 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 8/973 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 21:51:56] [INFO ] Deduced a trap composed of 76 places in 1590 ms of which 145 ms to minimize.
[2024-06-01 21:51:57] [INFO ] Deduced a trap composed of 62 places in 1025 ms of which 14 ms to minimize.
[2024-06-01 21:51:58] [INFO ] Deduced a trap composed of 117 places in 741 ms of which 8 ms to minimize.
[2024-06-01 21:51:59] [INFO ] Deduced a trap composed of 158 places in 611 ms of which 7 ms to minimize.
[2024-06-01 21:51:59] [INFO ] Deduced a trap composed of 130 places in 651 ms of which 8 ms to minimize.
[2024-06-01 21:52:00] [INFO ] Deduced a trap composed of 144 places in 462 ms of which 6 ms to minimize.
[2024-06-01 21:52:00] [INFO ] Deduced a trap composed of 88 places in 278 ms of which 4 ms to minimize.
[2024-06-01 21:52:01] [INFO ] Deduced a trap composed of 90 places in 1029 ms of which 11 ms to minimize.
[2024-06-01 21:52:03] [INFO ] Deduced a trap composed of 106 places in 838 ms of which 9 ms to minimize.
[2024-06-01 21:52:03] [INFO ] Deduced a trap composed of 120 places in 601 ms of which 8 ms to minimize.
[2024-06-01 21:52:04] [INFO ] Deduced a trap composed of 134 places in 432 ms of which 6 ms to minimize.
[2024-06-01 21:52:05] [INFO ] Deduced a trap composed of 147 places in 783 ms of which 9 ms to minimize.
[2024-06-01 21:52:05] [INFO ] Deduced a trap composed of 161 places in 563 ms of which 7 ms to minimize.
[2024-06-01 21:52:06] [INFO ] Deduced a trap composed of 133 places in 394 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 14/987 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 1773/2722 variables, 949/1936 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2722 variables, 497/2433 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2722 variables, 0/2433 constraints. Problems are: Problem set: 0 solved, 17 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 56/2778 variables, 56/2489 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2778 variables, 56/2545 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2778 variables, 7/2552 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2778 variables, 0/2552 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 0/2778 variables, 0/2552 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2778/2778 variables, and 2552 constraints, problems are : Problem set: 0 solved, 17 unsolved in 28321 ms.
Refiners :[Domain max(s): 1005/1005 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1005/1005 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 24/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 909/933 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/933 variables, 909/941 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/933 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 8/941 variables, 8/949 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/941 variables, 8/957 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/941 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 8/949 variables, 8/965 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/949 variables, 8/973 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/949 variables, 14/987 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 21:52:23] [INFO ] Deduced a trap composed of 175 places in 369 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/949 variables, 1/988 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/949 variables, 0/988 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (OVERLAPS) 1773/2722 variables, 949/1937 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2722 variables, 497/2434 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2722 variables, 16/2450 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2722 variables, 0/2450 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 56/2778 variables, 56/2506 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2778 variables, 56/2562 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2778 variables, 7/2569 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2778 variables, 1/2570 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 21:52:35] [INFO ] Deduced a trap composed of 29 places in 1021 ms of which 8 ms to minimize.
[2024-06-01 21:52:36] [INFO ] Deduced a trap composed of 16 places in 1431 ms of which 14 ms to minimize.
[2024-06-01 21:52:38] [INFO ] Deduced a trap composed of 12 places in 1434 ms of which 14 ms to minimize.
[2024-06-01 21:52:39] [INFO ] Deduced a trap composed of 32 places in 1334 ms of which 14 ms to minimize.
[2024-06-01 21:52:40] [INFO ] Deduced a trap composed of 14 places in 1195 ms of which 9 ms to minimize.
[2024-06-01 21:52:41] [INFO ] Deduced a trap composed of 16 places in 865 ms of which 9 ms to minimize.
[2024-06-01 21:52:42] [INFO ] Deduced a trap composed of 18 places in 877 ms of which 10 ms to minimize.
[2024-06-01 21:52:43] [INFO ] Deduced a trap composed of 16 places in 1211 ms of which 15 ms to minimize.
[2024-06-01 21:52:45] [INFO ] Deduced a trap composed of 22 places in 1255 ms of which 14 ms to minimize.
[2024-06-01 21:52:46] [INFO ] Deduced a trap composed of 24 places in 1484 ms of which 17 ms to minimize.
[2024-06-01 21:52:48] [INFO ] Deduced a trap composed of 18 places in 1453 ms of which 25 ms to minimize.
[2024-06-01 21:52:49] [INFO ] Deduced a trap composed of 12 places in 1393 ms of which 15 ms to minimize.
[2024-06-01 21:52:51] [INFO ] Deduced a trap composed of 76 places in 1302 ms of which 14 ms to minimize.
[2024-06-01 21:52:52] [INFO ] Deduced a trap composed of 32 places in 1257 ms of which 14 ms to minimize.
[2024-06-01 21:52:53] [INFO ] Deduced a trap composed of 50 places in 1158 ms of which 13 ms to minimize.
[2024-06-01 21:52:55] [INFO ] Deduced a trap composed of 26 places in 1147 ms of which 9 ms to minimize.
[2024-06-01 21:52:56] [INFO ] Deduced a trap composed of 58 places in 1269 ms of which 14 ms to minimize.
[2024-06-01 21:52:57] [INFO ] Deduced a trap composed of 22 places in 1336 ms of which 13 ms to minimize.
[2024-06-01 21:52:59] [INFO ] Deduced a trap composed of 30 places in 1283 ms of which 13 ms to minimize.
[2024-06-01 21:53:00] [INFO ] Deduced a trap composed of 51 places in 1205 ms of which 22 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2778 variables, 20/2590 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 21:53:03] [INFO ] Deduced a trap composed of 28 places in 1275 ms of which 13 ms to minimize.
[2024-06-01 21:53:05] [INFO ] Deduced a trap composed of 55 places in 1289 ms of which 15 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2778/2778 variables, and 2592 constraints, problems are : Problem set: 0 solved, 17 unsolved in 45015 ms.
Refiners :[Domain max(s): 1005/1005 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 1005/1005 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 37/37 constraints]
After SMT, in 73386ms problems are : Problem set: 0 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 1005 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1005/1005 places, 2109/2109 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 1005 transition count 2101
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 997 transition count 2101
Performed 371 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 371 Pre rules applied. Total rules applied 16 place count 997 transition count 1730
Deduced a syphon composed of 371 places in 4 ms
Reduce places removed 371 places and 0 transitions.
Iterating global reduction 2 with 742 rules applied. Total rules applied 758 place count 626 transition count 1730
Applied a total of 758 rules in 236 ms. Remains 626 /1005 variables (removed 379) and now considering 1730/2109 (removed 379) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 626/1005 places, 1730/2109 transitions.
RANDOM walk for 40000 steps (8 resets) in 896 ms. (44 steps per ms) remains 16/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 239229 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 16
Probabilistic random walk after 239229 steps, saw 47456 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-06-01 21:53:09] [INFO ] Flow matrix only has 1394 transitions (discarded 336 similar events)
// Phase 1: matrix 1394 rows 626 cols
[2024-06-01 21:53:09] [INFO ] Computed 31 invariants in 8 ms
[2024-06-01 21:53:09] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 532/554 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/554 variables, 532/562 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 8/562 variables, 8/570 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 8/578 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 8/570 variables, 8/586 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 8/594 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 21:53:10] [INFO ] Deduced a trap composed of 116 places in 654 ms of which 9 ms to minimize.
[2024-06-01 21:53:11] [INFO ] Deduced a trap composed of 60 places in 486 ms of which 6 ms to minimize.
[2024-06-01 21:53:11] [INFO ] Deduced a trap composed of 88 places in 573 ms of which 8 ms to minimize.
[2024-06-01 21:53:12] [INFO ] Deduced a trap composed of 81 places in 487 ms of which 7 ms to minimize.
[2024-06-01 21:53:12] [INFO ] Deduced a trap composed of 48 places in 384 ms of which 5 ms to minimize.
[2024-06-01 21:53:13] [INFO ] Deduced a trap composed of 90 places in 470 ms of which 5 ms to minimize.
[2024-06-01 21:53:13] [INFO ] Deduced a trap composed of 75 places in 395 ms of which 5 ms to minimize.
[2024-06-01 21:53:14] [INFO ] Deduced a trap composed of 82 places in 266 ms of which 4 ms to minimize.
[2024-06-01 21:53:14] [INFO ] Deduced a trap composed of 97 places in 171 ms of which 3 ms to minimize.
[2024-06-01 21:53:14] [INFO ] Deduced a trap composed of 55 places in 345 ms of which 5 ms to minimize.
[2024-06-01 21:53:15] [INFO ] Deduced a trap composed of 73 places in 475 ms of which 6 ms to minimize.
[2024-06-01 21:53:15] [INFO ] Deduced a trap composed of 105 places in 271 ms of which 4 ms to minimize.
[2024-06-01 21:53:16] [INFO ] Deduced a trap composed of 93 places in 352 ms of which 5 ms to minimize.
[2024-06-01 21:53:16] [INFO ] Deduced a trap composed of 86 places in 354 ms of which 6 ms to minimize.
[2024-06-01 21:53:16] [INFO ] Deduced a trap composed of 99 places in 269 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 15/609 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/570 variables, 0/609 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (OVERLAPS) 1394/1964 variables, 570/1179 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1964 variables, 497/1676 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1964 variables, 0/1676 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 56/2020 variables, 56/1732 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2020 variables, 56/1788 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2020 variables, 7/1795 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2020 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (OVERLAPS) 0/2020 variables, 0/1795 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2020/2020 variables, and 1795 constraints, problems are : Problem set: 0 solved, 16 unsolved in 13760 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 626/626 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 532/554 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/554 variables, 532/562 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 8/562 variables, 8/570 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 8/578 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/562 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 8/570 variables, 8/586 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/570 variables, 8/594 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/570 variables, 15/609 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 21:53:24] [INFO ] Deduced a trap composed of 68 places in 144 ms of which 3 ms to minimize.
[2024-06-01 21:53:24] [INFO ] Deduced a trap composed of 90 places in 370 ms of which 4 ms to minimize.
[2024-06-01 21:53:25] [INFO ] Deduced a trap composed of 78 places in 579 ms of which 7 ms to minimize.
[2024-06-01 21:53:26] [INFO ] Deduced a trap composed of 62 places in 510 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/570 variables, 4/613 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/570 variables, 0/613 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (OVERLAPS) 1394/1964 variables, 570/1183 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1964 variables, 497/1680 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1964 variables, 15/1695 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1964 variables, 0/1695 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (OVERLAPS) 56/2020 variables, 56/1751 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2020 variables, 56/1807 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2020 variables, 7/1814 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2020 variables, 1/1815 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 21:53:32] [INFO ] Deduced a trap composed of 45 places in 662 ms of which 9 ms to minimize.
[2024-06-01 21:53:33] [INFO ] Deduced a trap composed of 29 places in 860 ms of which 9 ms to minimize.
[2024-06-01 21:53:34] [INFO ] Deduced a trap composed of 12 places in 869 ms of which 8 ms to minimize.
[2024-06-01 21:53:34] [INFO ] Deduced a trap composed of 11 places in 701 ms of which 9 ms to minimize.
[2024-06-01 21:53:35] [INFO ] Deduced a trap composed of 13 places in 824 ms of which 9 ms to minimize.
[2024-06-01 21:53:36] [INFO ] Deduced a trap composed of 15 places in 867 ms of which 8 ms to minimize.
[2024-06-01 21:53:37] [INFO ] Deduced a trap composed of 13 places in 852 ms of which 8 ms to minimize.
[2024-06-01 21:53:38] [INFO ] Deduced a trap composed of 21 places in 912 ms of which 10 ms to minimize.
[2024-06-01 21:53:39] [INFO ] Deduced a trap composed of 11 places in 956 ms of which 9 ms to minimize.
[2024-06-01 21:53:40] [INFO ] Deduced a trap composed of 25 places in 859 ms of which 8 ms to minimize.
[2024-06-01 21:53:41] [INFO ] Deduced a trap composed of 69 places in 852 ms of which 8 ms to minimize.
[2024-06-01 21:53:42] [INFO ] Deduced a trap composed of 42 places in 893 ms of which 9 ms to minimize.
[2024-06-01 21:53:43] [INFO ] Deduced a trap composed of 42 places in 781 ms of which 9 ms to minimize.
[2024-06-01 21:53:44] [INFO ] Deduced a trap composed of 42 places in 793 ms of which 8 ms to minimize.
[2024-06-01 21:53:44] [INFO ] Deduced a trap composed of 20 places in 806 ms of which 9 ms to minimize.
[2024-06-01 21:53:45] [INFO ] Deduced a trap composed of 33 places in 760 ms of which 9 ms to minimize.
[2024-06-01 21:53:46] [INFO ] Deduced a trap composed of 62 places in 764 ms of which 8 ms to minimize.
[2024-06-01 21:53:47] [INFO ] Deduced a trap composed of 44 places in 749 ms of which 8 ms to minimize.
[2024-06-01 21:53:48] [INFO ] Deduced a trap composed of 23 places in 734 ms of which 9 ms to minimize.
[2024-06-01 21:53:49] [INFO ] Deduced a trap composed of 22 places in 771 ms of which 8 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2020 variables, 20/1835 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 21:53:51] [INFO ] Deduced a trap composed of 20 places in 717 ms of which 8 ms to minimize.
[2024-06-01 21:53:51] [INFO ] Deduced a trap composed of 12 places in 757 ms of which 8 ms to minimize.
[2024-06-01 21:53:52] [INFO ] Deduced a trap composed of 21 places in 747 ms of which 8 ms to minimize.
[2024-06-01 21:53:53] [INFO ] Deduced a trap composed of 56 places in 594 ms of which 7 ms to minimize.
[2024-06-01 21:53:54] [INFO ] Deduced a trap composed of 31 places in 658 ms of which 8 ms to minimize.
[2024-06-01 21:53:54] [INFO ] Deduced a trap composed of 39 places in 796 ms of which 9 ms to minimize.
[2024-06-01 21:53:55] [INFO ] Deduced a trap composed of 25 places in 734 ms of which 8 ms to minimize.
[2024-06-01 21:53:56] [INFO ] Deduced a trap composed of 31 places in 491 ms of which 6 ms to minimize.
[2024-06-01 21:53:57] [INFO ] Deduced a trap composed of 29 places in 759 ms of which 9 ms to minimize.
[2024-06-01 21:53:57] [INFO ] Deduced a trap composed of 25 places in 723 ms of which 8 ms to minimize.
[2024-06-01 21:53:58] [INFO ] Deduced a trap composed of 29 places in 632 ms of which 8 ms to minimize.
[2024-06-01 21:53:59] [INFO ] Deduced a trap composed of 40 places in 539 ms of which 5 ms to minimize.
[2024-06-01 21:54:00] [INFO ] Deduced a trap composed of 20 places in 745 ms of which 8 ms to minimize.
[2024-06-01 21:54:01] [INFO ] Deduced a trap composed of 15 places in 799 ms of which 8 ms to minimize.
[2024-06-01 21:54:02] [INFO ] Deduced a trap composed of 57 places in 792 ms of which 8 ms to minimize.
[2024-06-01 21:54:02] [INFO ] Deduced a trap composed of 37 places in 700 ms of which 11 ms to minimize.
[2024-06-01 21:54:03] [INFO ] Deduced a trap composed of 21 places in 698 ms of which 8 ms to minimize.
[2024-06-01 21:54:04] [INFO ] Deduced a trap composed of 22 places in 670 ms of which 7 ms to minimize.
[2024-06-01 21:54:05] [INFO ] Deduced a trap composed of 55 places in 545 ms of which 5 ms to minimize.
[2024-06-01 21:54:05] [INFO ] Deduced a trap composed of 53 places in 369 ms of which 5 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2020 variables, 20/1855 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 21:54:07] [INFO ] Deduced a trap composed of 21 places in 636 ms of which 8 ms to minimize.
[2024-06-01 21:54:09] [INFO ] Deduced a trap composed of 31 places in 679 ms of which 8 ms to minimize.
[2024-06-01 21:54:09] [INFO ] Deduced a trap composed of 40 places in 700 ms of which 7 ms to minimize.
[2024-06-01 21:54:10] [INFO ] Deduced a trap composed of 86 places in 654 ms of which 8 ms to minimize.
[2024-06-01 21:54:11] [INFO ] Deduced a trap composed of 40 places in 653 ms of which 7 ms to minimize.
[2024-06-01 21:54:11] [INFO ] Deduced a trap composed of 40 places in 532 ms of which 7 ms to minimize.
[2024-06-01 21:54:12] [INFO ] Deduced a trap composed of 35 places in 638 ms of which 6 ms to minimize.
[2024-06-01 21:54:13] [INFO ] Deduced a trap composed of 41 places in 589 ms of which 7 ms to minimize.
[2024-06-01 21:54:14] [INFO ] Deduced a trap composed of 51 places in 589 ms of which 8 ms to minimize.
[2024-06-01 21:54:14] [INFO ] Deduced a trap composed of 31 places in 704 ms of which 8 ms to minimize.
[2024-06-01 21:54:15] [INFO ] Deduced a trap composed of 34 places in 738 ms of which 7 ms to minimize.
[2024-06-01 21:54:16] [INFO ] Deduced a trap composed of 36 places in 668 ms of which 8 ms to minimize.
[2024-06-01 21:54:17] [INFO ] Deduced a trap composed of 52 places in 701 ms of which 9 ms to minimize.
[2024-06-01 21:54:18] [INFO ] Deduced a trap composed of 27 places in 717 ms of which 10 ms to minimize.
[2024-06-01 21:54:18] [INFO ] Deduced a trap composed of 32 places in 714 ms of which 8 ms to minimize.
[2024-06-01 21:54:19] [INFO ] Deduced a trap composed of 29 places in 691 ms of which 8 ms to minimize.
[2024-06-01 21:54:20] [INFO ] Deduced a trap composed of 21 places in 658 ms of which 8 ms to minimize.
[2024-06-01 21:54:21] [INFO ] Deduced a trap composed of 12 places in 562 ms of which 8 ms to minimize.
[2024-06-01 21:54:21] [INFO ] Deduced a trap composed of 32 places in 526 ms of which 8 ms to minimize.
[2024-06-01 21:54:22] [INFO ] Deduced a trap composed of 34 places in 634 ms of which 7 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/2020 variables, 20/1875 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 21:54:25] [INFO ] Deduced a trap composed of 41 places in 595 ms of which 8 ms to minimize.
[2024-06-01 21:54:26] [INFO ] Deduced a trap composed of 38 places in 613 ms of which 7 ms to minimize.
[2024-06-01 21:54:26] [INFO ] Deduced a trap composed of 42 places in 608 ms of which 7 ms to minimize.
[2024-06-01 21:54:27] [INFO ] Deduced a trap composed of 63 places in 561 ms of which 7 ms to minimize.
[2024-06-01 21:54:28] [INFO ] Deduced a trap composed of 73 places in 612 ms of which 7 ms to minimize.
[2024-06-01 21:54:28] [INFO ] Deduced a trap composed of 77 places in 598 ms of which 8 ms to minimize.
[2024-06-01 21:54:29] [INFO ] Deduced a trap composed of 54 places in 471 ms of which 6 ms to minimize.
[2024-06-01 21:54:29] [INFO ] Deduced a trap composed of 42 places in 484 ms of which 6 ms to minimize.
[2024-06-01 21:54:30] [INFO ] Deduced a trap composed of 63 places in 591 ms of which 7 ms to minimize.
[2024-06-01 21:54:31] [INFO ] Deduced a trap composed of 46 places in 573 ms of which 7 ms to minimize.
[2024-06-01 21:54:31] [INFO ] Deduced a trap composed of 46 places in 606 ms of which 7 ms to minimize.
[2024-06-01 21:54:32] [INFO ] Deduced a trap composed of 46 places in 500 ms of which 7 ms to minimize.
[2024-06-01 21:54:33] [INFO ] Deduced a trap composed of 64 places in 586 ms of which 6 ms to minimize.
[2024-06-01 21:54:33] [INFO ] Deduced a trap composed of 50 places in 597 ms of which 7 ms to minimize.
[2024-06-01 21:54:34] [INFO ] Deduced a trap composed of 83 places in 550 ms of which 7 ms to minimize.
[2024-06-01 21:54:34] [INFO ] Deduced a trap composed of 60 places in 504 ms of which 6 ms to minimize.
[2024-06-01 21:54:35] [INFO ] Deduced a trap composed of 42 places in 636 ms of which 7 ms to minimize.
[2024-06-01 21:54:36] [INFO ] Deduced a trap composed of 50 places in 450 ms of which 6 ms to minimize.
[2024-06-01 21:54:36] [INFO ] Deduced a trap composed of 77 places in 570 ms of which 7 ms to minimize.
[2024-06-01 21:54:37] [INFO ] Deduced a trap composed of 51 places in 496 ms of which 6 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2020 variables, 20/1895 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2020/2020 variables, and 1895 constraints, problems are : Problem set: 0 solved, 16 unsolved in 75012 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 626/626 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 99/99 constraints]
After SMT, in 88814ms problems are : Problem set: 0 solved, 16 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1730/1730 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 626 transition count 1729
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 625 transition count 1729
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 625 transition count 1727
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 623 transition count 1727
Applied a total of 6 rules in 147 ms. Remains 623 /626 variables (removed 3) and now considering 1727/1730 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 623/626 places, 1727/1730 transitions.
Successfully simplified 17 atomic propositions for a total of 15 simplifications.
FORMULA Peterson-PT-7-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 21:54:38] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-06-01 21:54:38] [INFO ] Flatten gal took : 178 ms
FORMULA Peterson-PT-7-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-7-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 21:54:38] [INFO ] Flatten gal took : 182 ms
[2024-06-01 21:54:38] [INFO ] Input system was already deterministic with 3096 transitions.
Support contains 1037 out of 1992 places (down from 1479) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 86 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:54:39] [INFO ] Flatten gal took : 89 ms
[2024-06-01 21:54:39] [INFO ] Flatten gal took : 97 ms
[2024-06-01 21:54:39] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 99 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:54:39] [INFO ] Flatten gal took : 83 ms
[2024-06-01 21:54:39] [INFO ] Flatten gal took : 94 ms
[2024-06-01 21:54:39] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 392 transitions
Trivial Post-agglo rules discarded 392 transitions
Performed 392 trivial Post agglomeration. Transition count delta: 392
Iterating post reduction 0 with 392 rules applied. Total rules applied 392 place count 1992 transition count 2704
Reduce places removed 392 places and 0 transitions.
Performed 392 Post agglomeration using F-continuation condition.Transition count delta: 392
Iterating post reduction 1 with 784 rules applied. Total rules applied 1176 place count 1600 transition count 2312
Reduce places removed 392 places and 0 transitions.
Iterating post reduction 2 with 392 rules applied. Total rules applied 1568 place count 1208 transition count 2312
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 112 Pre rules applied. Total rules applied 1568 place count 1208 transition count 2200
Deduced a syphon composed of 112 places in 1 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 224 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Applied a total of 1792 rules in 219 ms. Remains 1096 /1992 variables (removed 896) and now considering 2200/3096 (removed 896) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 220 ms. Remains : 1096/1992 places, 2200/3096 transitions.
[2024-06-01 21:54:40] [INFO ] Flatten gal took : 58 ms
[2024-06-01 21:54:40] [INFO ] Flatten gal took : 67 ms
[2024-06-01 21:54:40] [INFO ] Input system was already deterministic with 2200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 84 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:54:40] [INFO ] Flatten gal took : 74 ms
[2024-06-01 21:54:40] [INFO ] Flatten gal took : 81 ms
[2024-06-01 21:54:40] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 85 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:54:41] [INFO ] Flatten gal took : 72 ms
[2024-06-01 21:54:41] [INFO ] Flatten gal took : 82 ms
[2024-06-01 21:54:41] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 890 transitions
Trivial Post-agglo rules discarded 890 transitions
Performed 890 trivial Post agglomeration. Transition count delta: 890
Iterating post reduction 0 with 890 rules applied. Total rules applied 890 place count 1992 transition count 2206
Reduce places removed 890 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 892 rules applied. Total rules applied 1782 place count 1102 transition count 2204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1784 place count 1100 transition count 2204
Performed 445 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 445 Pre rules applied. Total rules applied 1784 place count 1100 transition count 1759
Deduced a syphon composed of 445 places in 1 ms
Reduce places removed 445 places and 0 transitions.
Iterating global reduction 3 with 890 rules applied. Total rules applied 2674 place count 655 transition count 1759
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 2786 place count 599 transition count 1703
Applied a total of 2786 rules in 206 ms. Remains 599 /1992 variables (removed 1393) and now considering 1703/3096 (removed 1393) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 206 ms. Remains : 599/1992 places, 1703/3096 transitions.
[2024-06-01 21:54:41] [INFO ] Flatten gal took : 39 ms
[2024-06-01 21:54:41] [INFO ] Flatten gal took : 46 ms
[2024-06-01 21:54:41] [INFO ] Input system was already deterministic with 1703 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 83 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:54:41] [INFO ] Flatten gal took : 68 ms
[2024-06-01 21:54:42] [INFO ] Flatten gal took : 82 ms
[2024-06-01 21:54:42] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 124 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 125 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:54:42] [INFO ] Flatten gal took : 94 ms
[2024-06-01 21:54:42] [INFO ] Flatten gal took : 109 ms
[2024-06-01 21:54:42] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 82 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:54:42] [INFO ] Flatten gal took : 65 ms
[2024-06-01 21:54:43] [INFO ] Flatten gal took : 75 ms
[2024-06-01 21:54:43] [INFO ] Input system was already deterministic with 3096 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 83 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84 ms. Remains : 1992/1992 places, 3096/3096 transitions.
[2024-06-01 21:54:43] [INFO ] Flatten gal took : 59 ms
[2024-06-01 21:54:43] [INFO ] Flatten gal took : 68 ms
[2024-06-01 21:54:43] [INFO ] Input system was already deterministic with 3096 transitions.
[2024-06-01 21:54:43] [INFO ] Flatten gal took : 72 ms
[2024-06-01 21:54:43] [INFO ] Flatten gal took : 77 ms
[2024-06-01 21:54:43] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-01 21:54:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1992 places, 3096 transitions and 9584 arcs took 21 ms.
Total runtime 235092 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : Peterson-PT-7-CTLCardinality-2024-02
Could not compute solution for formula : Peterson-PT-7-CTLCardinality-2024-04
Could not compute solution for formula : Peterson-PT-7-CTLCardinality-2024-06
Could not compute solution for formula : Peterson-PT-7-CTLCardinality-2024-09
Could not compute solution for formula : Peterson-PT-7-CTLCardinality-2024-10
Could not compute solution for formula : Peterson-PT-7-CTLCardinality-2024-11
Could not compute solution for formula : Peterson-PT-7-CTLCardinality-2024-12
Could not compute solution for formula : Peterson-PT-7-CTLCardinality-2024-13
Could not compute solution for formula : Peterson-PT-7-CTLCardinality-2024-14
Could not compute solution for formula : Peterson-PT-7-CTLCardinality-2024-15
BK_STOP 1717278884233
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name Peterson-PT-7-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/963/ctl_0_
ctl formula name Peterson-PT-7-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/963/ctl_1_
ctl formula name Peterson-PT-7-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/963/ctl_2_
ctl formula name Peterson-PT-7-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/963/ctl_3_
ctl formula name Peterson-PT-7-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/963/ctl_4_
ctl formula name Peterson-PT-7-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/963/ctl_5_
ctl formula name Peterson-PT-7-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/963/ctl_6_
ctl formula name Peterson-PT-7-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/963/ctl_7_
ctl formula name Peterson-PT-7-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/963/ctl_8_
ctl formula name Peterson-PT-7-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/963/ctl_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="Peterson-PT-7"
export BK_EXAMINATION="CTLCardinality"
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 Peterson-PT-7, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407300289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-7 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;