About the Execution of LTSMin+red for SimpleLoadBal-PT-20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14536.567 | 815177.00 | 1254026.00 | 2398.40 | F | 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.r534-smll-171683819400114.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 SimpleLoadBal-PT-20, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r534-smll-171683819400114
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.7K Apr 23 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 12:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 13 12:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 13 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 13 12:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 2.0M 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
FORMULA_NAME Liveness
=== Now, execution of the tool begins
BK_START 1717250922182
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SimpleLoadBal-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:08:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-06-01 14:08:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:08:44] [INFO ] Load time of PNML (sax parser for PT used): 374 ms
[2024-06-01 14:08:44] [INFO ] Transformed 194 places.
[2024-06-01 14:08:44] [INFO ] Transformed 2205 transitions.
[2024-06-01 14:08:44] [INFO ] Found NUPN structural information;
[2024-06-01 14:08:44] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_idle_11, P_client_idle_12, P_client_idle_13, P_client_idle_14, P_client_idle_15, P_client_idle_16, P_client_idle_17, P_client_idle_18, P_client_idle_19, P_client_idle_20, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_waiting_11, P_client_waiting_12, P_client_waiting_13, P_client_waiting_14, P_client_waiting_15, P_client_waiting_16, P_client_waiting_17, P_client_waiting_18, P_client_waiting_19, P_client_waiting_20, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_request_11, P_client_request_12, P_client_request_13, P_client_request_14, P_client_request_15, P_client_request_16, P_client_request_17, P_client_request_18, P_client_request_19, P_client_request_20, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, P_client_ack_11, P_client_ack_12, P_client_ack_13, P_client_ack_14, P_client_ack_15, P_client_ack_16, P_client_ack_17, P_client_ack_18, P_client_ack_19, P_client_ack_20, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_server_request_11_1, P_server_request_11_2, P_server_request_12_1, P_server_request_12_2, P_server_request_13_1, P_server_request_13_2, P_server_request_14_1, P_server_request_14_2, P_server_request_15_1, P_server_request_15_2, P_server_request_16_1, P_server_request_16_2, P_server_request_17_1, P_server_request_17_2, P_server_request_18_1, P_server_request_18_2, P_server_request_19_1, P_server_request_19_2, P_server_request_20_1, P_server_request_20_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_routing_1_11, P_lb_routing_1_12, P_lb_routing_1_13, P_lb_routing_1_14, P_lb_routing_1_15, P_lb_routing_1_16, P_lb_routing_1_17, P_lb_routing_1_18, P_lb_routing_1_19, P_lb_routing_1_20, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_1_11, P_lb_load_1_12, P_lb_load_1_13, P_lb_load_1_14, P_lb_load_1_15, P_lb_load_1_16, P_lb_load_1_17, P_lb_load_1_18, P_lb_load_1_19, P_lb_load_1_20, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10, P_lb_load_2_11, P_lb_load_2_12, P_lb_load_2_13, P_lb_load_2_14, P_lb_load_2_15, P_lb_load_2_16, P_lb_load_2_17, P_lb_load_2_18, P_lb_load_2_19, P_lb_load_2_20]
[2024-06-01 14:08:44] [INFO ] Parsed PT model containing 194 places and 2205 transitions and 15678 arcs in 647 ms.
Built sparse matrix representations for Structural reductions in 21 ms.20789KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 194/194 places, 2205/2205 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 392 ms. Remains 194 /194 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 421 ms. Remains : 194/194 places, 2205/2205 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 194/194 places, 2205/2205 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 176 ms. Remains 194 /194 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
[2024-06-01 14:08:46] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2024-06-01 14:08:46] [INFO ] Invariants computation overflowed in 56 ms
[2024-06-01 14:08:46] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-06-01 14:08:46] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2024-06-01 14:08:46] [INFO ] Invariants computation overflowed in 19 ms
[2024-06-01 14:08:47] [INFO ] State equation strengthened by 820 read => feed constraints.
[2024-06-01 14:08:47] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 1823 ms to find 0 implicit places.
[2024-06-01 14:08:48] [INFO ] Redundant transitions in 267 ms returned []
Running 2185 sub problems to find dead transitions.
[2024-06-01 14:08:48] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2024-06-01 14:08:48] [INFO ] Invariants computation overflowed in 15 ms
[2024-06-01 14:08:48] [INFO ] State equation strengthened by 820 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 2185 unsolved
Error getting values : (error "ParserException while parsing response: ((s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 174/1939 variables, and 174 constraints, problems are : Problem set: 0 solved, 2185 unsolved in 30131 ms.
Refiners :[Domain max(s): 174/194 constraints, State Equation: 0/194 constraints, ReadFeed: 0/820 constraints, PredecessorRefiner: 2185/2125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2185 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 174/174 constraints. Problems are: Problem set: 0 solved, 2185 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/174 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2185 unsolved
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD488 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD492 is UNSAT
Problem TDEAD493 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD496 is UNSAT
Problem TDEAD497 is UNSAT
Problem TDEAD498 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD501 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD527 is UNSAT
Problem TDEAD528 is UNSAT
Problem TDEAD529 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD533 is UNSAT
Problem TDEAD534 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD537 is UNSAT
Problem TDEAD538 is UNSAT
Problem TDEAD539 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD541 is UNSAT
Problem TDEAD542 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD581 is UNSAT
Problem TDEAD582 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD606 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD609 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD646 is UNSAT
Problem TDEAD647 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD649 is UNSAT
Problem TDEAD650 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD653 is UNSAT
Problem TDEAD654 is UNSAT
Problem TDEAD655 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD659 is UNSAT
Problem TDEAD660 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD686 is UNSAT
Problem TDEAD687 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD689 is UNSAT
Problem TDEAD690 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD692 is UNSAT
Problem TDEAD693 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD695 is UNSAT
Problem TDEAD696 is UNSAT
Problem TDEAD697 is UNSAT
Problem TDEAD698 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD701 is UNSAT
Problem TDEAD702 is UNSAT
Problem TDEAD703 is UNSAT
Problem TDEAD726 is UNSAT
Problem TDEAD727 is UNSAT
Problem TDEAD728 is UNSAT
Problem TDEAD729 is UNSAT
Problem TDEAD730 is UNSAT
Problem TDEAD731 is UNSAT
Problem TDEAD732 is UNSAT
Problem TDEAD733 is UNSAT
Problem TDEAD734 is UNSAT
Problem TDEAD735 is UNSAT
Problem TDEAD736 is UNSAT
Problem TDEAD737 is UNSAT
Problem TDEAD738 is UNSAT
Problem TDEAD739 is UNSAT
Problem TDEAD740 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD766 is UNSAT
Problem TDEAD767 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD769 is UNSAT
Problem TDEAD770 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD772 is UNSAT
Problem TDEAD773 is UNSAT
Problem TDEAD774 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD776 is UNSAT
Problem TDEAD777 is UNSAT
Problem TDEAD778 is UNSAT
Problem TDEAD779 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD781 is UNSAT
Problem TDEAD782 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD806 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD856 is UNSAT
Problem TDEAD857 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD895 is UNSAT
Problem TDEAD896 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD921 is UNSAT
Problem TDEAD922 is UNSAT
Problem TDEAD923 is UNSAT
Problem TDEAD935 is UNSAT
Problem TDEAD936 is UNSAT
Problem TDEAD937 is UNSAT
Problem TDEAD938 is UNSAT
Problem TDEAD939 is UNSAT
Problem TDEAD940 is UNSAT
Problem TDEAD941 is UNSAT
Problem TDEAD942 is UNSAT
Problem TDEAD943 is UNSAT
Problem TDEAD955 is UNSAT
Problem TDEAD956 is UNSAT
Problem TDEAD957 is UNSAT
Problem TDEAD958 is UNSAT
Problem TDEAD959 is UNSAT
Problem TDEAD960 is UNSAT
Problem TDEAD961 is UNSAT
Problem TDEAD962 is UNSAT
Problem TDEAD963 is UNSAT
Problem TDEAD975 is UNSAT
Problem TDEAD976 is UNSAT
Problem TDEAD977 is UNSAT
Problem TDEAD978 is UNSAT
Problem TDEAD979 is UNSAT
Problem TDEAD980 is UNSAT
Problem TDEAD981 is UNSAT
Problem TDEAD982 is UNSAT
Problem TDEAD983 is UNSAT
Problem TDEAD995 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD999 is UNSAT
Problem TDEAD1000 is UNSAT
Problem TDEAD1001 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1020 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1040 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1135 is UNSAT
Problem TDEAD1136 is UNSAT
Problem TDEAD1137 is UNSAT
Problem TDEAD1138 is UNSAT
Problem TDEAD1139 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1142 is UNSAT
Problem TDEAD1143 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
At refinement iteration 2 (OVERLAPS) 1745/1919 variables, 174/348 constraints. Problems are: Problem set: 470 solved, 1715 unsolved
SMT process timed out in 87810ms, After SMT, problems are : Problem set: 470 solved, 1715 unsolved
Search for dead transitions found 470 dead transitions in 87908ms
Found 470 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 470 transitions
Dead transitions reduction (with SMT) removed 470 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 194/194 places, 1735/2205 transitions.
Computed a total of 1 stabilizing places and 22 stable transitions
Reduce places removed 0 places and 32 transitions.
Computed a total of 3 stabilizing places and 44 stable transitions
Graph (complete) has 4527 edges and 194 vertex of which 193 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 1703
Reduce places removed 0 places and 23 transitions.
Computed a total of 2 stabilizing places and 22 stable transitions
Graph (complete) has 4436 edges and 193 vertex of which 192 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 192 transition count 1680
Reduce places removed 0 places and 32 transitions.
Computed a total of 3 stabilizing places and 44 stable transitions
Graph (complete) has 4327 edges and 192 vertex of which 191 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 191 transition count 1648
Reduce places removed 0 places and 23 transitions.
Computed a total of 2 stabilizing places and 22 stable transitions
Graph (complete) has 4236 edges and 191 vertex of which 190 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 4 place count 190 transition count 1625
Reduce places removed 0 places and 32 transitions.
Computed a total of 3 stabilizing places and 44 stable transitions
Graph (complete) has 4127 edges and 190 vertex of which 189 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.11 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 5 place count 189 transition count 1593
Reduce places removed 0 places and 23 transitions.
Computed a total of 2 stabilizing places and 22 stable transitions
Graph (complete) has 4036 edges and 189 vertex of which 188 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 1 rules applied. Total rules applied 6 place count 188 transition count 1570
Reduce places removed 0 places and 32 transitions.
Computed a total of 3 stabilizing places and 44 stable transitions
Graph (complete) has 3927 edges and 188 vertex of which 187 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 1 rules applied. Total rules applied 7 place count 187 transition count 1538
Reduce places removed 0 places and 23 transitions.
Computed a total of 2 stabilizing places and 22 stable transitions
Graph (complete) has 3836 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 7 with 1 rules applied. Total rules applied 8 place count 186 transition count 1515
Reduce places removed 0 places and 32 transitions.
Computed a total of 3 stabilizing places and 44 stable transitions
Graph (complete) has 3727 edges and 186 vertex of which 185 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 8 with 1 rules applied. Total rules applied 9 place count 185 transition count 1483
Reduce places removed 0 places and 23 transitions.
Computed a total of 2 stabilizing places and 22 stable transitions
Graph (complete) has 3636 edges and 185 vertex of which 184 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 9 with 1 rules applied. Total rules applied 10 place count 184 transition count 1460
Reduce places removed 0 places and 32 transitions.
Computed a total of 3 stabilizing places and 44 stable transitions
Graph (complete) has 3527 edges and 184 vertex of which 183 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 10 with 1 rules applied. Total rules applied 11 place count 183 transition count 1428
Reduce places removed 0 places and 23 transitions.
Computed a total of 2 stabilizing places and 22 stable transitions
Graph (complete) has 3436 edges and 183 vertex of which 182 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 11 with 1 rules applied. Total rules applied 12 place count 182 transition count 1405
Reduce places removed 0 places and 32 transitions.
Computed a total of 3 stabilizing places and 44 stable transitions
Graph (complete) has 3326 edges and 182 vertex of which 181 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 12 with 1 rules applied. Total rules applied 13 place count 181 transition count 1373
Reduce places removed 0 places and 23 transitions.
Computed a total of 2 stabilizing places and 22 stable transitions
Graph (complete) has 3235 edges and 181 vertex of which 180 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 13 with 1 rules applied. Total rules applied 14 place count 180 transition count 1350
Reduce places removed 0 places and 31 transitions.
Computed a total of 3 stabilizing places and 44 stable transitions
Graph (complete) has 3128 edges and 180 vertex of which 179 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 14 with 1 rules applied. Total rules applied 15 place count 179 transition count 1319
Reduce places removed 0 places and 23 transitions.
Computed a total of 2 stabilizing places and 22 stable transitions
Graph (complete) has 3037 edges and 179 vertex of which 178 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 15 with 1 rules applied. Total rules applied 16 place count 178 transition count 1296
Reduce places removed 0 places and 31 transitions.
Computed a total of 2 stabilizing places and 22 stable transitions
Graph (complete) has 2943 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 16 with 1 rules applied. Total rules applied 17 place count 177 transition count 1265
Reduce places removed 0 places and 23 transitions.
Computed a total of 1 stabilizing places and 0 stable transitions
Graph (complete) has 2873 edges and 177 vertex of which 176 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 1 rules applied. Total rules applied 18 place count 176 transition count 1242
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 18 rules in 272 ms. Remains 176 /194 variables (removed 18) and now considering 1242/1735 (removed 493) transitions.
[2024-06-01 14:10:16] [INFO ] Flow matrix only has 989 transitions (discarded 253 similar events)
// Phase 1: matrix 989 rows 176 cols
[2024-06-01 14:10:16] [INFO ] Computed 49 invariants in 39 ms
[2024-06-01 14:10:16] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 14:10:16] [INFO ] Flow matrix only has 989 transitions (discarded 253 similar events)
[2024-06-01 14:10:16] [INFO ] Invariant cache hit.
[2024-06-01 14:10:17] [INFO ] State equation strengthened by 442 read => feed constraints.
[2024-06-01 14:10:17] [INFO ] Implicit Places using invariants and state equation in 629 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 176/194 places, 1242/2205 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 91272 ms. Remains : 176/194 places, 1242/2205 transitions.
Random walk for 1250000 steps, including 0 resets, run took 8562 ms (no deadlock found). (steps per millisecond=145 )
Random directed walk for 1250000 steps, including 0 resets, run took 9527 ms (no deadlock found). (steps per millisecond=131 )
[2024-06-01 14:10:35] [INFO ] Flow matrix only has 989 transitions (discarded 253 similar events)
[2024-06-01 14:10:35] [INFO ] Invariant cache hit.
[2024-06-01 14:10:35] [INFO ] [Real]Absence check using 46 positive place invariants in 65 ms returned sat
[2024-06-01 14:10:35] [INFO ] [Real]Absence check using 46 positive and 3 generalized place invariants in 25 ms returned sat
[2024-06-01 14:10:36] [INFO ] [Real]Absence check using state equation in 793 ms returned sat
[2024-06-01 14:10:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:10:37] [INFO ] [Nat]Absence check using 46 positive place invariants in 59 ms returned sat
[2024-06-01 14:10:37] [INFO ] [Nat]Absence check using 46 positive and 3 generalized place invariants in 8 ms returned sat
[2024-06-01 14:10:37] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2024-06-01 14:10:37] [INFO ] State equation strengthened by 442 read => feed constraints.
[2024-06-01 14:10:48] [INFO ] [Nat]Added 442 Read/Feed constraints in 10167 ms returned sat
[2024-06-01 14:10:48] [INFO ] Deduced a trap composed of 15 places in 428 ms of which 19 ms to minimize.
[2024-06-01 14:10:49] [INFO ] Deduced a trap composed of 17 places in 479 ms of which 4 ms to minimize.
[2024-06-01 14:10:49] [INFO ] Deduced a trap composed of 17 places in 429 ms of which 3 ms to minimize.
[2024-06-01 14:10:50] [INFO ] Deduced a trap composed of 17 places in 427 ms of which 10 ms to minimize.
[2024-06-01 14:10:50] [INFO ] Deduced a trap composed of 15 places in 402 ms of which 2 ms to minimize.
[2024-06-01 14:10:51] [INFO ] Deduced a trap composed of 16 places in 386 ms of which 2 ms to minimize.
[2024-06-01 14:10:51] [INFO ] Deduced a trap composed of 16 places in 398 ms of which 3 ms to minimize.
[2024-06-01 14:10:52] [INFO ] Deduced a trap composed of 15 places in 387 ms of which 3 ms to minimize.
[2024-06-01 14:10:52] [INFO ] Deduced a trap composed of 16 places in 448 ms of which 3 ms to minimize.
[2024-06-01 14:10:53] [INFO ] Deduced a trap composed of 14 places in 406 ms of which 2 ms to minimize.
[2024-06-01 14:10:53] [INFO ] Deduced a trap composed of 22 places in 366 ms of which 1 ms to minimize.
[2024-06-01 14:10:53] [INFO ] Deduced a trap composed of 22 places in 358 ms of which 4 ms to minimize.
[2024-06-01 14:10:54] [INFO ] Deduced a trap composed of 22 places in 393 ms of which 5 ms to minimize.
[2024-06-01 14:10:54] [INFO ] Deduced a trap composed of 22 places in 375 ms of which 2 ms to minimize.
[2024-06-01 14:10:55] [INFO ] Deduced a trap composed of 22 places in 360 ms of which 1 ms to minimize.
[2024-06-01 14:10:55] [INFO ] Deduced a trap composed of 22 places in 375 ms of which 1 ms to minimize.
[2024-06-01 14:10:56] [INFO ] Deduced a trap composed of 22 places in 361 ms of which 1 ms to minimize.
[2024-06-01 14:10:56] [INFO ] Deduced a trap composed of 22 places in 340 ms of which 1 ms to minimize.
[2024-06-01 14:10:56] [INFO ] Deduced a trap composed of 22 places in 386 ms of which 2 ms to minimize.
[2024-06-01 14:10:57] [INFO ] Deduced a trap composed of 22 places in 382 ms of which 2 ms to minimize.
[2024-06-01 14:10:57] [INFO ] Deduced a trap composed of 22 places in 377 ms of which 2 ms to minimize.
[2024-06-01 14:10:57] [INFO ] Trap strengthening procedure interrupted after too many repetitions 9712 ms
[2024-06-01 14:10:57] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 9713 ms
[2024-06-01 14:10:58] [INFO ] Computed and/alt/rep : 40/80/40 causal constraints (skipped 929 transitions) in 354 ms.
[2024-06-01 14:10:58] [INFO ] Deduced a trap composed of 22 places in 354 ms of which 1 ms to minimize.
[2024-06-01 14:10:59] [INFO ] Deduced a trap composed of 22 places in 297 ms of which 1 ms to minimize.
[2024-06-01 14:10:59] [INFO ] Deduced a trap composed of 22 places in 378 ms of which 2 ms to minimize.
[2024-06-01 14:11:00] [INFO ] Deduced a trap composed of 22 places in 367 ms of which 2 ms to minimize.
[2024-06-01 14:11:00] [INFO ] Deduced a trap composed of 22 places in 355 ms of which 1 ms to minimize.
[2024-06-01 14:11:01] [INFO ] Deduced a trap composed of 22 places in 369 ms of which 2 ms to minimize.
[2024-06-01 14:11:01] [INFO ] Deduced a trap composed of 22 places in 365 ms of which 2 ms to minimize.
[2024-06-01 14:11:02] [INFO ] Deduced a trap composed of 22 places in 362 ms of which 2 ms to minimize.
[2024-06-01 14:11:02] [INFO ] Deduced a trap composed of 22 places in 367 ms of which 2 ms to minimize.
[2024-06-01 14:11:02] [INFO ] Deduced a trap composed of 20 places in 354 ms of which 1 ms to minimize.
[2024-06-01 14:11:03] [INFO ] Deduced a trap composed of 20 places in 396 ms of which 2 ms to minimize.
[2024-06-01 14:11:03] [INFO ] Deduced a trap composed of 20 places in 386 ms of which 2 ms to minimize.
[2024-06-01 14:11:04] [INFO ] Deduced a trap composed of 20 places in 382 ms of which 2 ms to minimize.
[2024-06-01 14:11:04] [INFO ] Deduced a trap composed of 20 places in 383 ms of which 5 ms to minimize.
[2024-06-01 14:11:05] [INFO ] Deduced a trap composed of 20 places in 394 ms of which 2 ms to minimize.
[2024-06-01 14:11:05] [INFO ] Deduced a trap composed of 16 places in 381 ms of which 2 ms to minimize.
[2024-06-01 14:11:06] [INFO ] Deduced a trap composed of 22 places in 347 ms of which 1 ms to minimize.
[2024-06-01 14:11:06] [INFO ] Deduced a trap composed of 22 places in 387 ms of which 1 ms to minimize.
[2024-06-01 14:11:07] [INFO ] Deduced a trap composed of 22 places in 382 ms of which 1 ms to minimize.
[2024-06-01 14:11:07] [INFO ] Deduced a trap composed of 15 places in 365 ms of which 1 ms to minimize.
[2024-06-01 14:11:08] [INFO ] Deduced a trap composed of 23 places in 384 ms of which 1 ms to minimize.
[2024-06-01 14:11:08] [INFO ] Deduced a trap composed of 22 places in 410 ms of which 2 ms to minimize.
[2024-06-01 14:11:09] [INFO ] Deduced a trap composed of 22 places in 414 ms of which 2 ms to minimize.
[2024-06-01 14:11:09] [INFO ] Deduced a trap composed of 23 places in 397 ms of which 2 ms to minimize.
[2024-06-01 14:11:10] [INFO ] Deduced a trap composed of 22 places in 420 ms of which 2 ms to minimize.
[2024-06-01 14:11:10] [INFO ] Deduced a trap composed of 20 places in 423 ms of which 2 ms to minimize.
[2024-06-01 14:11:11] [INFO ] Deduced a trap composed of 20 places in 397 ms of which 2 ms to minimize.
[2024-06-01 14:11:11] [INFO ] Deduced a trap composed of 24 places in 429 ms of which 2 ms to minimize.
[2024-06-01 14:11:12] [INFO ] Deduced a trap composed of 22 places in 428 ms of which 2 ms to minimize.
[2024-06-01 14:11:12] [INFO ] Deduced a trap composed of 23 places in 425 ms of which 3 ms to minimize.
[2024-06-01 14:11:13] [INFO ] Deduced a trap composed of 22 places in 415 ms of which 2 ms to minimize.
[2024-06-01 14:11:13] [INFO ] Deduced a trap composed of 22 places in 430 ms of which 2 ms to minimize.
[2024-06-01 14:11:14] [INFO ] Deduced a trap composed of 15 places in 415 ms of which 2 ms to minimize.
[2024-06-01 14:11:14] [INFO ] Deduced a trap composed of 14 places in 419 ms of which 2 ms to minimize.
[2024-06-01 14:11:15] [INFO ] Deduced a trap composed of 17 places in 415 ms of which 2 ms to minimize.
[2024-06-01 14:11:16] [INFO ] Deduced a trap composed of 18 places in 409 ms of which 3 ms to minimize.
[2024-06-01 14:11:16] [INFO ] Deduced a trap composed of 18 places in 416 ms of which 3 ms to minimize.
[2024-06-01 14:11:17] [INFO ] Deduced a trap composed of 18 places in 418 ms of which 2 ms to minimize.
[2024-06-01 14:11:17] [INFO ] Deduced a trap composed of 18 places in 422 ms of which 2 ms to minimize.
[2024-06-01 14:11:18] [INFO ] Deduced a trap composed of 18 places in 423 ms of which 2 ms to minimize.
[2024-06-01 14:11:18] [INFO ] Deduced a trap composed of 18 places in 421 ms of which 2 ms to minimize.
[2024-06-01 14:11:19] [INFO ] Deduced a trap composed of 18 places in 416 ms of which 2 ms to minimize.
[2024-06-01 14:11:19] [INFO ] Deduced a trap composed of 16 places in 395 ms of which 2 ms to minimize.
[2024-06-01 14:11:20] [INFO ] Deduced a trap composed of 15 places in 400 ms of which 2 ms to minimize.
[2024-06-01 14:11:20] [INFO ] Deduced a trap composed of 18 places in 424 ms of which 2 ms to minimize.
[2024-06-01 14:11:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 45 trap constraints in 22305 ms
[2024-06-01 14:11:20] [INFO ] Solution in real domain found non-integer solution.
Random directed walk for 500008 steps, including 0 resets, run took 3477 ms (no deadlock found). (steps per millisecond=143 )
Random walk for 500000 steps, including 0 resets, run took 3166 ms (no deadlock found). (steps per millisecond=157 )
Random directed walk for 500000 steps, including 0 resets, run took 3158 ms (no deadlock found). (steps per millisecond=158 )
Random walk for 500000 steps, including 0 resets, run took 3172 ms (no deadlock found). (steps per millisecond=157 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 176/176 places, 1242/1242 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 47 ms. Remains 176 /176 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2024-06-01 14:11:33] [INFO ] Flow matrix only has 989 transitions (discarded 253 similar events)
[2024-06-01 14:11:33] [INFO ] Invariant cache hit.
[2024-06-01 14:11:33] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 14:11:33] [INFO ] Flow matrix only has 989 transitions (discarded 253 similar events)
[2024-06-01 14:11:33] [INFO ] Invariant cache hit.
[2024-06-01 14:11:34] [INFO ] State equation strengthened by 442 read => feed constraints.
[2024-06-01 14:11:34] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2024-06-01 14:11:34] [INFO ] Redundant transitions in 108 ms returned []
Running 1222 sub problems to find dead transitions.
[2024-06-01 14:11:34] [INFO ] Flow matrix only has 989 transitions (discarded 253 similar events)
[2024-06-01 14:11:34] [INFO ] Invariant cache hit.
[2024-06-01 14:11:34] [INFO ] State equation strengthened by 442 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (OVERLAPS) 20/176 variables, 41/204 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/1165 variables, and 225 constraints, problems are : Problem set: 0 solved, 1222 unsolved in 30039 ms.
Refiners :[Domain max(s): 176/176 constraints, Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 0/176 constraints, ReadFeed: 0/442 constraints, PredecessorRefiner: 1222/1222 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1222 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 5/161 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 4 (OVERLAPS) 20/176 variables, 41/204 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 1222 unsolved
[2024-06-01 14:12:31] [INFO ] Deduced a trap composed of 14 places in 503 ms of which 3 ms to minimize.
[2024-06-01 14:12:39] [INFO ] Deduced a trap composed of 17 places in 422 ms of which 2 ms to minimize.
[2024-06-01 14:12:40] [INFO ] Deduced a trap composed of 16 places in 419 ms of which 2 ms to minimize.
[2024-06-01 14:12:40] [INFO ] Deduced a trap composed of 17 places in 417 ms of which 2 ms to minimize.
[2024-06-01 14:12:41] [INFO ] Deduced a trap composed of 14 places in 401 ms of which 2 ms to minimize.
[2024-06-01 14:12:41] [INFO ] Deduced a trap composed of 15 places in 460 ms of which 2 ms to minimize.
[2024-06-01 14:12:42] [INFO ] Deduced a trap composed of 20 places in 475 ms of which 3 ms to minimize.
[2024-06-01 14:12:42] [INFO ] Deduced a trap composed of 15 places in 462 ms of which 2 ms to minimize.
[2024-06-01 14:12:43] [INFO ] Deduced a trap composed of 17 places in 433 ms of which 3 ms to minimize.
[2024-06-01 14:12:43] [INFO ] Deduced a trap composed of 14 places in 423 ms of which 2 ms to minimize.
[2024-06-01 14:12:43] [INFO ] Deduced a trap composed of 14 places in 415 ms of which 2 ms to minimize.
SMT process timed out in 69316ms, After SMT, problems are : Problem set: 0 solved, 1222 unsolved
Search for dead transitions found 0 dead transitions in 69348ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 70121 ms. Remains : 176/176 places, 1242/1242 transitions.
Random walk for 1250000 steps, including 0 resets, run took 8561 ms (no deadlock found). (steps per millisecond=146 )
Random directed walk for 1250001 steps, including 0 resets, run took 7776 ms (no deadlock found). (steps per millisecond=160 )
[2024-06-01 14:13:00] [INFO ] Flow matrix only has 989 transitions (discarded 253 similar events)
[2024-06-01 14:13:00] [INFO ] Invariant cache hit.
[2024-06-01 14:13:00] [INFO ] [Real]Absence check using 46 positive place invariants in 41 ms returned sat
[2024-06-01 14:13:00] [INFO ] [Real]Absence check using 46 positive and 3 generalized place invariants in 13 ms returned sat
[2024-06-01 14:13:01] [INFO ] [Real]Absence check using state equation in 703 ms returned sat
[2024-06-01 14:13:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 14:13:01] [INFO ] [Nat]Absence check using 46 positive place invariants in 53 ms returned sat
[2024-06-01 14:13:01] [INFO ] [Nat]Absence check using 46 positive and 3 generalized place invariants in 9 ms returned sat
[2024-06-01 14:13:02] [INFO ] [Nat]Absence check using state equation in 823 ms returned sat
[2024-06-01 14:13:02] [INFO ] State equation strengthened by 442 read => feed constraints.
[2024-06-01 14:13:13] [INFO ] [Nat]Added 442 Read/Feed constraints in 10981 ms returned sat
[2024-06-01 14:13:13] [INFO ] Deduced a trap composed of 15 places in 251 ms of which 1 ms to minimize.
[2024-06-01 14:13:14] [INFO ] Deduced a trap composed of 17 places in 242 ms of which 2 ms to minimize.
[2024-06-01 14:13:14] [INFO ] Deduced a trap composed of 17 places in 310 ms of which 2 ms to minimize.
[2024-06-01 14:13:14] [INFO ] Deduced a trap composed of 17 places in 337 ms of which 1 ms to minimize.
[2024-06-01 14:13:15] [INFO ] Deduced a trap composed of 15 places in 371 ms of which 2 ms to minimize.
[2024-06-01 14:13:15] [INFO ] Deduced a trap composed of 16 places in 330 ms of which 1 ms to minimize.
[2024-06-01 14:13:16] [INFO ] Deduced a trap composed of 16 places in 401 ms of which 2 ms to minimize.
[2024-06-01 14:13:16] [INFO ] Deduced a trap composed of 15 places in 379 ms of which 2 ms to minimize.
[2024-06-01 14:13:17] [INFO ] Deduced a trap composed of 16 places in 443 ms of which 2 ms to minimize.
[2024-06-01 14:13:17] [INFO ] Deduced a trap composed of 14 places in 397 ms of which 2 ms to minimize.
[2024-06-01 14:13:18] [INFO ] Deduced a trap composed of 22 places in 365 ms of which 11 ms to minimize.
[2024-06-01 14:13:18] [INFO ] Deduced a trap composed of 22 places in 375 ms of which 1 ms to minimize.
[2024-06-01 14:13:18] [INFO ] Deduced a trap composed of 22 places in 367 ms of which 2 ms to minimize.
[2024-06-01 14:13:19] [INFO ] Deduced a trap composed of 22 places in 373 ms of which 1 ms to minimize.
[2024-06-01 14:13:19] [INFO ] Deduced a trap composed of 22 places in 352 ms of which 2 ms to minimize.
[2024-06-01 14:13:20] [INFO ] Deduced a trap composed of 22 places in 369 ms of which 2 ms to minimize.
[2024-06-01 14:13:20] [INFO ] Deduced a trap composed of 22 places in 363 ms of which 2 ms to minimize.
[2024-06-01 14:13:21] [INFO ] Deduced a trap composed of 22 places in 367 ms of which 1 ms to minimize.
[2024-06-01 14:13:21] [INFO ] Deduced a trap composed of 22 places in 375 ms of which 2 ms to minimize.
[2024-06-01 14:13:21] [INFO ] Deduced a trap composed of 22 places in 365 ms of which 2 ms to minimize.
[2024-06-01 14:13:22] [INFO ] Deduced a trap composed of 22 places in 370 ms of which 2 ms to minimize.
[2024-06-01 14:13:22] [INFO ] Trap strengthening procedure interrupted after too many repetitions 8740 ms
[2024-06-01 14:13:22] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 8740 ms
[2024-06-01 14:13:22] [INFO ] Computed and/alt/rep : 40/80/40 causal constraints (skipped 929 transitions) in 205 ms.
[2024-06-01 14:13:23] [INFO ] Deduced a trap composed of 22 places in 227 ms of which 1 ms to minimize.
[2024-06-01 14:13:23] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 1 ms to minimize.
[2024-06-01 14:13:23] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 1 ms to minimize.
[2024-06-01 14:13:23] [INFO ] Deduced a trap composed of 22 places in 248 ms of which 1 ms to minimize.
[2024-06-01 14:13:24] [INFO ] Deduced a trap composed of 22 places in 271 ms of which 2 ms to minimize.
[2024-06-01 14:13:24] [INFO ] Deduced a trap composed of 22 places in 309 ms of which 2 ms to minimize.
[2024-06-01 14:13:24] [INFO ] Deduced a trap composed of 22 places in 316 ms of which 2 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 22 places in 355 ms of which 2 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 22 places in 371 ms of which 2 ms to minimize.
[2024-06-01 14:13:26] [INFO ] Deduced a trap composed of 20 places in 392 ms of which 2 ms to minimize.
[2024-06-01 14:13:26] [INFO ] Deduced a trap composed of 20 places in 379 ms of which 1 ms to minimize.
[2024-06-01 14:13:27] [INFO ] Deduced a trap composed of 20 places in 387 ms of which 2 ms to minimize.
[2024-06-01 14:13:27] [INFO ] Deduced a trap composed of 20 places in 395 ms of which 2 ms to minimize.
[2024-06-01 14:13:28] [INFO ] Deduced a trap composed of 20 places in 385 ms of which 1 ms to minimize.
[2024-06-01 14:13:28] [INFO ] Deduced a trap composed of 20 places in 392 ms of which 2 ms to minimize.
[2024-06-01 14:13:29] [INFO ] Deduced a trap composed of 16 places in 394 ms of which 2 ms to minimize.
[2024-06-01 14:13:29] [INFO ] Deduced a trap composed of 22 places in 395 ms of which 2 ms to minimize.
[2024-06-01 14:13:30] [INFO ] Deduced a trap composed of 22 places in 388 ms of which 2 ms to minimize.
[2024-06-01 14:13:30] [INFO ] Deduced a trap composed of 22 places in 385 ms of which 2 ms to minimize.
[2024-06-01 14:13:31] [INFO ] Deduced a trap composed of 15 places in 385 ms of which 2 ms to minimize.
[2024-06-01 14:13:31] [INFO ] Deduced a trap composed of 23 places in 416 ms of which 2 ms to minimize.
[2024-06-01 14:13:32] [INFO ] Deduced a trap composed of 22 places in 411 ms of which 2 ms to minimize.
[2024-06-01 14:13:32] [INFO ] Deduced a trap composed of 22 places in 436 ms of which 1 ms to minimize.
[2024-06-01 14:13:33] [INFO ] Deduced a trap composed of 23 places in 419 ms of which 2 ms to minimize.
[2024-06-01 14:13:33] [INFO ] Deduced a trap composed of 22 places in 411 ms of which 3 ms to minimize.
[2024-06-01 14:13:34] [INFO ] Deduced a trap composed of 20 places in 386 ms of which 2 ms to minimize.
[2024-06-01 14:13:34] [INFO ] Deduced a trap composed of 20 places in 440 ms of which 2 ms to minimize.
[2024-06-01 14:13:35] [INFO ] Deduced a trap composed of 24 places in 435 ms of which 1 ms to minimize.
[2024-06-01 14:13:35] [INFO ] Deduced a trap composed of 22 places in 424 ms of which 2 ms to minimize.
[2024-06-01 14:13:36] [INFO ] Deduced a trap composed of 23 places in 433 ms of which 2 ms to minimize.
[2024-06-01 14:13:36] [INFO ] Deduced a trap composed of 22 places in 437 ms of which 2 ms to minimize.
[2024-06-01 14:13:37] [INFO ] Deduced a trap composed of 22 places in 384 ms of which 1 ms to minimize.
[2024-06-01 14:13:37] [INFO ] Deduced a trap composed of 15 places in 414 ms of which 1 ms to minimize.
[2024-06-01 14:13:38] [INFO ] Deduced a trap composed of 14 places in 411 ms of which 3 ms to minimize.
[2024-06-01 14:13:38] [INFO ] Deduced a trap composed of 17 places in 402 ms of which 2 ms to minimize.
[2024-06-01 14:13:39] [INFO ] Deduced a trap composed of 18 places in 416 ms of which 2 ms to minimize.
[2024-06-01 14:13:40] [INFO ] Deduced a trap composed of 18 places in 423 ms of which 2 ms to minimize.
[2024-06-01 14:13:40] [INFO ] Deduced a trap composed of 18 places in 437 ms of which 2 ms to minimize.
[2024-06-01 14:13:41] [INFO ] Deduced a trap composed of 18 places in 438 ms of which 3 ms to minimize.
[2024-06-01 14:13:41] [INFO ] Deduced a trap composed of 18 places in 432 ms of which 2 ms to minimize.
[2024-06-01 14:13:42] [INFO ] Deduced a trap composed of 18 places in 438 ms of which 3 ms to minimize.
[2024-06-01 14:13:42] [INFO ] Deduced a trap composed of 18 places in 479 ms of which 2 ms to minimize.
[2024-06-01 14:13:43] [INFO ] Deduced a trap composed of 16 places in 409 ms of which 2 ms to minimize.
[2024-06-01 14:13:43] [INFO ] Deduced a trap composed of 15 places in 414 ms of which 2 ms to minimize.
[2024-06-01 14:13:44] [INFO ] Deduced a trap composed of 18 places in 391 ms of which 3 ms to minimize.
[2024-06-01 14:13:44] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 45 trap constraints in 21631 ms
[2024-06-01 14:13:44] [INFO ] Solution in real domain found non-integer solution.
Random directed walk for 500010 steps, including 0 resets, run took 3791 ms (no deadlock found). (steps per millisecond=131 )
Random walk for 500000 steps, including 0 resets, run took 3280 ms (no deadlock found). (steps per millisecond=152 )
Random directed walk for 500001 steps, including 0 resets, run took 3269 ms (no deadlock found). (steps per millisecond=152 )
Random walk for 500000 steps, including 0 resets, run took 3216 ms (no deadlock found). (steps per millisecond=155 )
[2024-06-01 14:13:58] [INFO ] Flatten gal took : 567 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 194/194 places, 2205/2205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 192 transition count 2203
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 64 place count 152 transition count 2183
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 104 place count 132 transition count 2163
Applied a total of 104 rules in 98 ms. Remains 132 /194 variables (removed 62) and now considering 2163/2205 (removed 42) transitions.
[2024-06-01 14:13:59] [INFO ] Flow matrix only has 1703 transitions (discarded 460 similar events)
// Phase 1: matrix 1703 rows 132 cols
[2024-06-01 14:13:59] [INFO ] Invariants computation overflowed in 11 ms
[2024-06-01 14:13:59] [INFO ] Implicit Places using invariants in 458 ms returned []
[2024-06-01 14:13:59] [INFO ] Flow matrix only has 1703 transitions (discarded 460 similar events)
// Phase 1: matrix 1703 rows 132 cols
[2024-06-01 14:13:59] [INFO ] Invariants computation overflowed in 15 ms
[2024-06-01 14:14:00] [INFO ] State equation strengthened by 820 read => feed constraints.
[2024-06-01 14:14:07] [INFO ] Implicit Places using invariants and state equation in 7821 ms returned [22, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 8298 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 130/194 places, 2163/2205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 50 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 128 transition count 2161
Applied a total of 4 rules in 140 ms. Remains 128 /130 variables (removed 2) and now considering 2161/2163 (removed 2) transitions.
[2024-06-01 14:14:07] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2024-06-01 14:14:07] [INFO ] Invariants computation overflowed in 12 ms
[2024-06-01 14:14:08] [INFO ] Implicit Places using invariants in 605 ms returned []
[2024-06-01 14:14:08] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2024-06-01 14:14:08] [INFO ] Invariants computation overflowed in 11 ms
[2024-06-01 14:14:08] [INFO ] State equation strengthened by 820 read => feed constraints.
[2024-06-01 14:14:13] [INFO ] Implicit Places using invariants and state equation in 5325 ms returned []
Implicit Place search using SMT with State Equation took 5940 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 128/194 places, 2161/2205 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 14477 ms. Remains : 128/194 places, 2161/2205 transitions.
Initial state reduction rules removed 20 formulas.
RANDOM walk for 40000 steps (8 resets) in 12627 ms. (3 steps per ms) remains 1093/2141 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1092/1093 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1092/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1092 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1091/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1091 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1090/1090 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1090/1090 properties
[2024-06-01 14:14:17] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2024-06-01 14:14:17] [INFO ] Invariants computation overflowed in 6 ms
[2024-06-01 14:14:17] [INFO ] State equation strengthened by 820 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 1090 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 99/1829 variables, and 99 constraints, problems are : Problem set: 0 solved, 1090 unsolved in 5035 ms.
Refiners :[Domain max(s): 99/128 constraints, State Equation: 0/128 constraints, ReadFeed: 0/820 constraints, PredecessorRefiner: 1090/1072 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1090 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 1090 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 99/1829 variables, and 99 constraints, problems are : Problem set: 0 solved, 1090 unsolved in 5039 ms.
Refiners :[Domain max(s): 99/128 constraints, State Equation: 0/128 constraints, ReadFeed: 0/820 constraints, PredecessorRefiner: 18/1072 constraints, Known Traps: 0/0 constraints]
After SMT, in 22703ms problems are : Problem set: 0 solved, 1090 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 99 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 2161/2161 transitions.
Applied a total of 0 rules in 153 ms. Remains 128 /128 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 128/128 places, 2161/2161 transitions.
RANDOM walk for 1164141 steps (0 resets) in 120004 ms. (9 steps per ms) remains 964/1090 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 80 ms. (49 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 82 ms. (48 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 964/964 properties
[2024-06-01 14:15:11] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2024-06-01 14:15:11] [INFO ] Invariants computation overflowed in 6 ms
[2024-06-01 14:15:11] [INFO ] State equation strengthened by 820 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 2 (OVERLAPS) 1701/1787 variables, 86/172 constraints. Problems are: Problem set: 0 solved, 964 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 132.0)
(t1 2.0)
(t2 2.0)
(t3 2.0)
(t4 2.0)
(t5 2.0)
(t6 2.0)
(t7 2.0)
(t8 2.0)
(t9 2.0)
(t10 2.0)
(t11 2.0)
(t12 2.0)
(t13 2.0)
(t14 2.0)
(t15 2.0)
(t16 2.0)
(t17 2.0)
(t18 2.0)
(t19 2.0)
(t20 0.0)
(t21 0.0)
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 0.0)
(t28 0.0)
(t29 11.0)
(t30 10.0)
(t31 9.0)
(t32 8.0)
(t33 7.0)
(t34 6.0)
(t35 5.0)
(t36 4.0)
(t37 3.0)
(t38 2.0)
(t39 1.0)
(t40 0.0)
(t41 0.0)
(t42 0.0)
(t43 0.0)
(t44 0.0)
(t45 0.0)
(t46 1.0)
(t47 0.0)
(t48 0.0)
(t49 0.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 0.0)
(t58 0.0)
(t59 0.0)
(t60 0.0)
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 0.0)
(t65 0.0)
(t66 1.0)
(t67 0.0)
(t68 0.0)
(t69 0.0)
(t70 0.0)
(t71 0.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 0.0)
(t77 0.0)
(t78 0.0)
(t79 0.0)
(t80 0.0)
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 1.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 0.0)
(t99 0.0)
(t100 0.0)
(t101 0.0)
(t102 0.0)
(t103 0.0)
(t104 0.0)
(t105 0.0)
(t106 0.0)
(t107 0.0)
(t108 1.0)
(t109 0.0)
(t110 0.0)
(t111 0.0)
(t112 0.0)
(t113 0.0)
(t114 0.0)
(t115 0.0)
(t116 0.0)
(t117 0.0)
(t118 0.0)
(t119 0.0)
(t120 0.0)
(t121 0.0)
(t122 0.0)
(t123 1.0)
(t124 0.0)
(t125 0.0)
(t126 0.0)
(t127 0.0)
(t128 0.0)
(t129 0.0)
(t130 0.0)
(t131 0.0)
(t132 0.0)
(t133 0.0)
(t134 0.0)
(t135 0.0)
(t136 0.0)
(t137 0.0)
(t138 0.0)
(t139 0.0)
(t140 0.0)
(t141 0.0)
(t142 0.0)
(t143 0.0)
(t144 1.0)
(t145 0.0)
(t146 0.0)
(t147 0.0)
(t148 0.0)
(t149 0.0)
(t150 0.0)
(t151 0.0)
(t152 0.0)
(t153 0.0)
(t154 0.0)
(t155 0.0)
(t156 0.0)
(t157 0.0)
(t158 0.0)
(t159 0.0)
(t160 0.0)
(t161 0.0)
(t162 1.0)
(t163 0.0)
(t164 0.0)
(t165 0.0)
(t166 0.0)
(t167 0.0)
(t168 0.0)
(t169 0.0)
(t170 0.0)
(t171 0.0)
(t172 0.0)
(t173 0.0)
(t174 0.0)
(t175 0.0)
(t176 0.0)
(t177 0.0)
(t178 0.0)
(t179 0.0)
(t180 0.0)
(t181 0.0)
(t182 0.0)
(t183 0.0)
(t184 0.0)
(t185 0.0)
(t186 0.0)
(t187 0.0)
(t188 1.0)
(t189 0.0)
(t190 0.0)
(t191 0.0)
(t192 0.0)
(t193 0.0)
(t194 0.0)
(t195 0.0)
(t196 0.0)
(t197 0.0)
(t198 0.0)
(t199 0.0)
(t200 0.0)
(t201 0.0)
(t202 0.0)
(t203 0.0)
(t204 1.0)
(t205 0.0)
(t206 0.0)
(t207 0.0)
(t208 0.0)
(t209 0.0)
(t210 0.0)
(t211 0.0)
(t212 0.0)
(t213 0.0)
(t214 0.0)
(t215 0.0)
(t216 0.0)
(t217 0.0)
(t218 0.0)
(t219 0.0)
(t220 1.0)
(t221 0.0)
(t222 0.0)
(t223 0.0)
(t224 0.0)
(t225 0.0)
(t226 0.0)
(t227 0.0)
(t228 0.0)
(t229 0.0)
(t230 0.0)
(t231 0.0)
(t232 0.0)
(t233 0.0)
(t234 0.0)
(t235 0.0)
(t236 0.0)
(t237 0.0)
(t238 0.0)
(t239 0.0)
(t240 0.0)
(t241 0.0)
(t242 0.0)
(t243 1.0)
(t244 0.0)
(t245 0.0)
(t246 0.0)
(t247 0.0)
(t248 0.0)
(t249 0.0)
(t250 0.0)
(t251 0.0)
(t252 0.0)
(t253 0.0)
(t254 0.0)
(t255 0.0)
(t256 0.0)
(t257 0.0)
(t258 0.0)
(t259 0.0)
(t260 0.0)
(t261 0.0)
(t262 0.0)
(t263 1.0)
(t264 0.0)
(t265 0.0)
(t266 0.0)
(t267 0.0)
(t268 0.0)
(t269 0.0)
(t270 0.0)
(t271 0.0)
(t272 0.0)
(t273 0.0)
(t274 0.0)
(t275 0.0)
(t276 0.0)
(t277 0.0)
(t278 0.0)
(t279 0.0)
(t280 0.0)
(t281 0.0)
(t282 0.0)
(t283 0.0)
(t284 0.0)
(t285 0.0)
(t286 0.0)
(t287 1.0)
(t288 0.0)
(t289 0.0)
(t290 0.0)
(t291 0.0)
(t292 0.0)
(t293 0.0)
(t294 0.0)
(t295 0.0)
(t296 0.0)
(t297 0.0)
(t298 0.0)
(t299 0.0)
(t300 0.0)
(t301 0.0)
(t302 0.0)
(t303 1.0)
(t304 0.0)
(t305 0.0)
(t306 0.0)
(t307 0.0)
(t308 0.0)
(t309 0.0)
(t310 0.0)
(t311 0.0)
(t312 0.0)
(t313 0.0)
(t314 0.0)
(t315 0.0)
(t316 0.0)
(t317 0.0)
(t318 0.0)
(t319 0.0)
(t320 0.0)
(t321 0.0)
(t322 0.0)
(t323 1.0)
(t324 0.0)
(t325 0.0)
(t326 0.0)
(t327 0.0)
(t328 0.0)
(t329 0.0)
(t330 0.0)
(t331 0.0)
(t332 0.0)
(t333 0.0)
(t334 0.0)
(t335 0.0)
(t336 0.0)
(t337 0.0)
(t338 0.0)
(t339 0.0)
(t340 0.0)
(t341 0.0)
(t342 0.0)
(t343 0.0)
(t344 0.0)
(t345 0.0)
(t346 1.0)
(t347 0.0)
(t348 0.0)
(t349 0.0)
(t350 0.0)
(t351 0.0)
(t352 0.0)
(t353 0.0)
(t354 0.0)
(t355 0.0)
(t356 0.0)
(t357 0.0)
(t358 0.0)
(t359 0.0)
(t360 0.0)
(t361 1.0)
(t362 0.0)
(t363 0.0)
(t364 0.0)
(t365 0.0)
(t366 0.0)
(t367 0.0)
(t368 0.0)
(t369 0.0)
(t370 0.0)
(t371 0.0)
(t372 0.0)
(t373 0.0)
(t374 0.0)
(t375 0.0)
(t376 0.0)
(t377 0.0)
(t378 0.0)
(t379 0.0)
(t380 0.0)
(t381 0.0)
(t382 0.0)
(t383 0.0)
(t384 0.0)
(t385 0.0)
(t386 0.0)
(t387 1.0)
(t388 0.0)
(t389 0.0)
(t390 0.0)
(t391 0.0)
(t392 0.0)
(t393 0.0)
(t394 0.0)
(t395 0.0)
(t396 0.0)
(t397 0.0)
(t398 0.0)
(t399 0.0)
(t400 0.0)
(t401 0.0)
(t402 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 57162ms, After SMT, problems are : Problem set: 0 solved, 964 unsolved
Fused 964 Parikh solutions to 22 different solutions.
Parikh walk visited 0 properties in 1627 ms.
Support contains 86 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 2161/2161 transitions.
Applied a total of 0 rules in 150 ms. Remains 128 /128 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 128/128 places, 2161/2161 transitions.
RANDOM walk for 1244637 steps (0 resets) in 120004 ms. (10 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 964/964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 964/964 properties
Probabilistic random walk after 1000001 steps, saw 604471 distinct states, run finished after 58412 ms. (steps per millisecond=17 ) properties seen :0
[2024-06-01 14:17:39] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2024-06-01 14:17:39] [INFO ] Invariants computation overflowed in 7 ms
[2024-06-01 14:17:39] [INFO ] State equation strengthened by 820 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 2 (OVERLAPS) 1701/1787 variables, 86/172 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1787 variables, 820/992 constraints. Problems are: Problem set: 0 solved, 964 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1787/1829 variables, and 992 constraints, problems are : Problem set: 0 solved, 964 unsolved in 75036 ms.
Refiners :[Domain max(s): 86/128 constraints, State Equation: 86/128 constraints, ReadFeed: 820/820 constraints, PredecessorRefiner: 964/946 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 964 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 86/86 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 2 (OVERLAPS) 1701/1787 variables, 86/172 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1787 variables, 820/992 constraints. Problems are: Problem set: 0 solved, 964 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1787/1829 variables, and 992 constraints, problems are : Problem set: 0 solved, 964 unsolved in 75040 ms.
Refiners :[Domain max(s): 86/128 constraints, State Equation: 86/128 constraints, ReadFeed: 820/820 constraints, PredecessorRefiner: 18/946 constraints, Known Traps: 0/0 constraints]
After SMT, in 162496ms problems are : Problem set: 0 solved, 964 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 86 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 2161/2161 transitions.
Applied a total of 0 rules in 153 ms. Remains 128 /128 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 128/128 places, 2161/2161 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 2161/2161 transitions.
Applied a total of 0 rules in 144 ms. Remains 128 /128 variables (removed 0) and now considering 2161/2161 (removed 0) transitions.
[2024-06-01 14:20:22] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2024-06-01 14:20:22] [INFO ] Invariants computation overflowed in 11 ms
[2024-06-01 14:20:22] [INFO ] Implicit Places using invariants in 256 ms returned []
[2024-06-01 14:20:22] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2024-06-01 14:20:22] [INFO ] Invariants computation overflowed in 15 ms
[2024-06-01 14:20:23] [INFO ] State equation strengthened by 820 read => feed constraints.
[2024-06-01 14:20:24] [INFO ] Implicit Places using invariants and state equation in 2433 ms returned []
Implicit Place search using SMT with State Equation took 2693 ms to find 0 implicit places.
[2024-06-01 14:20:24] [INFO ] Redundant transitions in 143 ms returned []
Running 2141 sub problems to find dead transitions.
[2024-06-01 14:20:24] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2024-06-01 14:20:24] [INFO ] Invariants computation overflowed in 10 ms
[2024-06-01 14:20:25] [INFO ] State equation strengthened by 820 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 2141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2141 unsolved
At refinement iteration 2 (OVERLAPS) 1701/1809 variables, 108/216 constraints. Problems are: Problem set: 0 solved, 2141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1809 variables, 820/1036 constraints. Problems are: Problem set: 0 solved, 2141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1809/1829 variables, and 1036 constraints, problems are : Problem set: 0 solved, 2141 unsolved in 30058 ms.
Refiners :[Domain max(s): 108/128 constraints, State Equation: 108/128 constraints, ReadFeed: 820/820 constraints, PredecessorRefiner: 2141/2101 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 108/108 constraints. Problems are: Problem set: 0 solved, 2141 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 2141 unsolved
At refinement iteration 2 (OVERLAPS) 1701/1809 variables, 108/216 constraints. Problems are: Problem set: 0 solved, 2141 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1809 variables, 820/1036 constraints. Problems are: Problem set: 0 solved, 2141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1809/1829 variables, and 2297 constraints, problems are : Problem set: 0 solved, 2141 unsolved in 31750 ms.
Refiners :[Domain max(s): 108/128 constraints, State Equation: 108/128 constraints, ReadFeed: 820/820 constraints, PredecessorRefiner: 1301/2101 constraints, Known Traps: 0/0 constraints]
After SMT, in 88543ms problems are : Problem set: 0 solved, 2141 unsolved
Search for dead transitions found 0 dead transitions in 88583ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91579 ms. Remains : 128/128 places, 2161/2161 transitions.
RANDOM walk for 400000 steps (8 resets) in 9180 ms. (43 steps per ms) remains 18/86 properties
Running SMT prover for 18 properties.
[2024-06-01 14:21:56] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2024-06-01 14:21:56] [INFO ] Invariants computation overflowed in 6 ms
[2024-06-01 14:21:57] [INFO ] After 1118ms SMT Verify possible using state equation in real domain returned unsat :2 sat :16
[2024-06-01 14:21:57] [INFO ] State equation strengthened by 820 read => feed constraints.
[2024-06-01 14:21:58] [INFO ] After 1402ms SMT Verify possible using 820 Read/Feed constraints in real domain returned unsat :2 sat :16
TRAPS : Iteration 0
[2024-06-01 14:22:01] [INFO ] After 4054ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:16
[2024-06-01 14:22:01] [INFO ] After 5326ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:16
[2024-06-01 14:22:03] [INFO ] After 2256ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :16
[2024-06-01 14:22:06] [INFO ] After 3006ms SMT Verify possible using 820 Read/Feed constraints in natural domain returned unsat :2 sat :16
TRAPS : Iteration 0
[2024-06-01 14:22:12] [INFO ] After 8970ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :16
[2024-06-01 14:22:17] [INFO ] After 15714ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :16
Successfully simplified 2 atomic propositions for a total of 88 simplifications.
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 813088 ms.
ITS solved all properties within timeout
BK_STOP 1717251737359
--------------------
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 Liveness -timeout 180 -rebuildPNML
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="SimpleLoadBal-PT-20"
export BK_EXAMINATION="Liveness"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 SimpleLoadBal-PT-20, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r534-smll-171683819400114"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-20.tgz
mv SimpleLoadBal-PT-20 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.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 [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;